Submission #907348

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
907348	2024-01-15T11:58:39 Z	Mathias	Hacker (BOI15_hac)	C++14	100 / 100	274 ms	26712 KB

hac

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 1e6+7;
ll pref[MAXN];
ll t[MAXN];
multiset<ll> ms;
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ll n,r1,r2,k,r=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>t[i];
		pref[i]=pref[i-1]+t[i];
	}
	for(int i=n+1;i<=2*n;i++) pref[i]=pref[i-1]+t[i-n];
	for(int i=1;i<=(n+1)/2;i++){
		ms.insert(pref[i+(n+1)/2-1]-pref[i-1]);
	} 
	for(int i=1;i<=n;i++){
		k=i+(n+1)/2;
		ms.erase(ms.find(pref[k-1]-pref[i-1]));
		ms.insert(pref[k+(n+1)/2-1]-pref[k-1]);
		r=max(r,*ms.begin());
	}
	cout<<r<<'\n';
	return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:10:7: warning: unused variable 'r1' [-Wunused-variable]
   10 |  ll n,r1,r2,k,r=0;
      |       ^~
hac.cpp:10:10: warning: unused variable 'r2' [-Wunused-variable]
   10 |  ll n,r1,r2,k,r=0;
      |          ^~

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	2 ms	604 KB	Output is correct
4	Correct	26 ms	7004 KB	Output is correct
5	Correct	81 ms	12024 KB	Output is correct
6	Correct	102 ms	12968 KB	Output is correct
7	Correct	152 ms	18476 KB	Output is correct
8	Correct	274 ms	26708 KB	Output is correct

Subtask #4

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	2 ms	604 KB	Output is correct
26	Correct	2 ms	604 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	26 ms	7004 KB	Output is correct
36	Correct	81 ms	12024 KB	Output is correct
37	Correct	102 ms	12968 KB	Output is correct
38	Correct	152 ms	18476 KB	Output is correct
39	Correct	274 ms	26708 KB	Output is correct
40	Correct	3 ms	860 KB	Output is correct
41	Correct	6 ms	1372 KB	Output is correct
42	Correct	10 ms	3932 KB	Output is correct
43	Correct	83 ms	12904 KB	Output is correct
44	Correct	274 ms	26452 KB	Output is correct
45	Correct	35 ms	7772 KB	Output is correct
46	Correct	122 ms	19540 KB	Output is correct
47	Correct	245 ms	26452 KB	Output is correct
48	Correct	181 ms	26712 KB	Output is correct
49	Correct	177 ms	25896 KB	Output is correct
50	Correct	188 ms	25816 KB	Output is correct