oj.uz

Submission #180287

# Submission time Handle Problem Language Result Execution time Memory
180287 2020-01-08T15:28:24 Z MvC Hacker (BOI15_hac) C++11
100 / 100
 314 ms 8952 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=5e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,st[4*nmax],a[nmax],cur,tot,rs,j;
int tr(int x)
{
	x+=n;
	x%=n;
	if(!x)x=n;
	return x;
}
void upd(int x,int l,int r,int p,int v)
{
	if(l==r)
	{
		st[x]=v;
		return;
	}
	int mid=(l+r)/2;
	if(p<=mid)upd(2*x,l,mid,p,v);
	else upd(2*x+1,mid+1,r,p,v);
	st[x]=max(st[2*x],st[2*x+1]);
}
int qry(int x,int l,int r,int tl,int tr)
{
	if(tl>tr || tl>n || tr>n || tl<1 || tr<1)return 0;
	if(l>tr || tl>r)return 0;
	if(tl<=l && r<=tr)return st[x];
	int mid=(l+r)/2;
	return max(qry(2*x,l,mid,tl,tr),qry(2*x+1,mid+1,r,tl,tr));
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)cin>>a[i],tot+=a[i];
	for(i=1;i<=n/2;i++)cur+=a[i];
	for(j=1;j<=n;j++,i++)
	{
		i=tr(i);
		upd(1,1,n,j,cur);
		cur-=a[tr(i-n/2)];
		cur+=a[tr(i)];
	}
	for(i=1;i<=n;i++)
	{
		//cout<<i<<" "<<1<<" "<<i-n/2<<" "<<i+1<<" "<<tr(i-n/2)<<endl;
		cur=qry(1,1,n,1,i-n/2);
		if(i+1<=tr(i-n/2))cur=max(cur,qry(1,1,n,i+1,tr(i-n/2)));
		else if(i+1>tr(i-n/2))cur=max(cur,max(qry(1,1,n,i+1,n),qry(1,1,n,1,tr(i-n/2))));
		rs=max(rs,tot-cur);
	}                      
	cout<<rs<<endl;                                                                                                                                                                                                                                                                                       
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 0 ms 376 KB Output is correct
4 Correct 46 ms 1656 KB Output is correct
5 Correct 115 ms 3192 KB Output is correct
6 Correct 149 ms 3432 KB Output is correct
7 Correct 185 ms 5624 KB Output is correct
8 Correct 314 ms 6460 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 4 ms 376 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 5 ms 504 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 4 ms 476 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 0 ms 376 KB Output is correct
35 Correct 46 ms 1656 KB Output is correct
36 Correct 115 ms 3192 KB Output is correct
37 Correct 149 ms 3432 KB Output is correct
38 Correct 185 ms 5624 KB Output is correct
39 Correct 314 ms 6460 KB Output is correct
40 Correct 9 ms 504 KB Output is correct
41 Correct 12 ms 760 KB Output is correct
42 Correct 18 ms 888 KB Output is correct
43 Correct 118 ms 4088 KB Output is correct
44 Correct 313 ms 8604 KB Output is correct
45 Correct 56 ms 2168 KB Output is correct
46 Correct 182 ms 7032 KB Output is correct
47 Correct 312 ms 8860 KB Output is correct
48 Correct 311 ms 8952 KB Output is correct
49 Correct 304 ms 8056 KB Output is correct
50 Correct 304 ms 7928 KB Output is correct