oj.uz

답안 #1099680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099680 2024-10-12T02:37:10 Z Math4Life2020 Rainy Markets (CCO22_day1problem2) C++17
0 / 25
 186 ms 45408 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using pii = pair<ll,ll>; using vi = vector<ll>;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	ll N; cin >> N;
	ll B[N]; ll P[N-1]; ll U[N-1];
	for (ll i=0;i<N;i++) {
		cin >> B[i];
	}
	for (ll i=0;i<(N-1);i++) {
		cin >> P[i];
	}
	for (ll i=0;i<(N-1);i++) {
		cin >> U[i];
	}
	ll xc = 0;
	for (ll i=0;i<(N-1);i++) {
		xc = max(xc+P[i]-U[i]-B[i],0LL);
		if (xc>B[i+1]) {
			cout << "NO\n"; exit(0);
		}
	}
	cout << "YES\n";
	ll x0[N]; ll xf[N]; ll v0[N];
	ll zmin0[N]; ll zmax0[N]; ll vzmin0[N];
	x0[0]=0; xf[0]=0; v0[0]=0;
	for (ll i=1;i<N;i++) {
		ll zmin = max(B[i-1]-xf[i-1],0LL);
		ll zmax = min(B[i-1]-x0[i-1],P[i-1]);
		ll xapp = min(xf[i-1],B[i-1]-zmin);
		ll vzmin = v0[i-1]+xf[i-1]-xapp;
		zmin0[i-1]=zmin; zmax0[i-1]=zmax; vzmin0[i-1]=vzmin;
		//cout << "zmin,zmax,vmin="<<zmin<<","<<zmax<<","<<vzmin<<"\n";
		zmax = min(zmax+U[i-1],P[i-1]);
		x0[i]=P[i-1]-zmax; xf[i]=P[i-1]-zmin;
		v0[i]=vzmin;
		x0[i]=max(x0[i],0LL);
		if (xf[i]>B[i]) {
			ll D = xf[i]-B[i];
			xf[i]-=D;
			v0[i]+=D;
		}
		//cout << "x0,xf,v0="<<x0[i]<<","<<xf[i]<<","<<v0[i]<<"\n";
		/*if (xf[i-1]+P[i-1]<=B[i-1]) {
			x0[i]=0; xf[i]=0; v0[i]=v0[i-1]; continue;
		}
		x0[i]=max(0LL,P[i-1]-B[i-1]+x0[i-1]-U[i-1]);
		xf[i]=P[i-1]-B[i-1]+x0[i-1];
		v0[i]=v0[i-1];
		if (xf[i]>B[i]) {
			ll D = xf[i]-B[i];
			xf[i]-=D;
			v0[i]+=D;
		}*/
	}
	cout << v0[N-1]<<"\n";
	ll ans0[N-1]; ll ans1[N-1]; ll ans2[N-1];
	ll xfv = xf[N-1];
	for (ll i=(N-2);i>=0;i--) {
		xfv = min(xfv,P[i]);
		ans2[i]=xfv;
		ll nleft=P[i]-xfv;
		ans0[i]=min(nleft,zmax0[i]);
		ans1[i]=nleft-ans0[i];
		xfv=B[i]-ans0[i];
	}
	for (int i=0;i<(N-1);i++) {
		cout << ans0[i] <<" "<<ans1[i] <<" "<<ans2[i]<<"\n";
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:29:5: warning: variable 'zmin0' set but not used [-Wunused-but-set-variable]
   29 |  ll zmin0[N]; ll zmax0[N]; ll vzmin0[N];
      |     ^~~~~
Main.cpp:29:31: warning: variable 'vzmin0' set but not used [-Wunused-but-set-variable]
   29 |  ll zmin0[N]; ll zmax0[N]; ll vzmin0[N];
      |                               ^~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 144 ms 39532 KB Output is correct
5 Correct 179 ms 45408 KB Output is correct
6 Correct 157 ms 39520 KB Output is correct
7 Correct 186 ms 45392 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Incorrect 2 ms 860 KB Integer 98237770449 violates the range [0, 411782356]
10 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Incorrect 0 ms 360 KB Integer 279 violates the range [0, 121]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Incorrect 0 ms 360 KB Integer 279 violates the range [0, 121]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 144 ms 39532 KB Output is correct
5 Correct 179 ms 45408 KB Output is correct
6 Correct 157 ms 39520 KB Output is correct
7 Correct 186 ms 45392 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Incorrect 2 ms 860 KB Integer 98237770449 violates the range [0, 411782356]
10 Halted 0 ms 0 KB -