Submission #860763

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
860763	2023-10-14T07:26:01 Z	Ellinor	Three Friends (BOI14_friends)	Python 3	0 / 100	442 ms	7796 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	13 ms	3160 KB	Output is correct
3	Correct	10 ms	2908 KB	Output is correct
4	Correct	10 ms	2908 KB	Output is correct
5	Correct	10 ms	2888 KB	Output is correct
6	Correct	11 ms	2912 KB	Output is correct
7	Correct	13 ms	2908 KB	Output is correct
8	Correct	10 ms	2908 KB	Output is correct
9	Correct	11 ms	2908 KB	Output is correct
10	Correct	10 ms	2908 KB	Output is correct
11	Correct	10 ms	2916 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	10 ms	2808 KB	Output is correct
16	Correct	14 ms	2908 KB	Output is correct
17	Correct	12 ms	3056 KB	Output is correct
18	Correct	11 ms	3040 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	2908 KB	Output is correct
22	Correct	10 ms	2892 KB	Output is correct
23	Correct	11 ms	2920 KB	Output is correct
24	Correct	10 ms	2908 KB	Output is correct
25	Correct	11 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	Incorrect	11 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	238 ms	7796 KB	Output is correct
2	Correct	212 ms	7688 KB	Output is correct
3	Correct	221 ms	7728 KB	Output is correct
4	Correct	222 ms	7796 KB	Output is correct
5	Correct	212 ms	7796 KB	Output is correct
6	Correct	14 ms	6980 KB	Output is correct
7	Correct	442 ms	7796 KB	Output is correct
8	Correct	171 ms	6648 KB	Output is correct
9	Correct	174 ms	7316 KB	Output is correct
10	Correct	224 ms	7320 KB	Output is correct
11	Correct	14 ms	6260 KB	Output is correct
12	Correct	10 ms	2960 KB	Output is correct
13	Correct	10 ms	2908 KB	Output is correct
14	Correct	13 ms	2908 KB	Output is correct
15	Correct	10 ms	2908 KB	Output is correct
16	Correct	10 ms	2908 KB	Output is correct
17	Correct	11 ms	2908 KB	Output is correct
18	Correct	15 ms	2908 KB	Output is correct
19	Correct	10 ms	2920 KB	Output is correct
20	Correct	11 ms	2908 KB	Output is correct
21	Correct	10 ms	2940 KB	Output is correct
22	Correct	11 ms	3052 KB	Output is correct
23	Correct	10 ms	2864 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	3056 KB	Output is correct
27	Correct	11 ms	2908 KB	Output is correct
28	Correct	10 ms	2836 KB	Output is correct
29	Correct	10 ms	3160 KB	Output is correct
30	Correct	11 ms	2908 KB	Output is correct
31	Correct	11 ms	2812 KB	Output is correct
32	Correct	11 ms	2912 KB	Output is correct
33	Correct	10 ms	2808 KB	Output is correct
34	Correct	10 ms	3056 KB	Output is correct
35	Correct	11 ms	2908 KB	Output is correct
36	Correct	10 ms	2972 KB	Output is correct
37	Correct	10 ms	2908 KB	Output is correct
38	Correct	10 ms	2908 KB	Output is correct
39	Correct	11 ms	2908 KB	Output is correct
40	Incorrect	10 ms	2908 KB	Output isn't correct
41	Halted	0 ms	0 KB	-