Submission #723560

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
723560	2023-04-14T05:07:49 Z	sunnat	Hacker (BOI15_hac)	C++14	100 / 100	346 ms	35540 KB

hac

#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
using namespace std;
#define int long long
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m;
    cin >> n;
    m = (n+1)/2;
    vector<int>a(3*n+1), s(3*n+1);
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
        a[i+n] = a[i+2*n] = a[i];
    }
    multiset<int> ms;
    for(int i = 1; i < m; i ++)
        s[i] = s[i-1] + a[i];
    for(int i = m; i < 2*m; i ++){
        s[i] = s[i-1] - a[i-m] + a[i];
        ms.insert(s[i]);
    }
    int res = *ms.begin();
    for(int i = m; i < n + m; i ++){
        ms.erase(ms.find(s[i]));
        s[i+m] = s[i+m-1] - a[i] + a[i+m];
        ms.insert(s[i+m]);
        res = max(res, *ms.begin());
    }

    cout << res;
    return 0;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	2 ms	596 KB	Output is correct
31	Correct	3 ms	596 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	596 KB	Output is correct
4	Correct	31 ms	5844 KB	Output is correct
5	Correct	128 ms	14400 KB	Output is correct
6	Correct	136 ms	17864 KB	Output is correct
7	Correct	156 ms	21456 KB	Output is correct
8	Correct	346 ms	35536 KB	Output is correct

Subtask #4

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	2 ms	596 KB	Output is correct
31	Correct	3 ms	596 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	596 KB	Output is correct
35	Correct	31 ms	5844 KB	Output is correct
36	Correct	128 ms	14400 KB	Output is correct
37	Correct	136 ms	17864 KB	Output is correct
38	Correct	156 ms	21456 KB	Output is correct
39	Correct	346 ms	35536 KB	Output is correct
40	Correct	4 ms	980 KB	Output is correct
41	Correct	10 ms	1712 KB	Output is correct
42	Correct	15 ms	2444 KB	Output is correct
43	Correct	101 ms	14400 KB	Output is correct
44	Correct	324 ms	35448 KB	Output is correct
45	Correct	41 ms	7252 KB	Output is correct
46	Correct	142 ms	21448 KB	Output is correct
47	Correct	327 ms	35536 KB	Output is correct
48	Correct	237 ms	35532 KB	Output is correct
49	Correct	207 ms	35540 KB	Output is correct
50	Correct	216 ms	35532 KB	Output is correct