Submission #577083

---

Source Code Expand

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
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"};
		String[] s = {"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",
		};

		Queue<List<Integer>> qs = new ArrayDeque<List<Integer>>();
		qs.add(new ArrayList<Integer>());
		while (!qs.isEmpty()) {
			List<Integer> e = qs.remove();

			if (e.size() == k) {
				boolean flag = true;
				for (int i = 0; i < n; i++) {
					String tmp = "";
					for (int j = 0; j < v[i].length; j++) {
						tmp += s[e.get(v[i][j] - '1')];
					}
					if (!tmp.equals(w[i])) {
						flag = false;
						break;
					}
				}
				if (flag) {
					for (int ee : e) {
						System.out.println(s[ee]);
					}

					sc.close();
					return;
				}
			} else {
				for (int i = 0; i < s.length; i++) {
					List<Integer> ltmp = new ArrayList<Integer>(e);
					ltmp.add(i);
					qs.add(ltmp);
				}
			}
		}

		sc.close();
	}
}

Submission Info

Judge Result