Submission #290249

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
290249	2020-09-03T14:42:24 Z	MasterTaster	Three Friends (BOI14_friends)	C++14	100 / 100	13 ms	5688 KB

friends

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define xx first
#define yy second
#define endl "\n"

int n;
string s;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n>>s;

    n=s.size();
    if (n%2==0) { cout<<"NOT POSSIBLE"; exit(0); }

    bool istePolovine=true;
    for (int i=0; i<n/2; i++)
        if (s[i]!=s[n/2+i+1]) istePolovine=false;
    if (istePolovine)
    {
        cout<<s.substr(0, n/2);
        exit(0);
    }

    int koliko1=0; int koliko2=0;
    int j=n/2;
    for (int i=0; i<n/2; i++, j++)
        while (j<n && s[i]!=s[j]) { koliko1++; j++; }

    int k=0;
    for (int i=n/2+1; i<n; i++, k++)
        while (k<=n/2 && s[i]!=s[k]) { /*cout<<i<<" "<<k<<endl;*/ koliko2++; k++; }

    if (koliko1>1 && koliko2>1) cout<<"NOT POSSIBLE";
    else if (koliko1<=1 && koliko2<=1) cout<<"NOT UNIQUE";
    else
    {
        if (koliko1<=1)
            cout<<s.substr(0, n/2);
        else
            cout<<s.substr(n/2+1, n/2);
    }
}

Subtask #1

35.0 / 35.0

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

Subtask #2

65.0 / 65.0

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