Submission #2213304

---

Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define show(x) cerr<<#x<<"="<<x<<"\n"
typedef long long ll;
template<typename T>
void print_to(std::ostream &os,const char *,const char *tail,const T &fst){
  os<<fst<<tail;
}
template<typename Fst,typename... Rst>
void print_to(std::ostream &os,const char *del,const char *tail,const Fst &fst,const Rst &... rst){
  os<<fst<<del;
  print_to(os,del,tail,rst...);
}
template<typename Iter>
void print_to_(std::ostream &os,const char *del,const char *tail,Iter bgn,Iter end){
  for(Iter it=bgn;it!=end;){
    os<<*it;
    if(++it!=end)os<<del;
    else os<<tail;
  }
}
template<typename Fst,typename... Rst>
void println(const Fst &fst,const Rst &... rst){
  print_to(std::cout,"\n","\n",fst,rst...);
}
template<typename Fst,typename... Rst>
void print(const Fst &fst,const Rst &... rst){
  print_to(std::cout," ","\n",fst,rst...);
}
template<typename Iter>
void println_(Iter bgn,Iter end){
  print_to_(std::cout," ","\n",bgn,end);
}
using namespace std;
//const ll MOD=(ll)1e9+7;
//const ll inf=(ll)1e14;
int n,k;
string v[51],w[51];
int mojisuu[10];

bool check(){
  map<char,string> mp;
  for(int i=0;i<n;i++){
    int nowmojisuu=0;
    for(int j=0;j<(int)v[i].size();j++){
      nowmojisuu+=mojisuu[v[i][j]-'0'];
    }
    if(nowmojisuu!=(int)w[i].size())return 0;
    int start=0;
    for(int j=0;j<(int)v[i].size();j++){
      if(mp.count(v[i][j])){
        string temp="";
        for(int k=0;k<(int)mp[v[i][j]].size();k++)temp+=mp[v[i][j]][k];
        string temp2=w[i].substr(start,mojisuu[v[i][j]-'0']);
        if(temp!=temp2)return 0;
        else{
          start+=mojisuu[v[i][j]-'0'];
        }
        continue;
      }
      mp[v[i][j]]=w[i].substr(start,mojisuu[v[i][j]-'0']);
      start+=mojisuu[v[i][j]-'0'];
    }
  }
  for(int i=0;i<n;i++){
    string now="";
    for(int j=0;j<(int)v[i].size();j++){
      now+=mp[v[i][j]];
    }
    if(now!=w[i])return 0;
  }
  for(int i=0;i<k;i++){
    cout<<mp[(char)(i+'1')]<<"\n";
  }
  return 1;
}

void dfs(int nownum,int nowmojisuu){
  mojisuu[nownum]=nowmojisuu;
  if(nownum==k){
    if(check())exit(0);
  }else{
    for(int i=1;i<=3;i++){
      dfs(nownum+1,i);
    }
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(10);
  cout<<fixed;
#ifdef LOCAL_DEFINE
  FILE *stream1;
  //FILE *stream2;
  stream1=freopen("in","r",stdin);
  //stream2=freopen("out","w",stdout);
  if(stream1==NULL)return 0;
  //if(stream2==NULL)return 0;
#endif
  cin>>k>>n;
  for(int i=0;i<n;i++){
    cin>>v[i]>>w[i];
  }
  for(int i=1;i<=3;i++){
    dfs(1,i);
  }
#ifdef LOCAL_DEFINE
  cerr<<"Time elapsed: "<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
  fclose(stream1);
  //fclose(stream2);
#endif
  return 0;
}

Submission Info

Judge Result