Submission #1386976
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() #define fi first #define se second template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; } template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; } typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<int, pll> pip; const ll INF = 1ll<<30; const ll MOD = 1000000007; const double EPS = 1e-8; int K, N; string v[50], w[50]; int main() { cin >> K >> N; REP(i, N) cin >> v[i] >> w[i]; REP(i, N) REP(j, v[i].size()) v[i][j] -= '1'; int ma = pow(3, K); REP(t, ma) { vector<int> l(K, 0); int nt = t; REP(i, K) l[i] = nt % 3 + 1, nt /= 3; reverse(ALL(l)); string ans[9]; bool ok = true; REP(i, N) { int p = 0; REP(j, v[i].size()) { int num = v[i][j]; if (p + l[num] > w[i].size()) ok = false; else { if (ans[num] == "") ans[num] = w[i].substr(p, l[num]); else if (ans[num] != w[i].substr(p, l[num]) ) ok = false; } p += l[num]; } if (p != w[i].size()) ok = false; } if (ok) { REP(i, K) cout << ans[i] << endl; break; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 語呂合わせ |
User | tkmst201 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1391 Byte |
Status | AC |
Exec Time | 612 ms |
Memory | 640 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 | 3 ms | 640 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 | 2 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 | 2 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 2 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 | 1 ms | 256 KB |
subtask2-01.txt | AC | 44 ms | 256 KB |
subtask2-02.txt | AC | 37 ms | 256 KB |
subtask2-03.txt | AC | 172 ms | 256 KB |
subtask2-04.txt | AC | 169 ms | 256 KB |
subtask2-05.txt | AC | 40 ms | 256 KB |
subtask2-06.txt | AC | 14 ms | 256 KB |
subtask2-07.txt | AC | 524 ms | 256 KB |
subtask2-08.txt | AC | 94 ms | 256 KB |
subtask2-09.txt | AC | 600 ms | 256 KB |
subtask2-10.txt | AC | 612 ms | 256 KB |
subtask2-11.txt | AC | 602 ms | 256 KB |
subtask2-12.txt | AC | 264 ms | 256 KB |
subtask2-13.txt | AC | 87 ms | 256 KB |
subtask2-14.txt | AC | 201 ms | 256 KB |
subtask2-15.txt | AC | 180 ms | 256 KB |
subtask2-16.txt | AC | 243 ms | 256 KB |
subtask2-17.txt | AC | 1 ms | 256 KB |
subtask2-18.txt | AC | 595 ms | 256 KB |
subtask2-19.txt | AC | 606 ms | 256 KB |
subtask2-20.txt | AC | 593 ms | 256 KB |