답안 #983890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983890	2024-05-16T07:46:55 Z	LucaIlie	Hacker (BOI15_hac)	C++17	40 / 100	1000 ms	2908 KB

hac

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5e5;
int n, v[MAX_N + 1], sp[MAX_N + 1];

int sum( int l, int r ) {
    if ( l > n )
        l -= n;
    if ( r > n )
        r -= n;

    if ( l > r )
        return sp[n] - sp[l  - 1] + sp[r];
    return sp[r] - sp[l - 1];
}

int main() {
    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        cin >> v[i];
        sp[i] = sp[i - 1] + v[i];
    }

    int maxx = 0;
    for ( int i = 1; i <= n; i++ ) {
        int minn = 1e9;
        for ( int l = 0; l < (n + 1) / 2; l++ )
            minn = min( minn, sum( i + l, i + l + (n + 1) / 2 - 1 ) );
        maxx = max( maxx, minn );
    }

    cout << maxx;

    return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2488 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2500 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2488 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2500 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	2 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	9 ms	2396 KB	Output is correct
23	Correct	24 ms	2540 KB	Output is correct
24	Correct	9 ms	2396 KB	Output is correct
25	Correct	24 ms	2396 KB	Output is correct
26	Correct	25 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2492 KB	Output is correct
30	Correct	24 ms	2396 KB	Output is correct
31	Correct	28 ms	2396 KB	Output is correct

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	24 ms	2536 KB	Output is correct
4	Execution timed out	1053 ms	2908 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2488 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2500 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	2 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	9 ms	2396 KB	Output is correct
23	Correct	24 ms	2540 KB	Output is correct
24	Correct	9 ms	2396 KB	Output is correct
25	Correct	24 ms	2396 KB	Output is correct
26	Correct	25 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2492 KB	Output is correct
30	Correct	24 ms	2396 KB	Output is correct
31	Correct	28 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	24 ms	2536 KB	Output is correct
35	Execution timed out	1053 ms	2908 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-