# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21847 | 2017-04-26T10:54:33 Z | iletavcioski | Three Friends (BOI14_friends) | C++ | 89 ms | 13144 KB |
#include<iostream> #include<vector> #include<queue> #include<string> #include<set> #include<algorithm> using namespace std; int main() { int n; cin>>n; if(n%2==0||n==1) { cout<<"NOT POSSIBLE"<<endl; return 0; } string ss; cin>>ss; int j=ss.size()/2; set<string> s; int i=0; string s1=""; string s2; while(i<ss.size()/2&&j<ss.size()) { if(ss[i]==ss[j]) { s1+=ss[i]; j++,i++; } else j++; if(s1.size()==ss.size()/2) s.insert(s1); } i=ss.size()-1; j=ss.size()/2; while(i>=0&&j>=0) { if(ss[i]==ss[j]) { s2+=ss[i]; j--,i--; } else j--; if(s2.size()==ss.size()/2) { reverse(s2.begin(),s2.end()); s.insert(s2); } } if(s.size()==1) cout<<*s.begin()<<endl; else if(s.size()==0) cout<<"NOT POSSIBLE"<<endl; else cout<<"NOT UNIQUE"<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2024 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 89 ms | 11720 KB | Output is correct |
2 | Correct | 73 ms | 10024 KB | Output is correct |
3 | Correct | 76 ms | 9904 KB | Output is correct |
4 | Correct | 89 ms | 10264 KB | Output is correct |
5 | Correct | 86 ms | 10264 KB | Output is correct |
6 | Correct | 0 ms | 2024 KB | Output is correct |
7 | Correct | 76 ms | 13144 KB | Output is correct |
8 | Correct | 66 ms | 7804 KB | Output is correct |
9 | Correct | 73 ms | 7804 KB | Output is correct |
10 | Incorrect | 66 ms | 7784 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |