oj.uz

Submission #154440

# Submission time Handle Problem Language Result Execution time Memory
154440 2019-09-21T20:10:05 Z brcode Three Friends (BOI14_friends) C++14
100 / 100
 142 ms 9164 KB 
#include <iostream>

using namespace std;
string res;
string res2;
bool ans1 = true;
bool ans2 = true;
int main(){
    int n;
    cin>>n;
    string s;
    cin>>s;

    int mid = (s.length()+1)/2;
    int sz = (s.length()-1)/2;
    s='#'+s;
    int temp = mid+1;
    bool ok = false;
    int j = 1;
    int cnt = 1;
    while(cnt<=sz){

        if(s[j]!=s[temp]){
            if(ok){
                ans1= false;
                break;
            }else{
                ok = true;
                j++;
            }
        }else{
            temp++;
            j++;
            cnt++;
        }

    }
    ok = false;
    temp= mid;
    j=1;
    cnt = 1;
    while(cnt<=sz){
      //      cout<<s[j]<<" "<<s[temp]<<endl;
        if(s[j]!=s[temp]){
            if(ok){
                ans2 = false;
                break;
            }else{
                ok = true;
                temp++;
            }
        }else{
            temp++;
            j++;
            cnt++;
        }

    }

 //   cout<<ans1<<" "<<ans2<<endl;
    if((!ans1 && !ans2)||s.length()%2 == 1){
        cout<<"NOT POSSIBLE"<<endl;
    }else if(!ans2){

        for(int i=mid+1;i<s.length();i++){
            res+=s[i];
        }
        cout<<res<<endl;
    }else if(!ans1){
        for(int i=1;i<=sz;i++){
            res+=s[i];
        }
        cout<<res<<endl;
    }else{
            // cout<<res<<" "<<res2<<endl;
            res="";
            res2="";
         for(int i=mid+1;i<s.length();i++){
              //  cout<<s[i]<<endl;
            res+=s[i];
        }
         for(int i=1;i<=sz;i++){

            res2+=s[i];

        }

        if(res == res2){
            cout<<res<<endl;
        }else{

            cout<<"NOT UNIQUE"<<endl;
        }
    }
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:65:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=mid+1;i<s.length();i++){
                         ~^~~~~~~~~~~
friends.cpp:78:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          for(int i=mid+1;i<s.length();i++){
                          ~^~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 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 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 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 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 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 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 252 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 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 256 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 252 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 2 ms 376 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 3 ms 376 KB Output is correct
45 Correct 3 ms 376 KB Output is correct
46 Correct 3 ms 400 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 256 KB Output is correct
49 Correct 3 ms 256 KB Output is correct
50 Correct 3 ms 256 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 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 8116 KB Output is correct
2 Correct 133 ms 8180 KB Output is correct
3 Correct 137 ms 8216 KB Output is correct
4 Correct 132 ms 8084 KB Output is correct
5 Correct 135 ms 8196 KB Output is correct
6 Correct 122 ms 6312 KB Output is correct
7 Correct 142 ms 9164 KB Output is correct
8 Correct 128 ms 6532 KB Output is correct
9 Correct 117 ms 6552 KB Output is correct
10 Correct 116 ms 6532 KB Output is correct
11 Correct 100 ms 5352 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 1 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 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 252 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 252 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 252 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 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 252 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 292 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 252 KB Output is correct
45 Correct 3 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 3 ms 256 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 376 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