Submission #3788193
Source Code Expand
#include<cstdio> #include<cstring> #include<vector> #include<queue> #include<algorithm> #include<cmath> #include<climits> #include<string> #include<set> #include<numeric> #include<map> #include<iostream> using namespace std; #define rep(i,n) for(int i = 0;i<((int)(n));i++) #define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++) #define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--) #define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--) typedef long long ll; typedef pair<ll, ll> mp; /* AC FSすると間に合う */ ll k,n,ok=0; string v[60],w[60],ans[10]; void f(string s){ if(ok!=0)return; if(s.size()==k){ //チェック bool can=true; ll visit[10]={},m[10]; // cout<<"=="<<endl; reg(i,1,k){ m[i]=s[i-1]-'0'; // rep(j,m[i])cout<<i; // cout<<endl; } reg(i,1,k)ans[i]=""; rep(i,n){ ll cnt=0; rep(j,v[i].size()){ ll p=v[i][j]-'0'; if(visit[p]==0){ visit[p]=1; if(w[i].size()-cnt>=m[p]){ rep(l,m[p])ans[p]+=w[i][cnt+l]; cnt+=m[p]; }else{ can=false; break; } }else{ if(w[i].size()-cnt>=m[p]){ rep(l,m[p])if(ans[p][l]!=w[i][cnt+l])can=false; cnt+=m[p]; }else{ can=false; break; } } } if(cnt!=w[i].size())can=false; } if(can)ok=1; }else{ reg(i,1,3){ f(s+to_string(i)); } } } int main(void){ cin>>k>>n; rep(i,n)cin>>v[i]>>w[i]; f(""); reg(i,1,k)cout<<ans[i]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 語呂合わせ |
User | RMQ |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1525 Byte |
Status | AC |
Exec Time | 136 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 | 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 | 1 ms | 256 KB |
subtask1-20.txt | AC | 1 ms | 256 KB |
subtask2-01.txt | AC | 12 ms | 256 KB |
subtask2-02.txt | AC | 9 ms | 256 KB |
subtask2-03.txt | AC | 43 ms | 256 KB |
subtask2-04.txt | AC | 41 ms | 256 KB |
subtask2-05.txt | AC | 10 ms | 256 KB |
subtask2-06.txt | AC | 4 ms | 256 KB |
subtask2-07.txt | AC | 121 ms | 256 KB |
subtask2-08.txt | AC | 24 ms | 256 KB |
subtask2-09.txt | AC | 133 ms | 256 KB |
subtask2-10.txt | AC | 136 ms | 256 KB |
subtask2-11.txt | AC | 134 ms | 256 KB |
subtask2-12.txt | AC | 60 ms | 256 KB |
subtask2-13.txt | AC | 22 ms | 256 KB |
subtask2-14.txt | AC | 50 ms | 256 KB |
subtask2-15.txt | AC | 45 ms | 256 KB |
subtask2-16.txt | AC | 61 ms | 256 KB |
subtask2-17.txt | AC | 1 ms | 256 KB |
subtask2-18.txt | AC | 134 ms | 256 KB |
subtask2-19.txt | AC | 133 ms | 256 KB |
subtask2-20.txt | AC | 135 ms | 256 KB |