Submission #372685

---

Source Code Expand

#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<functional>
#include<utility>
#include<iterator>
#include<algorithm>
#include<sstream>
#include<fstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<cstring>
#include<iomanip>
using namespace std;
#define len(val) static_cast<int>(val.size())
#define rep(i, n) for(int i=0; i<(n); i++)
typedef long long ll;
typedef pair<int, int> P;


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    map<string, int> mp;
    for(int i=0; i<T; i++){
        string s;
        cin >> s;
        if(mp.find(s) != mp.end()){
            cout << mp[s] << endl;
            continue;
        }
        vector<int> digits;
        for(int j=0; j<len(s)-1; j++){
            string t = s;
            char tmp = t[j];
            t[j] = t[j+1];
            t[j+1] = tmp;
            if(mp.find(t) != mp.end()){
                digits.push_back(mp[t]);
            }
        }
        int index = 0;
        if(len(digits)){
            for(int j=0; j<10; j++){
                if(find(digits.begin(), digits.end(), j) == digits.end()){
                    index = j;
                    break;
                }
            }
        }
        cout << index << endl;
        mp[s] = index;
    }
}

Submission Info

Judge Result