Submission #576465

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<iterator>
#include<stack>
#include<utility>

#define rep(i,n) for(int i = 0; i != n; i++)

using namespace std;



int main(){
	int N,K;
	cin >> K >> N;
	vector<string> res(K, "FAIL");
	vector<string> a;
	vector<string> b;

	rep(i,N){
		string temp1,temp2;
		cin >> temp1 >> temp2;
		a.push_back(temp1);
		b.push_back(temp2);
	}
	long i = 0;
	rep(i, pow(3, K)){
		vector<string> nowres(K, "FAIL");
		vector<int> keta(K, 0);
		long wari = i;
		rep(j,K){
			keta[j] = wari % 3 + 1;
			wari /= 3;
		}
		int check = 0;
		rep(j,N){
			int k = 0;
			bool flag = 0;
			rep(iter, a[j].length()){
				if(k >= b[j].length()){
					flag = 1;
					break;
				}
				int now = a[j][iter] - '0' - 1;
				if(nowres[now].compare( "FAIL") == 0){
					string temp;
					rep(l, keta[now]){
						if(k < b[j].length()){
						temp.push_back(b[j][k]);
						k++;	
						}
					}
					if(temp.length() != keta[now]){flag = 1; break;}
					nowres[now] = temp;
				}
				else{
					bool flag_ = 0;
					rep(l, keta[now]){
						if(b[j][k] - nowres[now][l] != 0) flag_ = 1;
						k++;
					}
					if(flag_){flag = 1; break;}
				}
			}
			if(flag || k != b[j].length()){ check = 1; break;}
		}
		if(check == 0){
		res = nowres;
		break;
		}
	}
	rep(i,K){
	cout << res[i] << endl;
	}
}

Submission Info

Judge Result