oj.uz

Submission #860757

# Submission time Handle Problem Language Result Execution time Memory
860757 2023-10-14T06:57:46 Z Ellinor Three Friends (BOI14_friends) Python 3
0 / 100
 376 ms 9984 KB 
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:
        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:
        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 3064 KB Output is correct
3 Correct 10 ms 2908 KB Output is correct
4 Correct 10 ms 3064 KB Output is correct
5 Correct 13 ms 3332 KB Output is correct
6 Correct 14 ms 3160 KB Output is correct
7 Correct 10 ms 2908 KB Output is correct
8 Correct 10 ms 2868 KB Output is correct
9 Correct 10 ms 2908 KB Output is correct
10 Correct 10 ms 2908 KB Output is correct
11 Correct 10 ms 2908 KB Output is correct
12 Correct 10 ms 2908 KB Output is correct
13 Correct 10 ms 3068 KB Output is correct
14 Correct 10 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 10 ms 3056 KB Output is correct
18 Correct 10 ms 2908 KB Output is correct
19 Correct 11 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 2908 KB Output is correct
23 Correct 11 ms 2908 KB Output is correct
24 Correct 11 ms 2904 KB Output is correct
25 Correct 10 ms 2828 KB Output is correct
26 Correct 10 ms 2984 KB Output is correct
27 Correct 10 ms 2908 KB Output is correct
28 Correct 11 ms 2908 KB Output is correct
29 Incorrect 10 ms 3024 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 9872 KB Output is correct
2 Correct 210 ms 9984 KB Output is correct
3 Correct 223 ms 9840 KB Output is correct
4 Correct 254 ms 9840 KB Output is correct
5 Correct 222 ms 9840 KB Output is correct
6 Correct 14 ms 8992 KB Output is correct
7 Incorrect 376 ms 9696 KB Output isn't correct
8 Halted 0 ms 0 KB -