Submission #2386045

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int K, N; cin >> K >> N;
	vector<string> v(N), w(N);
	rep (i, N){
		cin >> v[i] >> w[i];
	} // end rep

	map<int,string> ans;
	for (int i = 0; i < pow(3,K); ++i){
		vector<int> sn(K + 1, 0);
		int d = i;
		rep (j, K){
			if (d % 3 == 0){
				sn[j+1] = 1;
			}else
			if (d % 3 == 1){
				sn[j+1] = 2;
			}else{ // if (d % 3 == 2)
				sn[j+1] = 3;
			} // end if
			d /= 3;
		} // end rep

		bool match = true;
		rep (j, N){
			int curr = 0;
			rep (k, (int)v[j].length()){
				curr += sn[(int)(v[j][k] - '0')];
			} // end rep
			if (curr != w[j].length()){
				match = false;
				break;
			} // end if
		} // end rep
		if (!match) continue;
		ans.clear();
		rep (j, N){
			int len = 0;
			rep (k, (int)v[j].length()){
				int curr = (int)(v[j][k] - '0');
				string cand = w[j].substr(len, sn[(int)(v[j][k] - '0')]);
				len += sn[(int)(v[j][k] - '0')];
				if (!ans.count(curr)){
					ans[curr] = cand;
				}else{
					if (ans[curr] != cand){
						match = false;
						break;
					} // end if
				} // end if
			} // end rep
			if (!match) break;
		} // end rep

		if (!match) continue;
		break;
	} // end while

	map<int,string>::iterator it = ans.begin();
	for (; it != ans.end(); ++it){
		int i = (*it).first;
		string s = (*it).second;
		cout << s << endl;
//		cerr << i << ":" << s << endl;
	} // end for
	
	return 0;
}

Submission Info

Judge Result