Submission #3788193

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;

/*
AC
FSすると間に合う
*/

ll k,n,ok=0;
string v[60],w[60],ans[10];

void f(string s){
	if(ok!=0)return;
	if(s.size()==k){
		//チェック
		bool can=true;
		ll visit[10]={},m[10];
		// cout<<"=="<<endl;
		reg(i,1,k){
			m[i]=s[i-1]-'0';
			// rep(j,m[i])cout<<i;
			// cout<<endl;
		}
		reg(i,1,k)ans[i]="";
		rep(i,n){
			ll cnt=0;
			rep(j,v[i].size()){
				ll p=v[i][j]-'0';
				if(visit[p]==0){
					visit[p]=1;
					if(w[i].size()-cnt>=m[p]){
						rep(l,m[p])ans[p]+=w[i][cnt+l];
						cnt+=m[p];
					}else{
						can=false;
						break;
					}
				}else{
					if(w[i].size()-cnt>=m[p]){
						rep(l,m[p])if(ans[p][l]!=w[i][cnt+l])can=false;
						cnt+=m[p];
					}else{
						can=false;
						break;
					}
				}
			}
			if(cnt!=w[i].size())can=false;
		}
		if(can)ok=1;
	}else{
		reg(i,1,3){
			f(s+to_string(i));
		}
	}
}

int main(void){
	cin>>k>>n;
	rep(i,n)cin>>v[i]>>w[i];
	f("");
	reg(i,1,k)cout<<ans[i]<<endl;
	return 0;
}

Submission Info

Judge Result