Submission #2197062
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<ll> Vec;
typedef vector<Vec> DVec;
typedef priority_queue<P, vector<P>, greater<P>> PQ;
#define fi first
#define se second
#define pb push_back
#define INF LLONG_MAX/3
#define MOD 1000000007
#define bcnt __builtin_popcount
#define all(x) (x).begin(),(x).end()
#define uni(x) x.erase(unique(all(x)),x.end())
#define ub(x,y) (upper_bound(all(x),y)-x.begin())
#define lb(x,y) (lower_bound(all(x),y)-x.begin())
#define ssort(x) sort(all(x))
#define rep(i,n) repl(i,0,n-1)
#define mkp(x,y) make_pair(x,y)
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define exist(x,y) (find(all(x),y)!=x.end())
#define each(itr,v) for(auto itr:v)
#define repl(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
#define dvec(n1,n2,i) DVec(n1,Vec(n2,i))
ll K, N;
vector<string> v(50), w(50), ans(9);
Vec len{1,1,1,1,1,1,1,1,1};
bool isok(){
rep(i,K)ans[i] = "NODATA";
rep(i,N){
ll length = 0;
rep(j,v[i].size())length += len[v[i][j] - '1'];
if(length != w[i].size())return false;
}
rep(i,N){
ll cnt = 0;
rep(j,v[i].size()){
if(ans[v[i][j] - '1'] == "NODATA")ans[v[i][j] - '1'] = w[i].substr(cnt,len[v[i][j] - '1']);
else if(ans[v[i][j] - '1'] != w[i].substr(cnt, len[v[i][j] - '1']))return false;
cnt += len[v[i][j] - '1'];
}
}
return true;
}
bool dfs(ll n){
if(n == K + 1)return false;
if(isok())return true;
if(dfs(n+1))return true;
len[n]++;
if(dfs(n+1))return true;
len[n] -= 2;
return false;
}
int main(){
cin.sync_with_stdio(false);
cin >> K >> N;
rep(i,N)cin >> v[i] >> w[i];
dfs(0);
rep(i,K)cout << ans[i] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - 語呂合わせ |
User |
hayabusa104 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2017 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
0 / 40 |
0 / 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 |
WA |
1 ms |
256 KB |
sample-02.txt |
WA |
1 ms |
256 KB |
sample-03.txt |
WA |
1 ms |
256 KB |
sample-04.txt |
WA |
1 ms |
256 KB |
subtask1-01.txt |
WA |
1 ms |
256 KB |
subtask1-02.txt |
WA |
1 ms |
256 KB |
subtask1-03.txt |
WA |
1 ms |
256 KB |
subtask1-04.txt |
WA |
1 ms |
256 KB |
subtask1-05.txt |
AC |
1 ms |
256 KB |
subtask1-06.txt |
WA |
1 ms |
256 KB |
subtask1-07.txt |
WA |
1 ms |
256 KB |
subtask1-08.txt |
AC |
1 ms |
256 KB |
subtask1-09.txt |
AC |
1 ms |
256 KB |
subtask1-10.txt |
WA |
1 ms |
256 KB |
subtask1-11.txt |
WA |
1 ms |
256 KB |
subtask1-12.txt |
WA |
1 ms |
256 KB |
subtask1-13.txt |
WA |
1 ms |
256 KB |
subtask1-14.txt |
WA |
1 ms |
256 KB |
subtask1-15.txt |
WA |
1 ms |
256 KB |
subtask1-16.txt |
WA |
1 ms |
256 KB |
subtask1-17.txt |
AC |
1 ms |
256 KB |
subtask1-18.txt |
WA |
1 ms |
256 KB |
subtask1-19.txt |
WA |
1 ms |
256 KB |
subtask1-20.txt |
AC |
1 ms |
256 KB |
subtask2-01.txt |
WA |
1 ms |
256 KB |
subtask2-02.txt |
WA |
1 ms |
256 KB |
subtask2-03.txt |
WA |
1 ms |
256 KB |
subtask2-04.txt |
WA |
1 ms |
256 KB |
subtask2-05.txt |
WA |
1 ms |
256 KB |
subtask2-06.txt |
WA |
1 ms |
256 KB |
subtask2-07.txt |
WA |
1 ms |
256 KB |
subtask2-08.txt |
WA |
1 ms |
256 KB |
subtask2-09.txt |
WA |
1 ms |
256 KB |
subtask2-10.txt |
WA |
1 ms |
256 KB |
subtask2-11.txt |
WA |
1 ms |
256 KB |
subtask2-12.txt |
WA |
1 ms |
256 KB |
subtask2-13.txt |
WA |
1 ms |
256 KB |
subtask2-14.txt |
WA |
1 ms |
256 KB |
subtask2-15.txt |
WA |
1 ms |
256 KB |
subtask2-16.txt |
WA |
1 ms |
256 KB |
subtask2-17.txt |
AC |
1 ms |
256 KB |
subtask2-18.txt |
WA |
1 ms |
256 KB |
subtask2-19.txt |
WA |
1 ms |
256 KB |
subtask2-20.txt |
WA |
1 ms |
256 KB |