oj.uz

답안 #710968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710968 2023-03-16T06:21:47 Z emptypringlescan Rainy Markets (CCO22_day1problem2) C++17
0 / 25
 591 ms 66400 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	long long cap[n],pop[n-1],um[n-1];
	for(int i=0; i<n; i++) cin >> cap[i];
	for(int i=0; i<n-1; i++) cin >> pop[i];
	for(int i=0; i<n-1; i++) cin >> um[i];
	bool cant=false;
	long long left=cap[0];
	for(int i=0; i<n-1; i++){
		long long peep=pop[i]-left-um[i];
		left=cap[i+1]-peep;
		if(left<0) cant=true;
	}
	if(cant){
		cout << "NO";
		return 0;
	}
	long long fill[n],buy[n-1];
	memset(fill,0,sizeof(fill));
	memset(buy,0,sizeof(buy));
	for(int i=0; i<n-1; i++){
		long long space=cap[i]-fill[i],peep=pop[i];
		if(space>=pop[i]){
			fill[i]+=pop[i];
			continue;
		}
		fill[i]=cap[i];
		peep-=space;
		if(peep<=cap[i+1]){
			fill[i+1]=peep;
			continue;
		}
		fill[i+1]=cap[i+1];
		peep-=cap[i+1];
		buy[i]=peep;
	}
	long long sludge=0;
	for(int i=n-1; i>=0; i--){
		if(buy[i]>um[i]){
			sludge+=buy[i]-um[i];
			buy[i]=um[i];
		}
		if(buy[i]<um[i]){
			if(um[i]-buy[i]>=sludge){
				buy[i]+=sludge;
				sludge=0;
			}
			else{
				sludge-=um[i]-buy[i];
				buy[i]=um[i];
			}
		}
		//assert(sludge<=cap[i]);
		sludge-=cap[i]-fill[i];
		sludge=max(sludge,0LL);
	}/*
	for(int i=0; i<n; i++) cout << fill[i] << ' ';
	cout << '\n';
	for(int i=0; i<n-1; i++) cout << buy[i] << ' ';
	cout << '\n';*/
	//assert(sludge==0);
	cout << "YES\n";
	long long cost=0,space=cap[0];
	for(int i=0; i<n-1; i++) cost+=buy[i];
	cout << cost << '\n';
	for(int i=0; i<n-1; i++){
		if(space<=pop[i]) cout << space << ' ';
		else cout << pop[i] << ' ';
		cout << buy[i] << ' ';
		if(pop[i]-space-buy[i]>0){
			cout << pop[i]-space-buy[i] << '\n';
			space=cap[i+1]-(pop[i]-space-buy[i]);
		}
		else{
			cout << 0 << '\n';
			space=cap[i+1];
		}
	}
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 205 ms 24192 KB Output is correct
5 Correct 271 ms 24564 KB Output is correct
6 Correct 199 ms 24196 KB Output is correct
7 Correct 239 ms 24760 KB Output is correct
8 Correct 4 ms 584 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 371 ms 45976 KB Output is correct
11 Correct 388 ms 47556 KB Output is correct
12 Correct 537 ms 60072 KB Output is correct
13 Correct 466 ms 54284 KB Output is correct
14 Correct 210 ms 24296 KB Output is correct
15 Correct 525 ms 65328 KB Output is correct
16 Correct 494 ms 64152 KB Output is correct
17 Correct 474 ms 63148 KB Output is correct
18 Correct 508 ms 62444 KB Output is correct
19 Correct 591 ms 65492 KB Output is correct
20 Correct 493 ms 62544 KB Output is correct
21 Correct 480 ms 65532 KB Output is correct
22 Correct 515 ms 59888 KB Output is correct
23 Correct 483 ms 63064 KB Output is correct
24 Correct 480 ms 65344 KB Output is correct
25 Correct 241 ms 26584 KB Output is correct
26 Correct 238 ms 28968 KB Output is correct
27 Correct 462 ms 63416 KB Output is correct
28 Correct 486 ms 61724 KB Output is correct
29 Correct 451 ms 63080 KB Output is correct
30 Correct 479 ms 66400 KB Output is correct
31 Correct 467 ms 63080 KB Output is correct
32 Correct 458 ms 63160 KB Output is correct
33 Incorrect 474 ms 61800 KB Integer -1295760 violates the range [0, 847577542]
34 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 205 ms 24192 KB Output is correct
5 Correct 271 ms 24564 KB Output is correct
6 Correct 199 ms 24196 KB Output is correct
7 Correct 239 ms 24760 KB Output is correct
8 Correct 4 ms 584 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 371 ms 45976 KB Output is correct
11 Correct 388 ms 47556 KB Output is correct
12 Correct 537 ms 60072 KB Output is correct
13 Correct 466 ms 54284 KB Output is correct
14 Correct 210 ms 24296 KB Output is correct
15 Correct 525 ms 65328 KB Output is correct
16 Correct 494 ms 64152 KB Output is correct
17 Correct 474 ms 63148 KB Output is correct
18 Correct 508 ms 62444 KB Output is correct
19 Correct 591 ms 65492 KB Output is correct
20 Correct 493 ms 62544 KB Output is correct
21 Correct 480 ms 65532 KB Output is correct
22 Correct 515 ms 59888 KB Output is correct
23 Correct 483 ms 63064 KB Output is correct
24 Correct 480 ms 65344 KB Output is correct
25 Correct 241 ms 26584 KB Output is correct
26 Correct 238 ms 28968 KB Output is correct
27 Correct 462 ms 63416 KB Output is correct
28 Correct 486 ms 61724 KB Output is correct
29 Correct 451 ms 63080 KB Output is correct
30 Correct 479 ms 66400 KB Output is correct
31 Correct 467 ms 63080 KB Output is correct
32 Correct 458 ms 63160 KB Output is correct
33 Incorrect 474 ms 61800 KB Integer -1295760 violates the range [0, 847577542]
34 Halted 0 ms 0 KB -