# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105596 | 2019-04-13T18:00:33 Z | Leonardo_Paes | Three Friends (BOI14_friends) | C++11 | 500 ms | 6380 KB |
#include <bits/stdc++.h> using namespace std; int mark[27]; int main(){ map<string, int> m; int n; cin >> n; string t; cin >> t; for(int i=0; i<n; i++){ mark[t[i]-'A']++; } if(n%2==0){ cout << "NOT POSSIBLE" << endl; return 0; } int x=-1; bool resp=true; for(int i=0; i<=26; i++){ if(mark[i]%2==1){ if(x!=-1)resp=false; x=i; } } if(resp==false){ cout << "NOT POSSIBLE" << endl; return 0; } string y="-1"; string p; int w=0; for(int i=0; i<n; i++){ if(t[i]-'A'==x){ int u=0; string h; for(int j=0; j<n; j++){ if(i!=j){ h+=t[j]; u++; } if(u==(n-1)/2){ u=j; break; } } string q; for(int e=u+1; e<n; e++){ if(e!=i)q+=t[e]; } if(q==h and m.find(q)==m.end()){ if(y!="-1" and y!=q){ p="NOT UNIQUE\n"; } y=q; m[q]=2; } } } if(p=="NOT UNIQUE\n"){ cout << p; } else if(resp==false){ cout << "NOT POSSIBLE\n"; } else{ if(y=="-1"){ cout << "NOT POSSIBLE\n"; return 0; } cout << y << endl; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 2 ms | 384 KB | Output is correct |
8 | Correct | 2 ms | 384 KB | Output is correct |
9 | Correct | 2 ms | 384 KB | Output is correct |
10 | Correct | 2 ms | 384 KB | Output is correct |
11 | Correct | 3 ms | 384 KB | Output is correct |
12 | Correct | 3 ms | 384 KB | Output is correct |
13 | Correct | 2 ms | 384 KB | Output is correct |
14 | Correct | 2 ms | 384 KB | Output is correct |
15 | Correct | 3 ms | 384 KB | Output is correct |
16 | Correct | 3 ms | 512 KB | Output is correct |
17 | Correct | 2 ms | 256 KB | Output is correct |
18 | Correct | 2 ms | 256 KB | Output is correct |
19 | Correct | 2 ms | 256 KB | Output is correct |
20 | Correct | 2 ms | 384 KB | Output is correct |
21 | Correct | 2 ms | 256 KB | Output is correct |
22 | Correct | 3 ms | 384 KB | Output is correct |
23 | Correct | 2 ms | 256 KB | Output is correct |
24 | Correct | 2 ms | 256 KB | Output is correct |
25 | Correct | 2 ms | 384 KB | Output is correct |
26 | Correct | 2 ms | 384 KB | Output is correct |
27 | Correct | 2 ms | 384 KB | Output is correct |
28 | Correct | 2 ms | 512 KB | Output is correct |
29 | Correct | 2 ms | 256 KB | Output is correct |
30 | Correct | 3 ms | 384 KB | Output is correct |
31 | Correct | 2 ms | 256 KB | Output is correct |
32 | Correct | 2 ms | 256 KB | Output is correct |
33 | Correct | 2 ms | 384 KB | Output is correct |
34 | Correct | 2 ms | 256 KB | Output is correct |
35 | Correct | 2 ms | 384 KB | Output is correct |
36 | Correct | 2 ms | 384 KB | Output is correct |
37 | Correct | 3 ms | 256 KB | Output is correct |
38 | Correct | 2 ms | 384 KB | Output is correct |
39 | Correct | 3 ms | 384 KB | Output is correct |
40 | Correct | 3 ms | 384 KB | Output is correct |
41 | Correct | 2 ms | 384 KB | Output is correct |
42 | Correct | 2 ms | 256 KB | Output is correct |
43 | Correct | 2 ms | 384 KB | Output is correct |
44 | Correct | 2 ms | 384 KB | Output is correct |
45 | Correct | 3 ms | 256 KB | Output is correct |
46 | Correct | 3 ms | 256 KB | Output is correct |
47 | Correct | 4 ms | 384 KB | Output is correct |
48 | Correct | 3 ms | 384 KB | Output is correct |
49 | Correct | 2 ms | 384 KB | Output is correct |
50 | Correct | 32 ms | 376 KB | Output is correct |
51 | Correct | 10 ms | 384 KB | Output is correct |
52 | Correct | 10 ms | 384 KB | Output is correct |
53 | Correct | 8 ms | 256 KB | Output is correct |
54 | Correct | 7 ms | 404 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1072 ms | 6380 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |