Submission #1652923
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> #include <cstring> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; vector<string> v, w; int K, N; int a[10]; string t[10]; bool dfs(int dep) { if(dep == K) { FOR(i,0,K) t[i] = ""; FOR(i,0,N) { int p = 0; // ゴロを作って行く FOR(j,0,v[i].length()) { string y = ""; int ind = (v[i][j] - '0') - 1; FOR(k,0,a[ind]) { if(p < w[i].length()) { y += w[i][p]; p++; } } if(y.length() != a[ind]) return false; if(t[ind] == "") t[ind] = y; else if(t[ind] != y) return false; } if(p != w[i].length()) return false; } FOR(i,0,K) cout << t[i] << endl; return true; } FOR(i,1,4) { a[dep] = i; if(dfs(dep + 1)) return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> K >> N; FOR(i,0,N) { string a, b; cin >> a >> b; v.push_back(a); w.push_back(b); } dfs(0); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 語呂合わせ |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1397 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 384 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 | 2 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 | 2 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 | 2 ms | 256 KB |
subtask1-11.txt | AC | 2 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 | 2 ms | 256 KB |
subtask1-17.txt | AC | 1 ms | 256 KB |
subtask1-18.txt | AC | 1 ms | 256 KB |
subtask1-19.txt | AC | 2 ms | 256 KB |
subtask1-20.txt | AC | 2 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 | 10 ms | 256 KB |
subtask2-05.txt | AC | 3 ms | 256 KB |
subtask2-06.txt | AC | 2 ms | 256 KB |
subtask2-07.txt | AC | 20 ms | 384 KB |
subtask2-08.txt | AC | 5 ms | 256 KB |
subtask2-09.txt | AC | 21 ms | 256 KB |
subtask2-10.txt | AC | 17 ms | 256 KB |
subtask2-11.txt | AC | 16 ms | 256 KB |
subtask2-12.txt | AC | 9 ms | 256 KB |
subtask2-13.txt | AC | 4 ms | 256 KB |
subtask2-14.txt | AC | 12 ms | 256 KB |
subtask2-15.txt | AC | 6 ms | 256 KB |
subtask2-16.txt | AC | 14 ms | 256 KB |
subtask2-17.txt | AC | 2 ms | 256 KB |
subtask2-18.txt | AC | 16 ms | 256 KB |
subtask2-19.txt | AC | 14 ms | 256 KB |
subtask2-20.txt | AC | 14 ms | 256 KB |