# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28504 | 2017-07-16T06:47:16 Z | 흐훗흐흐훗핫(#1176, dtc03012, iriszero) | Play Onwards (FXCUP2_onward) | C++11 | 0 ms | 2032 KB |
#include <iostream> #include <string> using namespace std; string tmp[333]; int dp[333]; int main(void) { int n,m; cin >> n >> m; for(int e=0;e<n;e++) cin >> tmp[e]; for(int e=0;e<n;e++) { if(dp[e]==0) { dp[e]=1; } for(int p=e+1;p<n;p++) { int mm=0,qq=0,rr=0; for(int q=0;q<tmp[e].size();q++) { for(int r=0;r<tmp[p].size();r++) { if(tmp[e][q]==tmp[p][r]) { rr=0; qq=0; for(int ee=r;ee<tmp[p].size();ee++) { if(tmp[e][q+qq]==tmp[p][ee]) { rr++; mm=max(mm,rr); } else { break; } qq++; } } } } if(mm>=m) { if(dp[e]==1) { if(dp[p]==1) { cout << "NO"; return 0; } else { dp[p]=2; } } if(dp[e]==2) { if(dp[p]==2) { cout << "NO"; return 0; } else { dp[p]=1; } } } else { if(dp[e]==1) { if(dp[p]==2) { cout << "NO"; return 0; } else { dp[p]=1; } } if(dp[e]==2) { if(dp[p]==1) { cout << "NO"; return 0; } else { dp[p]=2; } } } } } for(int e=0;e<n;e++) cout << dp[e] << "\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2032 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |