Submission #652369

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
652369	2022-10-22T09:59:27 Z	beaconmc	Hacker (BOI15_hac)	PyPy 3	0 / 100	43 ms	18728 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[0]]
ans = -1
sus = set()
for i in range(k): sus.add(sussies[i])
ans = max(ans, min(sus))
for i in range(1,len(sussies)-k):
    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

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	18220 KB	Output is correct
2	Correct	35 ms	18180 KB	Output is correct
3	Correct	34 ms	18144 KB	Output is correct
4	Correct	39 ms	18200 KB	Output is correct
5	Correct	38 ms	18656 KB	Output is correct
6	Correct	37 ms	18600 KB	Output is correct
7	Correct	40 ms	18664 KB	Output is correct
8	Correct	43 ms	18716 KB	Output is correct
9	Correct	39 ms	18636 KB	Output is correct
10	Correct	37 ms	18728 KB	Output is correct
11	Correct	38 ms	18652 KB	Output is correct
12	Incorrect	40 ms	18728 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	18220 KB	Output is correct
2	Correct	35 ms	18180 KB	Output is correct
3	Correct	34 ms	18144 KB	Output is correct
4	Correct	39 ms	18200 KB	Output is correct
5	Correct	38 ms	18656 KB	Output is correct
6	Correct	37 ms	18600 KB	Output is correct
7	Correct	40 ms	18664 KB	Output is correct
8	Correct	43 ms	18716 KB	Output is correct
9	Correct	39 ms	18636 KB	Output is correct
10	Correct	37 ms	18728 KB	Output is correct
11	Correct	38 ms	18652 KB	Output is correct
12	Incorrect	40 ms	18728 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	33 ms	18124 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	18220 KB	Output is correct
2	Correct	35 ms	18180 KB	Output is correct
3	Correct	34 ms	18144 KB	Output is correct
4	Correct	39 ms	18200 KB	Output is correct
5	Correct	38 ms	18656 KB	Output is correct
6	Correct	37 ms	18600 KB	Output is correct
7	Correct	40 ms	18664 KB	Output is correct
8	Correct	43 ms	18716 KB	Output is correct
9	Correct	39 ms	18636 KB	Output is correct
10	Correct	37 ms	18728 KB	Output is correct
11	Correct	38 ms	18652 KB	Output is correct
12	Incorrect	40 ms	18728 KB	Output isn't correct
13	Halted	0 ms	0 KB	-