# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625620 | 2022-08-10T16:05:28 Z | kkkkkkkk | Three Friends (BOI14_friends) | C++14 | 82 ms | 6272 KB |
#include <iostream> using namespace std; int main() { int n; string s; cin >> n >> s; if (n%2==0) { cout << "NOT POSSIBLE" << endl; return 0; } int cnt=0,poz=-1; bool ok=true,moze=true; for (int i=0,j=n/2+1;j<n,i<=n/2;) { if (s[i]==s[j]) i++,j++; else if (s[i]!=s[j]&&ok==true) poz=i,i++,ok=false; else { moze=false; break; } } if (moze) cnt++; ok=true,moze=true; for (int i=0,j=n/2;j<n,i<n/2;) { if (s[i]==s[j]) i++,j++; else if (s[i]!=s[j]&&ok==true) { if (poz==-1) poz=j; j++,ok=false; } else { moze=false; break; } } if (moze) cnt++; if (cnt==0) cout << "NOT POSSIBLE" << endl; if (cnt==1) { //cout << poz << endl; if (poz>=n/2) { for (int i=0;i<n/2;i++) cout << s[i]; } else { for (int i=n/2+1;i<n;i++) cout << s[i]; } } else cout << "NOT UNIQUE" << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 304 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 74 ms | 6272 KB | Output is correct |
2 | Correct | 72 ms | 6200 KB | Output is correct |
3 | Correct | 70 ms | 6248 KB | Output is correct |
4 | Correct | 71 ms | 6192 KB | Output is correct |
5 | Correct | 82 ms | 6132 KB | Output is correct |
6 | Correct | 46 ms | 6116 KB | Output is correct |
7 | Incorrect | 43 ms | 6188 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |