oj.uz

Submission #710977

# Submission time Handle Problem Language Result Execution time Memory
710977 2023-03-16T06:29:29 Z penguin133 Rainy Markets (CCO22_day1problem2) C++17
10 / 25
 493 ms 73440 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int A[1000005], B[1000005], C[1000005], n;
pii ans[1000005];
int fin = 0;
void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> A[i];
	for(int i=1;i<n;i++)cin >> B[i];
	for(int i=1;i<n;i++)cin >> C[i];
	if(n > 2000){
		for(int i=1;i<n;i++){
			ans[i].fi = min(A[i], B[i]);
			B[i] -= min(B[i], A[i]);
			if(B[i] > A[i+1]){
				cout << "NO\n";
				return;
			}
			ans[i].se.se = B[i];
			A[i+1] -= B[i];
		}
		cout << "YES\n 0\n";
		for(int i=1;i<n;i++)cout << ans[i].fi << ' ' << 0 << ' ' << ans[i].se.se << '\n';
		return;
	}
	for(int i=1;i<n;i++){
		int x = min(B[i], A[i]);
		ans[i].fi = x;
		B[i] -= x;
		A[i] -= x;
		x = min(B[i], A[i+1]);
		ans[i].se.se = x;
		B[i] -= x;
		A[i+1] -= x;
		for(int j=i;j>=1;j--){
			if(!B[i])break;
			x = min(B[i], C[j]);
			C[j] -= x;
			B[i] -= x;
			ans[j].se.fi += x;
			fin += x;
			for(int k=j;k<i;k++)ans[k].se.se -= x, ans[k+1].fi += x;
		}
		if(B[i]){
			cout << "NO\n";
			return;
		}
	}
	for(int i=1;i<=n;i++)if(ans[i].se.se < 0){cout << "NO"; return;}
	cout << "YES\n" << fin << '\n';
	for(int i=1;i<n;i++)cout << ans[i].fi << ' ' << ans[i].se.fi << ' ' << ans[i].se.se << '\n';
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

Main.cpp:65:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   65 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 207 ms 23964 KB Output is correct
5 Correct 223 ms 24540 KB Output is correct
6 Correct 206 ms 47544 KB Output is correct
7 Correct 240 ms 49388 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 344 ms 54616 KB Output is correct
11 Correct 349 ms 56228 KB Output is correct
12 Correct 463 ms 69352 KB Output is correct
13 Correct 448 ms 62796 KB Output is correct
14 Correct 182 ms 24800 KB Output is correct
15 Correct 477 ms 73440 KB Output is correct
16 Correct 469 ms 72996 KB Output is correct
17 Correct 466 ms 72332 KB Output is correct
18 Correct 462 ms 71504 KB Output is correct
19 Correct 453 ms 72784 KB Output is correct
20 Correct 477 ms 71228 KB Output is correct
21 Correct 476 ms 72620 KB Output is correct
22 Correct 438 ms 68524 KB Output is correct
23 Correct 439 ms 71556 KB Output is correct
24 Correct 468 ms 71228 KB Output is correct
25 Correct 242 ms 27724 KB Output is correct
26 Correct 260 ms 26820 KB Output is correct
27 Correct 463 ms 71592 KB Output is correct
28 Correct 493 ms 69976 KB Output is correct
29 Correct 439 ms 71372 KB Output is correct
30 Correct 465 ms 72056 KB Output is correct
31 Correct 450 ms 70716 KB Output is correct
32 Correct 484 ms 71336 KB Output is correct
33 Correct 233 ms 26044 KB Output is correct
34 Correct 251 ms 30164 KB Output is correct
35 Correct 239 ms 27448 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 396 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 472 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 396 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 480 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 476 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 472 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 396 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 472 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 396 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 480 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 476 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 472 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Incorrect 2 ms 468 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 207 ms 23964 KB Output is correct
5 Correct 223 ms 24540 KB Output is correct
6 Correct 206 ms 47544 KB Output is correct
7 Correct 240 ms 49388 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 344 ms 54616 KB Output is correct
11 Correct 349 ms 56228 KB Output is correct
12 Correct 463 ms 69352 KB Output is correct
13 Correct 448 ms 62796 KB Output is correct
14 Correct 182 ms 24800 KB Output is correct
15 Correct 477 ms 73440 KB Output is correct
16 Correct 469 ms 72996 KB Output is correct
17 Correct 466 ms 72332 KB Output is correct
18 Correct 462 ms 71504 KB Output is correct
19 Correct 453 ms 72784 KB Output is correct
20 Correct 477 ms 71228 KB Output is correct
21 Correct 476 ms 72620 KB Output is correct
22 Correct 438 ms 68524 KB Output is correct
23 Correct 439 ms 71556 KB Output is correct
24 Correct 468 ms 71228 KB Output is correct
25 Correct 242 ms 27724 KB Output is correct
26 Correct 260 ms 26820 KB Output is correct
27 Correct 463 ms 71592 KB Output is correct
28 Correct 493 ms 69976 KB Output is correct
29 Correct 439 ms 71372 KB Output is correct
30 Correct 465 ms 72056 KB Output is correct
31 Correct 450 ms 70716 KB Output is correct
32 Correct 484 ms 71336 KB Output is correct
33 Correct 233 ms 26044 KB Output is correct
34 Correct 251 ms 30164 KB Output is correct
35 Correct 239 ms 27448 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 2 ms 396 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 2 ms 472 KB Output is correct
53 Correct 2 ms 468 KB Output is correct
54 Correct 1 ms 396 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 480 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 476 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 1 ms 468 KB Output is correct
66 Correct 1 ms 460 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 472 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Incorrect 2 ms 468 KB Output isn't correct
74 Halted 0 ms 0 KB -