Submission #2165709
Source Code Expand
#include <bits/stdc++.h> #define pq priority_queue #define P pair<int, int> #define P2 pair<int, P> #define P3 pair<int, P2> typedef long long ll; typedef long double ld; using namespace std; const int INF = 1e9, MOD = 1e9+7, around[] = {0, 1, 1, -1, -1, 0, -1, 1, 0, 0}; const int vx[] = {1, 0, -1, 0}, vy[] = {0, 1, 0, -1}; const ld PI = abs(acos(-1)); const int sqrtN = 512; const int logN = 32; const ll LINF=1e18; int k, n; string s[55], w[55]; vector<string> vec[10]; bool check(int li[10]){ vector<string> pos(10); for(int i = 0; i < n; i++){ int c = 0; for(int j = 0; j < s[i].size(); j++){ if(c + li[s[i][j] - '1'] > w[i].size()) return false; if(pos[s[i][j] - '1'] != "" and pos[s[i][j] - '1'] != w[i].substr(c, li[s[i][j] - '1'])) return false; else pos[s[i][j] - '1'] = w[i].substr(c, li[s[i][j] - '1']); c += li[s[i][j] - '1']; } if(c != w[i].size()) return false; } for(int i = 0; i < k; i++) cout << pos[i] << endl; return true; } int main(){ cin >> k >> n; for(int i = 0; i < n; i++) cin >> s[i] >> w[i]; int li[15]; for(int i = 0; i < (int)pow(3, k); i++){ int pos = i; for(int j = 0; j < k; j++){ li[j] = pos % 3 + 1; pos /= 3; } if(check(li)) return 0; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 語呂合わせ |
User | ecasdqina |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1311 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 256 KB |
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 | 4 ms | 256 KB |
subtask2-02.txt | AC | 3 ms | 256 KB |
subtask2-03.txt | AC | 6 ms | 256 KB |
subtask2-04.txt | AC | 9 ms | 256 KB |
subtask2-05.txt | AC | 8 ms | 256 KB |
subtask2-06.txt | AC | 4 ms | 256 KB |
subtask2-07.txt | AC | 13 ms | 256 KB |
subtask2-08.txt | AC | 2 ms | 256 KB |
subtask2-09.txt | AC | 13 ms | 256 KB |
subtask2-10.txt | AC | 11 ms | 256 KB |
subtask2-11.txt | AC | 10 ms | 256 KB |
subtask2-12.txt | AC | 5 ms | 256 KB |
subtask2-13.txt | AC | 8 ms | 256 KB |
subtask2-14.txt | AC | 8 ms | 256 KB |
subtask2-15.txt | AC | 6 ms | 256 KB |
subtask2-16.txt | AC | 3 ms | 256 KB |
subtask2-17.txt | AC | 1 ms | 256 KB |
subtask2-18.txt | AC | 10 ms | 256 KB |
subtask2-19.txt | AC | 9 ms | 256 KB |
subtask2-20.txt | AC | 9 ms | 256 KB |