Submission #652366

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
652366	2022-10-22T09:39:31 Z	beaconmc	Hacker (BOI15_hac)	PyPy 3	40 / 100	1000 ms	229176 KB

hac

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

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	18272 KB	Output is correct
2	Correct	35 ms	18128 KB	Output is correct
3	Correct	34 ms	18228 KB	Output is correct
4	Correct	40 ms	18216 KB	Output is correct
5	Correct	43 ms	19072 KB	Output is correct
6	Correct	44 ms	18840 KB	Output is correct
7	Correct	48 ms	20056 KB	Output is correct
8	Correct	46 ms	20000 KB	Output is correct
9	Correct	51 ms	20024 KB	Output is correct
10	Correct	47 ms	19876 KB	Output is correct
11	Correct	46 ms	20028 KB	Output is correct
12	Correct	47 ms	20012 KB	Output is correct
13	Correct	35 ms	18228 KB	Output is correct
14	Correct	34 ms	18232 KB	Output is correct
15	Correct	37 ms	18212 KB	Output is correct
16	Correct	52 ms	19996 KB	Output is correct
17	Correct	48 ms	20008 KB	Output is correct
18	Correct	50 ms	19988 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	18272 KB	Output is correct
2	Correct	35 ms	18128 KB	Output is correct
3	Correct	34 ms	18228 KB	Output is correct
4	Correct	40 ms	18216 KB	Output is correct
5	Correct	43 ms	19072 KB	Output is correct
6	Correct	44 ms	18840 KB	Output is correct
7	Correct	48 ms	20056 KB	Output is correct
8	Correct	46 ms	20000 KB	Output is correct
9	Correct	51 ms	20024 KB	Output is correct
10	Correct	47 ms	19876 KB	Output is correct
11	Correct	46 ms	20028 KB	Output is correct
12	Correct	47 ms	20012 KB	Output is correct
13	Correct	35 ms	18228 KB	Output is correct
14	Correct	34 ms	18232 KB	Output is correct
15	Correct	37 ms	18212 KB	Output is correct
16	Correct	52 ms	19996 KB	Output is correct
17	Correct	48 ms	20008 KB	Output is correct
18	Correct	50 ms	19988 KB	Output is correct
19	Correct	53 ms	22812 KB	Output is correct
20	Correct	78 ms	31228 KB	Output is correct
21	Correct	65 ms	28072 KB	Output is correct
22	Correct	302 ms	97552 KB	Output is correct
23	Correct	683 ms	217976 KB	Output is correct
24	Correct	302 ms	97720 KB	Output is correct
25	Correct	706 ms	218068 KB	Output is correct
26	Correct	706 ms	218112 KB	Output is correct
27	Correct	35 ms	18220 KB	Output is correct
28	Correct	37 ms	18196 KB	Output is correct
29	Correct	34 ms	18220 KB	Output is correct
30	Correct	670 ms	217780 KB	Output is correct
31	Correct	678 ms	218392 KB	Output is correct

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	18228 KB	Output is correct
2	Correct	49 ms	20296 KB	Output is correct
3	Correct	690 ms	218064 KB	Output is correct
4	Execution timed out	1104 ms	229176 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	18272 KB	Output is correct
2	Correct	35 ms	18128 KB	Output is correct
3	Correct	34 ms	18228 KB	Output is correct
4	Correct	40 ms	18216 KB	Output is correct
5	Correct	43 ms	19072 KB	Output is correct
6	Correct	44 ms	18840 KB	Output is correct
7	Correct	48 ms	20056 KB	Output is correct
8	Correct	46 ms	20000 KB	Output is correct
9	Correct	51 ms	20024 KB	Output is correct
10	Correct	47 ms	19876 KB	Output is correct
11	Correct	46 ms	20028 KB	Output is correct
12	Correct	47 ms	20012 KB	Output is correct
13	Correct	35 ms	18228 KB	Output is correct
14	Correct	34 ms	18232 KB	Output is correct
15	Correct	37 ms	18212 KB	Output is correct
16	Correct	52 ms	19996 KB	Output is correct
17	Correct	48 ms	20008 KB	Output is correct
18	Correct	50 ms	19988 KB	Output is correct
19	Correct	53 ms	22812 KB	Output is correct
20	Correct	78 ms	31228 KB	Output is correct
21	Correct	65 ms	28072 KB	Output is correct
22	Correct	302 ms	97552 KB	Output is correct
23	Correct	683 ms	217976 KB	Output is correct
24	Correct	302 ms	97720 KB	Output is correct
25	Correct	706 ms	218068 KB	Output is correct
26	Correct	706 ms	218112 KB	Output is correct
27	Correct	35 ms	18220 KB	Output is correct
28	Correct	37 ms	18196 KB	Output is correct
29	Correct	34 ms	18220 KB	Output is correct
30	Correct	670 ms	217780 KB	Output is correct
31	Correct	678 ms	218392 KB	Output is correct
32	Correct	34 ms	18228 KB	Output is correct
33	Correct	49 ms	20296 KB	Output is correct
34	Correct	690 ms	218064 KB	Output is correct
35	Execution timed out	1104 ms	229176 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-