Submission #1625955

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const long long INF = LLONG_MAX / 10;
#else
const int INF = 1010101010;
#endif
using namespace std;
typedef long long ll;
typedef vector<vector<ll>> mat;
typedef pair<int, int> P;
//typedef pair<double, double> P;

char K;
int N;
string v[55], w[55];
map<char, int> len;
map<char, string> ma;

bool dfs(char num)
{
    if (num == K + 1) {
        ma.clear();
        REP(i,N) {
            int len2 = 0;
            REP(j,v[i].length()) len2 += len[v[i][j]];
            if (len2 != w[i].length()) return false;

            int now = 0;
            REP(j,v[i].length()) {
                string tmp = w[i].substr(now, len[v[i][j]]);
                if (ma.find(v[i][j]) == ma.end()) {
                    ma[v[i][j]] = tmp;
                } else {
                    if (ma[v[i][j]] != tmp) return false;
                }
                now += len[v[i][j]];
            }
        }
        return true;
    }

    for (int i=1; i<=3; i++) {
        len[num] = i;
        if (dfs(num + 1)) return true;
    }

    return false;
}

signed main()
{
    cin >> K >> N;
    REP(i,N) cin >> v[i] >> w[i];

    dfs('1');

    for (char c='1'; c<=K; c++) {
        cout << ma[c] << endl;
    }
}

Submission Info

Judge Result