Submission #1799070


Source Code Expand

#include<iostream>
#include<string>

using namespace std;

int K, N;
string v[50], w[50];
int nagasa[9] = { 1,1,1,1,1,1,1,1,1 };
string ans[9];
//iこめの数字に当てはまるごろの長さ

bool isok() {

	for (int i = 0; i < K; i++)ans[i] = "NODATA";

	//長さとして合致してるかどうか
	for (int i = 0; i < N; i++) {
		int length = 0;
		for (int j = 0; j < v[i].size(); j++) {
			length += nagasa[v[i][j] - '1'];
		}
		if (length != w[i].size())return false;
	}
	//中身が合致してるかどうか
	for (int i = 0; i < N; i++) {
		int cnt = 0;
		for (int j = 0; j < v[i].size(); j++) {
			if (ans[v[i][j] - '1'] == "NODATA") {
				ans[v[i][j] - '1'] = w[i].substr(cnt, nagasa[v[i][j] - '1']);
			}
			else {
				if (ans[v[i][j] - '1'] != w[i].substr(cnt, nagasa[v[i][j] - '1'])) {
					return false;
				}
			}
			cnt += nagasa[v[i][j] - '1'];
		}
	}
	return true;
}

bool dfs(int n) {
	if (n == K + 1) return false;
	if (isok()) {
		return true;
	}
	if (dfs(n + 1))return true;
	nagasa[n]++;
	if (dfs(n + 1))return true;
	nagasa[n]++;
	if (dfs(n + 1))return true;
	nagasa[n] -= 2;
	return false;
}

int main() {
	cin >> K >> N;
	for (int i = 0; i < N; i++)cin >> v[i] >> w[i];

	dfs(0);

	for (int i = 0; i < K; i++) {
		cout << ans[i] << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task D - 語呂合わせ
User Sen
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1352 Byte
Status AC
Exec Time 6 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 40 / 40 60 / 60
Status
AC × 4
AC × 23
AC × 44
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1 sample-02.txt, sample-03.txt, sample-04.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt
Subtask2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt
Case Name Status Exec Time Memory
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB
sample-04.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB
subtask1-16.txt AC 1 ms 256 KB
subtask1-17.txt AC 1 ms 256 KB
subtask1-18.txt AC 1 ms 256 KB
subtask1-19.txt AC 1 ms 256 KB
subtask1-20.txt AC 1 ms 256 KB
subtask2-01.txt AC 2 ms 256 KB
subtask2-02.txt AC 2 ms 256 KB
subtask2-03.txt AC 4 ms 256 KB
subtask2-04.txt AC 4 ms 256 KB
subtask2-05.txt AC 2 ms 256 KB
subtask2-06.txt AC 1 ms 256 KB
subtask2-07.txt AC 6 ms 256 KB
subtask2-08.txt AC 3 ms 256 KB
subtask2-09.txt AC 6 ms 256 KB
subtask2-10.txt AC 6 ms 256 KB
subtask2-11.txt AC 6 ms 256 KB
subtask2-12.txt AC 5 ms 256 KB
subtask2-13.txt AC 2 ms 256 KB
subtask2-14.txt AC 6 ms 256 KB
subtask2-15.txt AC 4 ms 256 KB
subtask2-16.txt AC 5 ms 256 KB
subtask2-17.txt AC 1 ms 256 KB
subtask2-18.txt AC 6 ms 256 KB
subtask2-19.txt AC 6 ms 256 KB
subtask2-20.txt AC 6 ms 256 KB