Submission #2853866

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
const ll mod2=1e9+9 ;
int dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;

vector<string> s,t;

bool solve(vector<int> v,vector<string>& ans,int n){
    if(n==s.size()){
        rep(i,ans.size())cout<<ans[i]<<endl;
        return true;
    }
    int k=s[n].size();
    int cnt=0;
    rep(i,t[n].size())cnt+=v[t[n][i]-'1'];
    if(k!=cnt)return false;
    cnt=0;
    rep(i,t[n].size()){
        int pos=t[n][i]-'1';
        string res=s[n].substr(cnt,v[pos]);
        if(ans[pos]=="")ans[pos]=res;
        if(res!=ans[pos])return false;
        cnt+=v[pos];
    }
    return solve(v,ans,n+1);
}

int main(){
    int k,n;
    cin>>k>>n;
    s.resize(n);
    t.resize(n);
    rep(i,n){
        cin>>t[i]>>s[i];
    }
    int m=0;
    while(1){
        vector<int> v;
        int pos=m;
        rep(i,k){
            v.push_back((pos%3)+1);
            pos/=3;
        }
        vector<string> ans(k,"");
        if(solve(v,ans,0)){
            break;
        }
        m++;
    }
   return 0;
}

Submission Info

Judge Result