답안 #131088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131088	2019-07-16T12:51:34 Z	Autoratch	세 명의 친구들 (BOI14_friends)	C++14	100 / 100	14 ms	6552 KB

friends

#include <bits/stdc++.h>
using namespace std;

int n;
string s;
set<string> ans;

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

    cin >> n >> s;

    if(n%2==0){ cout << "NOT POSSIBLE"; return 0; }

    if(s.substr(1,n/2)==s.substr(1+n/2,n/2)) ans.insert(s.substr(1,n/2));

    bool sk = false,bm = true;

    for(int i = 0,j = n/2;i < n/2 and j < n;)
    {
        if(s[i]!=s[j]) 
        {
            if(sk){ bm = false; break; }
            else j++,sk = true;
        }
        else i++,j++;
    }

    if(bm) ans.insert(s.substr(0,n/2));

    sk = false,bm = true;

    for(int i = 0,j = n/2+1;i < n/2+1 and j < n;)
    {
        if(s[i]!=s[j]) 
        {
            if(sk){ bm = false; break; }
            else i++,sk = true;
        }
        else i++,j++; 
    }

    if(bm) ans.insert(s.substr(n/2+1,n/2));

    if(ans.size()==0) cout << "NOT POSSIBLE";
    else if(ans.size()>1) cout << "NOT UNIQUE";
    else cout << *ans.begin();
}

Subtask #1

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 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	376 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	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 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	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	380 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	3 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	2 ms	376 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	2 ms	376 KB	Output is correct
45	Correct	2 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	2 ms	376 KB	Output is correct
49	Correct	2 ms	376 KB	Output is correct
50	Correct	2 ms	376 KB	Output is correct
51	Correct	2 ms	376 KB	Output is correct
52	Correct	2 ms	376 KB	Output is correct
53	Correct	3 ms	376 KB	Output is correct
54	Correct	2 ms	376 KB	Output is correct

Subtask #2

65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	4248 KB	Output is correct
2	Correct	12 ms	4316 KB	Output is correct
3	Correct	11 ms	4252 KB	Output is correct
4	Correct	12 ms	4248 KB	Output is correct
5	Correct	13 ms	4336 KB	Output is correct
6	Correct	7 ms	2552 KB	Output is correct
7	Correct	14 ms	5236 KB	Output is correct
8	Correct	11 ms	4760 KB	Output is correct
9	Correct	11 ms	4760 KB	Output is correct
10	Correct	11 ms	6552 KB	Output is correct
11	Correct	9 ms	5276 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	276 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	412 KB	Output is correct
34	Correct	3 ms	376 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	2 ms	376 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	380 KB	Output is correct
44	Correct	2 ms	380 KB	Output is correct
45	Correct	2 ms	376 KB	Output is correct
46	Correct	2 ms	348 KB	Output is correct
47	Correct	2 ms	376 KB	Output is correct
48	Correct	2 ms	376 KB	Output is correct
49	Correct	2 ms	376 KB	Output is correct
50	Correct	2 ms	384 KB	Output is correct
51	Correct	2 ms	416 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	376 KB	Output is correct