Submission #398887

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
398887	2021-05-04T21:48:38 Z	Abdulmohsen1284	Three Friends (BOI14_friends)	C++14	35 / 100	500 ms	7236 KB

friends

#include <bits/stdc++.h>
 
using namespace std;
//long long mo=1000000007;
//long long num[100005],dis[100005],di[100005],d[100005],eis[100005],ei[100005],e[100005];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n;
    cin>>n;
    string s,an="0";
    bool ans=false;
    cin>>s;
    if(s.size()%2==0)
    {cout<<"NOT POSSIBLE"; return 0;}
    for(int i=0;i<n;i++)
    {
        string c=s.substr(0,i)+s.substr(i+1,n-i);
        if(c.substr(0,c.size()/2)==c.substr(c.size()/2,c.size()/2))
        {
            if(!ans)
            {
                an=c.substr(0,c.size()/2);
                ans=true;
            }
            else
            {
                if(an!=c.substr(0,c.size()/2))
                {
                    cout<<"NOT UNIQUE";
                    return 0;
                }
            }
        }
    }
    if(an!="0")
        cout<<an;
    else
        cout<<"NOT POSSIBLE";
    return 0;
}

Subtask #1

35.0 / 35.0

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

Subtask #2

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1082 ms	7236 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-