Submission #576375

---

Source Code Expand

import java.util.ArrayDeque;
import java.util.Queue;
import java.util.Scanner;


public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int k = sc.nextInt();
		int n = sc.nextInt();
		char[][] v = new char[n][];
		String[] w = new String[n];
		for (int i = 0; i < n; i++) {
			v[i] = sc.next().toCharArray();
			w[i] = sc.next();
		}

		if (k > 3) {
			for (int i = 0; i < k; i++) {
				System.out.println("0");
			}

			sc.close();
			return;
		}

		String[] s = {"a", "aa", "aaa", "b", "bb", "bbb", "c", "cc", "ccc"};

		Queue<Integer> qk = new ArrayDeque<Integer>();
		Queue<Queue<Integer>> qs = new ArrayDeque<Queue<Integer>>();
		qk.add(0);
		while (!qk.isEmpty()) {
			int e = qk.remove();

			if (e == k) {
				boolean flag = true;
				Queue<Integer> qtmp = qs.remove();
				Integer[] itmp = new Integer[0];
				itmp = qtmp.toArray(itmp);
				for (int i = 0; i < n; i++) {
					String tmp = "";
					for (int j = 0; j < v[i].length; j++) {
						tmp += s[itmp[v[i][j] - '1']];
					}
					if (!tmp.equals(w[i])) {
						flag = false;
						break;
					}
				}
				if (flag) {
					for (int ee : itmp) {
						System.out.println(s[ee]);
					}

					sc.close();
					return;
				}
			} else {
				Queue<Integer> tmp;
				if (e == 0) {
					tmp = new ArrayDeque<Integer>();
				} else {
					tmp = qs.remove();
				}
				for (int i = 0; i < s.length; i++) {
					Queue<Integer> ttmp = new ArrayDeque<Integer>(tmp);
					ttmp.add(i);
					qs.add(ttmp);
					qk.add(e + 1);
				}
			}
		}

		sc.close();
	}
}

Submission Info

Judge Result