Submission #1516346

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;
using llng = long long;
template<typename T> using v = vector<T>;
template<typename T> using vv = v<v<T> >;

int K, N;
v<string> V, W;

bool check(v<int> &s) {
    for (int i=0; i<N; i++) {
        int len = 0; for (char c : V[i]) len += s[c-'0'];
        if (len != W[i].length()) return false;
    }
    v<string> goro(K+1);
    for (int i=0; i<N; i++) {
        string str;
        int l = 0;
        for (char c : V[i]) {
            str = W[i].substr(l, s[c-'0']);
            if (goro[c-'0'] == "") goro[c-'0'] = str;
            if (str != goro[c-'0']) return false;
            l += s[c-'0'];
        }
    }
    for (int i=1; i<=K; i++) cout << goro[i] << endl;
    return true;
}

void dfs(v<int> &s, int t) {
    static bool flg = false;
    if (flg) return;
    if (t > K) flg = check(s);
    else for (int i=1; i<=3; i++) { s[t] = i; dfs(s, t+1); }
}

int main() {
    cin >> K >> N;
    V = v<string>(N); W = v<string>(N);
    for (int i=0; i<N; i++) cin >> V[i] >> W[i];

    v<int> s(K+1); dfs(s, 1);
    return 0;
}

Submission Info

Judge Result