Submission #8542730

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n) - 1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
#define sz(v) (int)v.size()
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
const int MOD = 1000000007;
const int INF = 1000000001;
const ll LINF = 1000000001000000001LL;
const char EOL = '\n';
 
void solve();
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(numeric_limits<double>::max_digits10);
    solve();
    return 0;
}
 

void solve() {
    string s;
    cin >> s;

    vector<bool> b(8, true);
    deque<char> q;
    REPR(i, sz(s)) if (b[(int)(s[i] - 'A')]) {
        q.emplace_front(s[i]);
        b[(int)(s[i] - 'A')] = false;
    }
    REP(i, 8) if (b[i]) q.emplace_front((char)('A' + i));
    for (char c : q) cout << c; cout << EOL;
}

Submission Info

Judge Result