Submission #1799930

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
	if (n == 0)return 1;
	if (n == 1)return x%MOD;
	ll res = sq(mod_pow(x, n / 2));
	res %= MOD;
	if (n % 2 == 1) {
		res *= x;
		res %= MOD;
	}
	return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }

int k, n;
string v[1000], w[1000];
vector<string> table = { "a","b","c","aa","ab","ac" ,"ba","bb","bc" ,"ca","cb","cc",
"aaa","aab","aac" ,"aba","abb","abc" ,"aca","acb","acc",
"baa","bab","bac" ,"bba","bbb","bbc" ,"bca","bcb","bcc",
"caa","cab","cac" ,"cba","cbb","cbc" ,"cca","ccb","ccc" };

vector<vector<string>> vs;

void solve(int now, const vector<string> &vss) {
	if (now == k) {
		vs.push_back(vss);
		return;
	}
	rep(i, table.size()) {
		vector<string> res = vss;
		res.push_back(table[i]);
		solve(now + 1, res);
	}
}


int main() {
	cin >> k >> n;
	rep(i, n)cin >> v[i] >> w[i];
	vector<string> t;
	solve(0, t);
	rep(i, vs.size()) {
		rep(j, n) {
			string s;
			rep(k, v[j].size())s += vs[i][v[j][k] - '1'];
			if (s != w[j])break;
			if (j == n - 1) {
				rep(l, k) {
					cout << vs[i][l] << endl;
				}
				return 0;
			}
		}
	}

}

Submission Info

Judge Result