Submission #1386981

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pll> pip;
const ll INF = 1ll<<30;
const ll MOD = 1000000007;
const double EPS  = 1e-8;

int K, N;
string v[50], w[50];

int main() {
	cin >> K >> N;
	REP(i, N) cin >> v[i] >> w[i];
	REP(i, N) REP(j, v[i].size()) v[i][j] -= '1';
	
	int ma = pow(3, K);
	REP(t, ma) {
		vector<int> l(K, 0);
		int nt = t;
		REP(i, K) l[i] = nt % 3 + 1, nt /= 3;
		reverse(ALL(l));
		
		string ans[9];
		bool ok = true;
		
		REP(i, N) if (ok) {
			int p = 0;
			
			REP(j, v[i].size()) if (ok) {
				int num = v[i][j];
				
				if (p + l[num] > w[i].size()) ok = false;
				else {
					
					if (ans[num] == "") ans[num] = w[i].substr(p, l[num]);
					else if (ans[num] != w[i].substr(p, l[num]) ) ok = false;
				}
				p += l[num];
			}
			
			if (p != w[i].size()) ok = false;
		}
		
		if (ok) {
			REP(i, K) cout << ans[i] << endl;
			break;
		}
	}
	
	return 0;
}

Submission Info

Judge Result