oj.uz

Submission #710908

# Submission time Handle Problem Language Result Execution time Memory
710908 2023-03-16T04:38:12 Z pavement Rainy Markets (CCO22_day1problem2) C++17
5 / 25
 466 ms 123824 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, ans, srb, B[1000005], P[1000005], U[1000005], V[1000005], ml[1000005], mr[1000005], OP[1000005];
vector<iii> rb;

int fill(int &a, int &b) {
	if (a >= b) {
		int tmp = b;
		a -= b;
		b = 0;
		return tmp;
	} else {
		int tmp = a;
		b -= a;
		a = 0;
		return tmp;
	}
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> B[i];
	}
	for (int i = 1; i < N; i++) {
		cin >> P[i];
		OP[i] = P[i];
	}
	for (int i = 1; i < N; i++) {
		cin >> U[i];
		int tmp = P[i];
		P[i] = max(0ll, P[i] - U[i]);
		V[i] = tmp - P[i];
	}
	for (int i = 1; i < N; i++) {
		ml[i] += fill(B[i], P[i]);
		mr[i] += fill(B[i + 1], P[i]);
		if (P[i]) {
			if (srb < P[i]) return cout << "NO\n", 0;
			int cnt = 0;
			while (cnt < P[i]) {
				auto [v, idx, dir] = rb.back();
				if (cnt + v > P[i]) {
					if (dir) mr[idx] -= P[i] - cnt;
					else ml[idx] -= P[i] - cnt;
					V[idx] += P[i] - cnt;
					g0(rb.back()) -= P[i] - cnt;
					srb -= P[i] - cnt;
					cnt = P[i];
				} else {
					if (dir) mr[idx] -= v;
					else ml[idx] -= v;
					V[idx] += v;
					cnt += v;
					srb -= v;
					rb.ppb();
				}
			}
			P[i] = 0;
		}
		int tmp1 = fill(B[i], V[i]);
		int tmp2 = fill(B[i + 1], V[i]);
		ml[i] += tmp1;
		mr[i] += tmp2;
		srb += tmp1 + tmp2;
		rb.eb(tmp1, i, 0);
		rb.eb(tmp2, i, 1);
		if (B[i]) {
			rb.clear();
		}
	}
	for (int i = 1; i < N; i++) {
		ans += V[i];
	}
	cout << "YES\n" << ans << '\n';
	for (int i = 1; i < N; i++) {
		assert(ml[i] + V[i] + mr[i] == OP[i]);
		cout << ml[i] << ' ' << V[i] << ' ' << mr[i] << '\n';
	}
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 191 ms 39440 KB Output is correct
5 Correct 222 ms 39448 KB Output is correct
6 Correct 235 ms 102268 KB Output is correct
7 Correct 271 ms 102160 KB Output is correct
8 Correct 2 ms 916 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 320 ms 61260 KB Output is correct
11 Correct 342 ms 62720 KB Output is correct
12 Correct 424 ms 74784 KB Output is correct
13 Correct 438 ms 69196 KB Output is correct
14 Correct 182 ms 39352 KB Output is correct
15 Correct 430 ms 78260 KB Output is correct
16 Correct 433 ms 77548 KB Output is correct
17 Correct 431 ms 77692 KB Output is correct
18 Correct 433 ms 77092 KB Output is correct
19 Correct 435 ms 77036 KB Output is correct
20 Correct 435 ms 76812 KB Output is correct
21 Correct 443 ms 76564 KB Output is correct
22 Correct 442 ms 74048 KB Output is correct
23 Correct 432 ms 80636 KB Output is correct
24 Correct 423 ms 75936 KB Output is correct
25 Correct 221 ms 43176 KB Output is correct
26 Correct 225 ms 39464 KB Output is correct
27 Correct 426 ms 78844 KB Output is correct
28 Correct 441 ms 74824 KB Output is correct
29 Correct 466 ms 123824 KB Output is correct
30 Correct 430 ms 79224 KB Output is correct
31 Correct 427 ms 75512 KB Output is correct
32 Correct 435 ms 78656 KB Output is correct
33 Correct 238 ms 39448 KB Output is correct
34 Correct 227 ms 41416 KB Output is correct
35 Correct 221 ms 39372 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 1 ms 596 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 1 ms 596 KB Execution killed with signal 6
3 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 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 191 ms 39440 KB Output is correct
5 Correct 222 ms 39448 KB Output is correct
6 Correct 235 ms 102268 KB Output is correct
7 Correct 271 ms 102160 KB Output is correct
8 Correct 2 ms 916 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 320 ms 61260 KB Output is correct
11 Correct 342 ms 62720 KB Output is correct
12 Correct 424 ms 74784 KB Output is correct
13 Correct 438 ms 69196 KB Output is correct
14 Correct 182 ms 39352 KB Output is correct
15 Correct 430 ms 78260 KB Output is correct
16 Correct 433 ms 77548 KB Output is correct
17 Correct 431 ms 77692 KB Output is correct
18 Correct 433 ms 77092 KB Output is correct
19 Correct 435 ms 77036 KB Output is correct
20 Correct 435 ms 76812 KB Output is correct
21 Correct 443 ms 76564 KB Output is correct
22 Correct 442 ms 74048 KB Output is correct
23 Correct 432 ms 80636 KB Output is correct
24 Correct 423 ms 75936 KB Output is correct
25 Correct 221 ms 43176 KB Output is correct
26 Correct 225 ms 39464 KB Output is correct
27 Correct 426 ms 78844 KB Output is correct
28 Correct 441 ms 74824 KB Output is correct
29 Correct 466 ms 123824 KB Output is correct
30 Correct 430 ms 79224 KB Output is correct
31 Correct 427 ms 75512 KB Output is correct
32 Correct 435 ms 78656 KB Output is correct
33 Correct 238 ms 39448 KB Output is correct
34 Correct 227 ms 41416 KB Output is correct
35 Correct 221 ms 39372 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Runtime error 1 ms 596 KB Execution killed with signal 6
38 Halted 0 ms 0 KB -