Submission #652370

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
652370	2022-10-22T10:00:54 Z	beaconmc	Hacker (BOI15_hac)	PyPy 3	20 / 100	1000 ms	32720 KB

hac

n = int(input())
lis = list(map(int, input().split()))
sussies = []
k =(n+1)//2
lis = lis + lis
cur = 0
for i in range(k):
        cur += lis[i]
sussies.append(cur)

for i in range(1,n):
    cur -= lis[i-1]
    cur += lis[i+k-1]
    sussies.append(cur)
sussies = sussies + sussies
ans = -1
sus = set()
for i in range(k): sus.add(sussies[i])
ans = max(ans, min(sus))
for i in range(1,n+1):
    if sussies[i-1] in sus: sus.remove(sussies[i-1])
    sus.add(sussies[i+k-1])
    ans = max(ans, min(sus))
print(ans)

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	18220 KB	Output is correct
2	Correct	34 ms	18188 KB	Output is correct
3	Correct	37 ms	18116 KB	Output is correct
4	Correct	37 ms	18176 KB	Output is correct
5	Correct	41 ms	18652 KB	Output is correct
6	Correct	40 ms	18684 KB	Output is correct
7	Correct	41 ms	18692 KB	Output is correct
8	Correct	45 ms	18680 KB	Output is correct
9	Correct	40 ms	18708 KB	Output is correct
10	Correct	41 ms	18652 KB	Output is correct
11	Correct	41 ms	18728 KB	Output is correct
12	Correct	50 ms	18680 KB	Output is correct
13	Correct	36 ms	18200 KB	Output is correct
14	Correct	37 ms	18292 KB	Output is correct
15	Correct	35 ms	18136 KB	Output is correct
16	Correct	43 ms	18752 KB	Output is correct
17	Correct	43 ms	18724 KB	Output is correct
18	Correct	45 ms	18648 KB	Output is correct

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	18220 KB	Output is correct
2	Correct	34 ms	18188 KB	Output is correct
3	Correct	37 ms	18116 KB	Output is correct
4	Correct	37 ms	18176 KB	Output is correct
5	Correct	41 ms	18652 KB	Output is correct
6	Correct	40 ms	18684 KB	Output is correct
7	Correct	41 ms	18692 KB	Output is correct
8	Correct	45 ms	18680 KB	Output is correct
9	Correct	40 ms	18708 KB	Output is correct
10	Correct	41 ms	18652 KB	Output is correct
11	Correct	41 ms	18728 KB	Output is correct
12	Correct	50 ms	18680 KB	Output is correct
13	Correct	36 ms	18200 KB	Output is correct
14	Correct	37 ms	18292 KB	Output is correct
15	Correct	35 ms	18136 KB	Output is correct
16	Correct	43 ms	18752 KB	Output is correct
17	Correct	43 ms	18724 KB	Output is correct
18	Correct	45 ms	18648 KB	Output is correct
19	Correct	43 ms	18788 KB	Output is correct
20	Correct	48 ms	18852 KB	Output is correct
21	Correct	49 ms	18832 KB	Output is correct
22	Correct	70 ms	20240 KB	Output is correct
23	Incorrect	97 ms	20652 KB	Output isn't correct
24	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	18228 KB	Output is correct
2	Correct	40 ms	18864 KB	Output is correct
3	Correct	97 ms	20744 KB	Output is correct
4	Execution timed out	1091 ms	32720 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	18220 KB	Output is correct
2	Correct	34 ms	18188 KB	Output is correct
3	Correct	37 ms	18116 KB	Output is correct
4	Correct	37 ms	18176 KB	Output is correct
5	Correct	41 ms	18652 KB	Output is correct
6	Correct	40 ms	18684 KB	Output is correct
7	Correct	41 ms	18692 KB	Output is correct
8	Correct	45 ms	18680 KB	Output is correct
9	Correct	40 ms	18708 KB	Output is correct
10	Correct	41 ms	18652 KB	Output is correct
11	Correct	41 ms	18728 KB	Output is correct
12	Correct	50 ms	18680 KB	Output is correct
13	Correct	36 ms	18200 KB	Output is correct
14	Correct	37 ms	18292 KB	Output is correct
15	Correct	35 ms	18136 KB	Output is correct
16	Correct	43 ms	18752 KB	Output is correct
17	Correct	43 ms	18724 KB	Output is correct
18	Correct	45 ms	18648 KB	Output is correct
19	Correct	43 ms	18788 KB	Output is correct
20	Correct	48 ms	18852 KB	Output is correct
21	Correct	49 ms	18832 KB	Output is correct
22	Correct	70 ms	20240 KB	Output is correct
23	Incorrect	97 ms	20652 KB	Output isn't correct
24	Halted	0 ms	0 KB	-