Submission #860762

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
860762	2023-10-14T07:00:27 Z	Ellinor	Three Friends (BOI14_friends)	Python 3	0 / 100	377 ms	9092 KB

friends

N = int(input())
n = N // 2
s = input()

if not N % 2:
    print("NOT POSSIBLE")
    exit(0)

ans = []

if s[1:n+1] == s[n+1:N]:
    ans.append(s[1:n+1])

if s[0] == s[n]:
    p = 0
    ss = s[0]
    for i in range(1,n):
        if not s[i] == s[n + i + p]:
            if p == 0:
                p = 1
                i -= 1
            else:
                p = 2
                break
    if p < 2:
        if not s[0:n] in ans:
            ans.append(s[0:n])

if s[0] == s[n + 1]:
    p = 0
    ss = s[n + 1]
    for i in range(1,n):
        if not s[i + p] == s[n + 1 + i]:
            if p == 0:
                p = 1
                i -= 1
            else:
                p = 2
                break
    if p < 2:
        if not s[n+1:N] in ans:
            ans.append(s[n+1:N])

if len(ans) > 1:
    print("NOT UNIQUE")
elif len(ans) == 1:
    print(ans[0])
else:
    print("NOT POSSIBLE")

Subtask #1

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	2908 KB	Output is correct
2	Correct	10 ms	2908 KB	Output is correct
3	Correct	10 ms	2836 KB	Output is correct
4	Correct	17 ms	2908 KB	Output is correct
5	Correct	10 ms	2908 KB	Output is correct
6	Correct	10 ms	2908 KB	Output is correct
7	Correct	12 ms	3028 KB	Output is correct
8	Correct	10 ms	2908 KB	Output is correct
9	Correct	10 ms	2908 KB	Output is correct
10	Correct	10 ms	2904 KB	Output is correct
11	Correct	10 ms	2908 KB	Output is correct
12	Correct	10 ms	3056 KB	Output is correct
13	Correct	14 ms	2908 KB	Output is correct
14	Correct	10 ms	3060 KB	Output is correct
15	Correct	10 ms	2908 KB	Output is correct
16	Correct	10 ms	2828 KB	Output is correct
17	Correct	11 ms	3412 KB	Output is correct
18	Correct	10 ms	2908 KB	Output is correct
19	Correct	10 ms	2908 KB	Output is correct
20	Correct	10 ms	2908 KB	Output is correct
21	Correct	10 ms	2908 KB	Output is correct
22	Correct	10 ms	3012 KB	Output is correct
23	Correct	10 ms	3056 KB	Output is correct
24	Correct	10 ms	2908 KB	Output is correct
25	Correct	10 ms	2908 KB	Output is correct
26	Correct	10 ms	2908 KB	Output is correct
27	Correct	10 ms	2908 KB	Output is correct
28	Correct	11 ms	3052 KB	Output is correct
29	Incorrect	10 ms	2908 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #2

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	217 ms	9076 KB	Output is correct
2	Correct	212 ms	9072 KB	Output is correct
3	Correct	227 ms	8988 KB	Output is correct
4	Correct	260 ms	9076 KB	Output is correct
5	Correct	224 ms	8972 KB	Output is correct
6	Correct	14 ms	8220 KB	Output is correct
7	Correct	377 ms	9012 KB	Output is correct
8	Correct	164 ms	8440 KB	Output is correct
9	Correct	171 ms	9092 KB	Output is correct
10	Correct	205 ms	9076 KB	Output is correct
11	Correct	14 ms	8044 KB	Output is correct
12	Correct	10 ms	2908 KB	Output is correct
13	Correct	10 ms	2908 KB	Output is correct
14	Correct	10 ms	2908 KB	Output is correct
15	Correct	11 ms	3044 KB	Output is correct
16	Correct	10 ms	2908 KB	Output is correct
17	Correct	11 ms	2932 KB	Output is correct
18	Correct	10 ms	2908 KB	Output is correct
19	Correct	10 ms	2908 KB	Output is correct
20	Correct	10 ms	2908 KB	Output is correct
21	Correct	11 ms	3056 KB	Output is correct
22	Correct	10 ms	3036 KB	Output is correct
23	Correct	10 ms	2908 KB	Output is correct
24	Correct	10 ms	3008 KB	Output is correct
25	Correct	10 ms	2908 KB	Output is correct
26	Correct	10 ms	2908 KB	Output is correct
27	Correct	10 ms	2908 KB	Output is correct
28	Correct	10 ms	2908 KB	Output is correct
29	Correct	10 ms	2996 KB	Output is correct
30	Correct	10 ms	2908 KB	Output is correct
31	Correct	10 ms	2908 KB	Output is correct
32	Correct	10 ms	2908 KB	Output is correct
33	Correct	10 ms	3024 KB	Output is correct
34	Correct	10 ms	3060 KB	Output is correct
35	Correct	10 ms	2908 KB	Output is correct
36	Correct	10 ms	2988 KB	Output is correct
37	Correct	11 ms	3056 KB	Output is correct
38	Correct	10 ms	2908 KB	Output is correct
39	Correct	10 ms	3160 KB	Output is correct
40	Incorrect	11 ms	2908 KB	Output isn't correct
41	Halted	0 ms	0 KB	-