Submission #3269977

---

Source Code Expand

/**
 *      AGC 22 A
 *      author  : kyomukyomupurin
 *      created : 2018-09-25 15:48:55
**/

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

bool isTasai(string S){
    for (auto c = 'a'; c <= 'z'; ++c) {
        if (count(S.begin(), S.end(), c) > 1){
            return false;
        }
    }
    return true;
}

int main(){ 
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    string S; cin >> S;

    if (S == "zyxwvutsrqponmlkjihgfedcba"){
        cout << -1 << endl; return 0;
    }

    vector<char> removed;

    if ((int) S.size() < 26){
        for (char c = 'a'; c <= 'z'; ++c){
            if (S.find(c) == string::npos){
                cout << S << c << endl; return 0;
            }
        }
    }

    else {
        for (auto i = 0; i < 26; ++i) {
            removed.push_back(S[(int) S.size() - 1]);
            S.pop_back();
            sort(removed.begin(), removed.end());
            if (S[(int) S.size() - 1] < removed[0]){
                S.pop_back();
                cout << S << removed[0] << endl; return 0;
            }
        }
    }

    return 0;
}

Submission Info

Judge Result