Submission #2849475
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long int; const int MAX_N = (int)(50 + 5); const int MAX_K = (int)(9 + 5); int k, n; string v[MAX_N]; string w[MAX_N]; int length[MAX_K]; bool done = false; string ans[MAX_K]; bool check() { for (int i = 0; i < n; ++i) { int acclength = 0; for (int j = 0; j < v[i].size(); ++j) { acclength += length[(int)(v[i][j] - 48)]; } if (acclength != w[i].size()) return false; else { int pos[27 + 5]; pos[0] = 0; for (int j = 1; j < v[i].size(); ++j) { pos[j] = pos[j - 1] + length[(int)(v[i][j - 1] - 48)]; } for (int j = 0; j < v[i].size(); ++j) { ans[(int)(v[i][j] - 48)] = w[i].substr(pos[j], length[(int)(v[i][j] - 48)]); } } } return true; } void dfs(int cur) { if (done) return; if (cur == k + 1) { if (check()) { done = true; return; } } else { for (int i = 1; i <= 3; ++i) { length[cur] = i; dfs(cur + 1); } } } int main(void) { // Here your code ! scanf("%d %d", &k, &n); for (int i = 0; i < n; ++i) { cin >> v[i]; cin >> w[i]; } dfs(1); for (int i = 1; i <= k; ++i) { cout << ans[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 語呂合わせ |
User | david |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1322 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:59:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &k, &n); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 60 / 60 | ||||||
Status |
|
|
|
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 | 1 ms | 256 KB |
subtask2-03.txt | AC | 2 ms | 256 KB |
subtask2-04.txt | AC | 2 ms | 256 KB |
subtask2-05.txt | AC | 1 ms | 256 KB |
subtask2-06.txt | AC | 1 ms | 256 KB |
subtask2-07.txt | AC | 2 ms | 256 KB |
subtask2-08.txt | AC | 2 ms | 256 KB |
subtask2-09.txt | AC | 2 ms | 256 KB |
subtask2-10.txt | AC | 2 ms | 256 KB |
subtask2-11.txt | AC | 2 ms | 256 KB |
subtask2-12.txt | AC | 2 ms | 256 KB |
subtask2-13.txt | AC | 2 ms | 256 KB |
subtask2-14.txt | AC | 2 ms | 256 KB |
subtask2-15.txt | AC | 2 ms | 256 KB |
subtask2-16.txt | AC | 2 ms | 256 KB |
subtask2-17.txt | AC | 1 ms | 256 KB |
subtask2-18.txt | AC | 2 ms | 256 KB |
subtask2-19.txt | AC | 2 ms | 256 KB |
subtask2-20.txt | AC | 2 ms | 256 KB |