Submission #1778074

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl

#define uni(x) x.erase(unique(all(x)),x.end())
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) > (b) ? (b) : (a))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;

#define INF INT_MAX/3
#define MAX_N 1000
#define M_INF 1000000000
int num[9];
int k,n;
string v[50],w[50],s[9];

void dfs(int p){
  if(p == k){
    for(int i = 0;i < k;i++) s[i] = "";
    for(int i = 0;i < n;i++){
      int tmp = 0;
      for(char c : v[i]){
        int kk = c - '1';
        if(tmp + num[kk] > w[i].length()) return;
        if(s[kk] == "") s[kk] = w[i].substr(tmp,num[kk]);
        else if(s[kk] != w[i].substr(tmp,num[kk])) return;
        tmp += num[kk];
      }
      if(tmp != w[i].length()) return;
    }
    for(int i = 0;i < k;i++) cout << s[i] << endl;
    exit(0);
  }
  for(int i = 1;i <= 3;i++){
    num[p] = i;
    dfs(p + 1);
  }
}

int main(){
  cin >> k >> n;
  for(int i = 0;i < n;i++) cin >> v[i] >> w[i];
  dfs(0);
  return 0;
}

Submission Info

Judge Result