Submission #72888

# Submission time Handle Problem Language Result Execution time Memory
72888 2018-08-27T07:40:52 Z Vardanyan Three Friends (BOI14_friends) C++14
100 / 100
154 ms 16052 KB
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
bool check(string a,string b){
    if(a.length()<b.length()) swap(a,b);
    int i = 0;
    int j = 0;
    bool f = false;
    while(i<a.length()){
        if(a[i]!=b[j] && f) return false;
        if(a[i]!=b[j]){
            f = true;
            i++;
            continue;
        }
        i++;
        j++;
    }
    return true;
}
int main()
{
    int n;
    string s;
    cin>>n>>s;
    if(n%2 == 0){
        cout<<"NOT POSSIBLE"<<endl;
        return 0;
    }
    string s1;
    for(int i = 0;i<n/2;i++) s1+=s[i];
    string s2;
    for(int i = n/2+1;i<n;i++) s2+=s[i];
    string s3;
    for(int i = 0;i<=n/2;i++) s3+=s[i];
    string s4;
    for(int i = n/2;i<n;i++) s4+=s[i];
    int c = check(s1,s4)+check(s2,s3);
    if(c == 0){
        cout<<"NOT POSSIBLE"<<endl;
        return 0;
    }
    if(c == 1 || s1 == s2){
        if(check(s1,s4)) cout<<s1<<endl;
        else cout<<s2<<endl;
        return 0;
    }
    cout<<"NOT UNIQUE"<<endl;
    return 0;
}

Compilation message

friends.cpp: In function 'bool check(std::__cxx11::string, std::__cxx11::string)':
friends.cpp:9:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i<a.length()){
           ~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 3 ms 548 KB Output is correct
7 Correct 3 ms 548 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Correct 2 ms 548 KB Output is correct
11 Correct 3 ms 548 KB Output is correct
12 Correct 2 ms 548 KB Output is correct
13 Correct 2 ms 548 KB Output is correct
14 Correct 2 ms 568 KB Output is correct
15 Correct 2 ms 568 KB Output is correct
16 Correct 2 ms 568 KB Output is correct
17 Correct 2 ms 568 KB Output is correct
18 Correct 3 ms 568 KB Output is correct
19 Correct 2 ms 636 KB Output is correct
20 Correct 3 ms 636 KB Output is correct
21 Correct 4 ms 636 KB Output is correct
22 Correct 3 ms 636 KB Output is correct
23 Correct 3 ms 636 KB Output is correct
24 Correct 3 ms 708 KB Output is correct
25 Correct 2 ms 844 KB Output is correct
26 Correct 3 ms 844 KB Output is correct
27 Correct 2 ms 844 KB Output is correct
28 Correct 3 ms 844 KB Output is correct
29 Correct 3 ms 844 KB Output is correct
30 Correct 2 ms 844 KB Output is correct
31 Correct 2 ms 844 KB Output is correct
32 Correct 2 ms 844 KB Output is correct
33 Correct 2 ms 844 KB Output is correct
34 Correct 2 ms 844 KB Output is correct
35 Correct 3 ms 844 KB Output is correct
36 Correct 2 ms 844 KB Output is correct
37 Correct 3 ms 844 KB Output is correct
38 Correct 2 ms 844 KB Output is correct
39 Correct 2 ms 844 KB Output is correct
40 Correct 2 ms 844 KB Output is correct
41 Correct 2 ms 844 KB Output is correct
42 Correct 2 ms 844 KB Output is correct
43 Correct 2 ms 844 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 3 ms 844 KB Output is correct
46 Correct 3 ms 844 KB Output is correct
47 Correct 2 ms 844 KB Output is correct
48 Correct 3 ms 848 KB Output is correct
49 Correct 4 ms 856 KB Output is correct
50 Correct 3 ms 856 KB Output is correct
51 Correct 4 ms 864 KB Output is correct
52 Correct 3 ms 868 KB Output is correct
53 Correct 3 ms 880 KB Output is correct
54 Correct 3 ms 880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 101 ms 12616 KB Output is correct
2 Correct 100 ms 12628 KB Output is correct
3 Correct 93 ms 12628 KB Output is correct
4 Correct 111 ms 12628 KB Output is correct
5 Correct 110 ms 12628 KB Output is correct
6 Correct 154 ms 12628 KB Output is correct
7 Correct 118 ms 12628 KB Output is correct
8 Correct 100 ms 12628 KB Output is correct
9 Correct 96 ms 13344 KB Output is correct
10 Correct 86 ms 15072 KB Output is correct
11 Correct 86 ms 16052 KB Output is correct
12 Correct 2 ms 16052 KB Output is correct
13 Correct 3 ms 16052 KB Output is correct
14 Correct 2 ms 16052 KB Output is correct
15 Correct 2 ms 16052 KB Output is correct
16 Correct 3 ms 16052 KB Output is correct
17 Correct 2 ms 16052 KB Output is correct
18 Correct 2 ms 16052 KB Output is correct
19 Correct 3 ms 16052 KB Output is correct
20 Correct 2 ms 16052 KB Output is correct
21 Correct 3 ms 16052 KB Output is correct
22 Correct 3 ms 16052 KB Output is correct
23 Correct 2 ms 16052 KB Output is correct
24 Correct 2 ms 16052 KB Output is correct
25 Correct 2 ms 16052 KB Output is correct
26 Correct 2 ms 16052 KB Output is correct
27 Correct 3 ms 16052 KB Output is correct
28 Correct 2 ms 16052 KB Output is correct
29 Correct 2 ms 16052 KB Output is correct
30 Correct 2 ms 16052 KB Output is correct
31 Correct 3 ms 16052 KB Output is correct
32 Correct 2 ms 16052 KB Output is correct
33 Correct 2 ms 16052 KB Output is correct
34 Correct 3 ms 16052 KB Output is correct
35 Correct 2 ms 16052 KB Output is correct
36 Correct 2 ms 16052 KB Output is correct
37 Correct 2 ms 16052 KB Output is correct
38 Correct 2 ms 16052 KB Output is correct
39 Correct 2 ms 16052 KB Output is correct
40 Correct 2 ms 16052 KB Output is correct
41 Correct 2 ms 16052 KB Output is correct
42 Correct 2 ms 16052 KB Output is correct
43 Correct 2 ms 16052 KB Output is correct
44 Correct 2 ms 16052 KB Output is correct
45 Correct 2 ms 16052 KB Output is correct
46 Correct 2 ms 16052 KB Output is correct
47 Correct 2 ms 16052 KB Output is correct
48 Correct 2 ms 16052 KB Output is correct
49 Correct 2 ms 16052 KB Output is correct
50 Correct 3 ms 16052 KB Output is correct
51 Correct 2 ms 16052 KB Output is correct
52 Correct 2 ms 16052 KB Output is correct
53 Correct 3 ms 16052 KB Output is correct
54 Correct 3 ms 16052 KB Output is correct