oj.uz

Submission #135728

# Submission time Handle Problem Language Result Execution time Memory
135728 2019-07-24T10:11:57 Z forelax Three Friends (BOI14_friends) C++14
100 / 100
 128 ms 7284 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
    int m;cin>>m;
    if(m%2==0){
        cout<<"NOT POSSIBLE";
        return 0;
    }
    int n=m/2;
    string a;
    cin>>a;
    string fa=a.substr(0,n);
    string fb=a.substr(n);
    string sa=a.substr(0,n+1);
    string sb=a.substr(n+1);
//    cout<<fa<<" "<<fb<<endl<<sa<<" "<<sb<<endl;
    int vff,vfb;
    int vsf,vsb;
    for( vff=0 ; vff < n ; vff ++)
        if(fa[vff]!=fb[vff])break;
    for( vfb=0 ; vfb < n ; vfb ++)
        if(fa[n-1-vfb]!=fb[n-vfb])break;
    for( vsf=0 ; vsf < n ; vsf ++)
        if(sa[vsf]!=sb[vsf])break;
    for( vsb=0 ; vsb < n ; vsb ++)
        if(sa[n-vsb]!=sb[n-1-vsb])break;
//    cout<<vff<<" "<<vfb<<endl<<vsf<<" "<<vsb<<endl;
    int sf=vff+vfb;
    int ss=vsf+vsb;
    if(sf<n&&ss<n){
        cout<<"NOT POSSIBLE";
        return 0;
    }
    if(sf>=n&&ss>=n){
        if(fa==sb)
            cout<<fa;
        else
            cout<<"NOT UNIQUE";
        return 0;
    }
    if(sf>=n)
        cout<<fa;
    else if(ss>=n)
        cout<<sb;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 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 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 252 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 376 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 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 256 KB Output is correct
45 Correct 2 ms 252 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 256 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 2 ms 256 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 256 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 7284 KB Output is correct
2 Correct 121 ms 7140 KB Output is correct
3 Correct 128 ms 7236 KB Output is correct
4 Correct 126 ms 7136 KB Output is correct
5 Correct 121 ms 7140 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 125 ms 7240 KB Output is correct
8 Correct 108 ms 5608 KB Output is correct
9 Correct 109 ms 6632 KB Output is correct
10 Correct 108 ms 6532 KB Output is correct
11 Correct 100 ms 5224 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 252 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 2 ms 380 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 2 ms 256 KB Output is correct
45 Correct 4 ms 252 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 252 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 2 ms 256 KB Output is correct
54 Correct 2 ms 376 KB Output is correct