Submission #980216

#	Time	Username	Problem	Language	Result	Execution time	Memory
980216		vjudge1	Closing Time (IOI23_closing)	C++17	0 / 100	47 ms	5080 KiB

closing

#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repr(a,b,c) for(int a=b-1; a>c-1; a--)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define fi first
#define se second

using namespace std;

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W){
	if(N>50) return N;
	ll nxt[N]{}, prv[N]{};
	rep(i,0,N-1) nxt[i]=W[i], prv[i+1]=W[i];
	int ans=0;
	ll dis[N], disx[N], disy[N], p[N][3];
	disx[X]=0;
	disy[X]=0;
	rep(i,X+1,N) disx[i]=disx[i-1]+nxt[i-1];
	repr(i,X,0) disx[i]=disx[i+1]+prv[i+1];
	rep(i,Y+1,N) disy[i]=disy[i-1]+nxt[i-1];
	repr(i,Y,0) disy[i]=disy[i+1]+prv[i+1];
	rep(i,0,N) dis[i]=max(disx[i],disy[i]);
	rep(i,0,N){
		p[i][0]=dis[i];
		p[i][1]=disx[i];
		p[i][2]=disy[i];
		if(i){
			p[i][0]+=p[i-1][0];
			p[i][1]+=p[i-1][1];
			p[i][2]+=p[i-1][2];
		}
	}
	rep(i,0,N){
		rep(j,i,N){
			rep(k,i,N){
				rep(l,max(j,k),N){
					if(j<X || i>X || k>Y || l<Y) continue;
					ll sum=0;
					sum+=p[j][1]-p[i][1]+disx[i];
					sum+=p[l][2]-p[k][2]+disy[k];
					if(k<=j){
						sum+=p[j][0]-p[k][0]+dis[k];
						sum-=(p[j][1]-p[k][1]+disx[k]);
						sum-=(p[j][2]-p[k][2]+disy[k]);
					}
					if(K>=sum) ans=max(ans,j+1-i+l+1-k);
				}
			}
		}
	}
	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17