oj.uz

Submission #42602

# Submission time Handle Problem Language Result Execution time Memory
42602 2018-02-28T19:05:46 Z Hassoony Three Friends (BOI14_friends) C++14
100 / 100
 101 ms 7728 KB 
#include<bits/stdc++.h>
#include<unordered_map>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=1309;
int n,sum;
string s,ret,s1,s2;
int main(){
    cin>>n>>s;
    if(n%2==0){
        puts("NOT POSSIBLE");
        return 0;
    }
    for(int i=0;i<n/2;i++)s1+=s[i];
    for(int i=n/2+1;i<n;i++)s2+=s[i];
    if(s1==s2){
        cout<<s1<<endl;
        return 0;
    }
    int f1=0,f2=0,j=0;
    for(int i=0;i<n;i++){
        if(s[i]==s1[j])j++;
        if(j==n/2){
            f1++;
            j=0;
        }
    }
    j=0;
    for(int i=0;i<n;i++){
        if(s[i]==s2[j])j++;
        if(j==n/2){
            f2++;
            j=0;
        }
    }
    if(f1==2&&f2==2){
        puts("NOT UNIQUE");
        return 0;
    }
    if(f1==2){
        cout<<s1<<endl;
        return 0;
    }
    if(f2==2){
        cout<<s2<<endl;
        return 0;
    }
    puts("NOT POSSIBLE");
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 352 KB Output is correct
4 Correct 2 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 1 ms 616 KB Output is correct
9 Correct 1 ms 616 KB Output is correct
10 Correct 1 ms 616 KB Output is correct
11 Correct 1 ms 616 KB Output is correct
12 Correct 1 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 1 ms 616 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 2 ms 616 KB Output is correct
18 Correct 1 ms 616 KB Output is correct
19 Correct 2 ms 616 KB Output is correct
20 Correct 1 ms 620 KB Output is correct
21 Correct 1 ms 620 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 1 ms 676 KB Output is correct
25 Correct 2 ms 676 KB Output is correct
26 Correct 1 ms 676 KB Output is correct
27 Correct 2 ms 676 KB Output is correct
28 Correct 1 ms 676 KB Output is correct
29 Correct 1 ms 676 KB Output is correct
30 Correct 1 ms 676 KB Output is correct
31 Correct 2 ms 676 KB Output is correct
32 Correct 1 ms 676 KB Output is correct
33 Correct 1 ms 676 KB Output is correct
34 Correct 1 ms 676 KB Output is correct
35 Correct 2 ms 676 KB Output is correct
36 Correct 2 ms 676 KB Output is correct
37 Correct 1 ms 744 KB Output is correct
38 Correct 1 ms 744 KB Output is correct
39 Correct 2 ms 744 KB Output is correct
40 Correct 2 ms 744 KB Output is correct
41 Correct 2 ms 744 KB Output is correct
42 Correct 1 ms 744 KB Output is correct
43 Correct 1 ms 744 KB Output is correct
44 Correct 1 ms 744 KB Output is correct
45 Correct 2 ms 788 KB Output is correct
46 Correct 2 ms 792 KB Output is correct
47 Correct 2 ms 796 KB Output is correct
48 Correct 2 ms 800 KB Output is correct
49 Correct 2 ms 804 KB Output is correct
50 Correct 1 ms 808 KB Output is correct
51 Correct 1 ms 808 KB Output is correct
52 Correct 2 ms 808 KB Output is correct
53 Correct 2 ms 820 KB Output is correct
54 Correct 1 ms 820 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 7624 KB Output is correct
2 Correct 95 ms 7624 KB Output is correct
3 Correct 99 ms 7696 KB Output is correct
4 Correct 94 ms 7696 KB Output is correct
5 Correct 94 ms 7696 KB Output is correct
6 Correct 71 ms 7696 KB Output is correct
7 Correct 93 ms 7728 KB Output is correct
8 Correct 94 ms 7728 KB Output is correct
9 Correct 84 ms 7728 KB Output is correct
10 Correct 83 ms 7728 KB Output is correct
11 Correct 81 ms 7728 KB Output is correct
12 Correct 2 ms 7728 KB Output is correct
13 Correct 1 ms 7728 KB Output is correct
14 Correct 2 ms 7728 KB Output is correct
15 Correct 1 ms 7728 KB Output is correct
16 Correct 1 ms 7728 KB Output is correct
17 Correct 2 ms 7728 KB Output is correct
18 Correct 1 ms 7728 KB Output is correct
19 Correct 2 ms 7728 KB Output is correct
20 Correct 2 ms 7728 KB Output is correct
21 Correct 1 ms 7728 KB Output is correct
22 Correct 1 ms 7728 KB Output is correct
23 Correct 1 ms 7728 KB Output is correct
24 Correct 2 ms 7728 KB Output is correct
25 Correct 2 ms 7728 KB Output is correct
26 Correct 1 ms 7728 KB Output is correct
27 Correct 1 ms 7728 KB Output is correct
28 Correct 1 ms 7728 KB Output is correct
29 Correct 1 ms 7728 KB Output is correct
30 Correct 1 ms 7728 KB Output is correct
31 Correct 1 ms 7728 KB Output is correct
32 Correct 1 ms 7728 KB Output is correct
33 Correct 2 ms 7728 KB Output is correct
34 Correct 2 ms 7728 KB Output is correct
35 Correct 1 ms 7728 KB Output is correct
36 Correct 1 ms 7728 KB Output is correct
37 Correct 1 ms 7728 KB Output is correct
38 Correct 1 ms 7728 KB Output is correct
39 Correct 1 ms 7728 KB Output is correct
40 Correct 2 ms 7728 KB Output is correct
41 Correct 1 ms 7728 KB Output is correct
42 Correct 2 ms 7728 KB Output is correct
43 Correct 1 ms 7728 KB Output is correct
44 Correct 2 ms 7728 KB Output is correct
45 Correct 1 ms 7728 KB Output is correct
46 Correct 2 ms 7728 KB Output is correct
47 Correct 1 ms 7728 KB Output is correct
48 Correct 1 ms 7728 KB Output is correct
49 Correct 1 ms 7728 KB Output is correct
50 Correct 1 ms 7728 KB Output is correct
51 Correct 1 ms 7728 KB Output is correct
52 Correct 1 ms 7728 KB Output is correct
53 Correct 1 ms 7728 KB Output is correct
54 Correct 1 ms 7728 KB Output is correct