oj.uz

Submission #44298

# Submission time Handle Problem Language Result Execution time Memory
44298 2018-03-31T10:40:02 Z ista2000 Three Friends (BOI14_friends) C++17
100 / 100
 14 ms 5780 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long int

const int mod = 1e9+7;

#undef int
int main()
{
#define int long long int
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;
    string s;
    cin>>s;
    if(!(n&1))
    {
        cout<<"NOT POSSIBLE"<<endl;
        return 0;
    }
    int c = n/2, skip = 0;
    bool poss = true;string ans1 = "", ans2 = "";
    for(int i = 0;i<n/2;i++, c++)
    {
        if(s[i]!=s[c])
        {
            if(skip)
            {
                poss = false;
                break;
            }
            skip++;
            i--;
        }
    }
    if(poss)
        ans1 = s.substr(0, n/2);
    poss = true;
    c = 0, skip = 0;
    for(int i = n/2+1;i<n;i++, c++)
    { 
        if(s[i]!=s[c])
        {
            if(skip)
            {
                poss = false;
                break;
            }
            skip++;
            i--;
        }
    }
    if(poss)
        ans2 = s.substr(n/2+1);
    if(ans1!=""&&ans2!=""&&ans1!=ans2)
        cout<<"NOT UNIQUE"<<endl;
    else if(ans1!="")
        cout<<ans1<<endl;
    else if(ans2!="")
        cout<<ans2<<endl;
    else
        cout<<"NOT POSSIBLE"<<endl;


    return 0;
}

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 540 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 540 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 2 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 2 ms 740 KB Output is correct
18 Correct 2 ms 740 KB Output is correct
19 Correct 2 ms 740 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 2 ms 740 KB Output is correct
22 Correct 2 ms 740 KB Output is correct
23 Correct 2 ms 740 KB Output is correct
24 Correct 2 ms 740 KB Output is correct
25 Correct 2 ms 740 KB Output is correct
26 Correct 2 ms 740 KB Output is correct
27 Correct 2 ms 740 KB Output is correct
28 Correct 2 ms 740 KB Output is correct
29 Correct 2 ms 740 KB Output is correct
30 Correct 2 ms 740 KB Output is correct
31 Correct 2 ms 768 KB Output is correct
32 Correct 2 ms 768 KB Output is correct
33 Correct 2 ms 768 KB Output is correct
34 Correct 3 ms 768 KB Output is correct
35 Correct 2 ms 768 KB Output is correct
36 Correct 2 ms 768 KB Output is correct
37 Correct 2 ms 768 KB Output is correct
38 Correct 2 ms 768 KB Output is correct
39 Correct 2 ms 896 KB Output is correct
40 Correct 2 ms 896 KB Output is correct
41 Correct 2 ms 896 KB Output is correct
42 Correct 2 ms 896 KB Output is correct
43 Correct 3 ms 896 KB Output is correct
44 Correct 2 ms 896 KB Output is correct
45 Correct 2 ms 896 KB Output is correct
46 Correct 2 ms 896 KB Output is correct
47 Correct 2 ms 896 KB Output is correct
48 Correct 2 ms 896 KB Output is correct
49 Correct 2 ms 896 KB Output is correct
50 Correct 2 ms 940 KB Output is correct
51 Correct 2 ms 940 KB Output is correct
52 Correct 2 ms 940 KB Output is correct
53 Correct 2 ms 940 KB Output is correct
54 Correct 2 ms 940 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4708 KB Output is correct
2 Correct 10 ms 4724 KB Output is correct
3 Correct 9 ms 4740 KB Output is correct
4 Correct 10 ms 4752 KB Output is correct
5 Correct 13 ms 4756 KB Output is correct
6 Correct 9 ms 4756 KB Output is correct
7 Correct 11 ms 5780 KB Output is correct
8 Correct 9 ms 5780 KB Output is correct
9 Correct 10 ms 5780 KB Output is correct
10 Correct 11 ms 5780 KB Output is correct
11 Correct 8 ms 5780 KB Output is correct
12 Correct 2 ms 5780 KB Output is correct
13 Correct 2 ms 5780 KB Output is correct
14 Correct 2 ms 5780 KB Output is correct
15 Correct 2 ms 5780 KB Output is correct
16 Correct 2 ms 5780 KB Output is correct
17 Correct 2 ms 5780 KB Output is correct
18 Correct 2 ms 5780 KB Output is correct
19 Correct 2 ms 5780 KB Output is correct
20 Correct 2 ms 5780 KB Output is correct
21 Correct 2 ms 5780 KB Output is correct
22 Correct 2 ms 5780 KB Output is correct
23 Correct 2 ms 5780 KB Output is correct
24 Correct 2 ms 5780 KB Output is correct
25 Correct 2 ms 5780 KB Output is correct
26 Correct 2 ms 5780 KB Output is correct
27 Correct 2 ms 5780 KB Output is correct
28 Correct 2 ms 5780 KB Output is correct
29 Correct 2 ms 5780 KB Output is correct
30 Correct 2 ms 5780 KB Output is correct
31 Correct 2 ms 5780 KB Output is correct
32 Correct 2 ms 5780 KB Output is correct
33 Correct 2 ms 5780 KB Output is correct
34 Correct 2 ms 5780 KB Output is correct
35 Correct 2 ms 5780 KB Output is correct
36 Correct 2 ms 5780 KB Output is correct
37 Correct 2 ms 5780 KB Output is correct
38 Correct 2 ms 5780 KB Output is correct
39 Correct 2 ms 5780 KB Output is correct
40 Correct 2 ms 5780 KB Output is correct
41 Correct 2 ms 5780 KB Output is correct
42 Correct 2 ms 5780 KB Output is correct
43 Correct 2 ms 5780 KB Output is correct
44 Correct 2 ms 5780 KB Output is correct
45 Correct 2 ms 5780 KB Output is correct
46 Correct 2 ms 5780 KB Output is correct
47 Correct 2 ms 5780 KB Output is correct
48 Correct 2 ms 5780 KB Output is correct
49 Correct 2 ms 5780 KB Output is correct
50 Correct 2 ms 5780 KB Output is correct
51 Correct 2 ms 5780 KB Output is correct
52 Correct 2 ms 5780 KB Output is correct
53 Correct 2 ms 5780 KB Output is correct
54 Correct 2 ms 5780 KB Output is correct