Submission #2206505

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;

string v[51],w[51];
int K,N;
bool c=false;

void dfs(int k,vector<int> s){
    if(c) return;
    if(k==K){
        for(int i=0;i<N;i++){
            int sum=0;
            for(int j=0;j<v[i].size();j++){
                sum+=s[v[i][j]-'0'-1];
            }
            if(sum!=w[i].size()) return;
        }
        string ans[K];
        for(int i=0;i<K;i++){
            ans[i]="";
        }
        for(int i=0;i<N;i++){
            int l=0;
            for(int j=0;j<v[i].size();j++){
                if(ans[v[i][j]-'0'-1]=="") ans[v[i][j]-'0'-1]=w[i].substr(l,s[v[i][j]-'0'-1]);
                else{
                    if(ans[v[i][j]-'0'-1]!=w[i].substr(l,s[v[i][j]-'0'-1])) return;
                }
                l+=s[v[i][j]-'0'-1];
            }
        }
        for(int i=0;i<K;i++){
            cout << ans[i] << endl;
        }
        c=true;
        return;
    }
    for(int i=1;i<=3;i++){
        s[k]=i;
        dfs(k+1,s);
    }
}



int main(){
    cin >> K >> N;
    for(int i=0;i<N;i++){
        cin >> v[i] >> w[i];
    }
    vector<int> s(10,0);
    dfs(0,s);
    return 0;
}

Submission Info

Judge Result