oj.uz

Submission #743614

# Submission time Handle Problem Language Result Execution time Memory
743614 2023-05-17T14:39:35 Z flappybird Rainy Markets (CCO22_day1problem2) C++17
0 / 25
 1500 ms 61084 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 1001010
#define MAXS 20
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
ll B[MAX];
ll S[MAX];
ll P[MAX];
ll U[MAX];
ll add[MAX];
ll used[MAX];
ll cur[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	int i;
	for (i = 1; i <= N; i++) cin >> B[i], S[i] = S[i - 1] + B[i];
	for (i = 1; i < N; i++) cin >> P[i];
	for (i = 1; i < N; i++) cin >> U[i];
	ll ans = 0;
	for (i = 1; i <= N; i++) add[i] = min(U[i], P[i]), P[i] -= add[i], ans += add[i];
	for (i = 1; i < N; i++) {
		int j;
		ll mn = add[i];
		ll sum = 0;
		for (j = i; j >= 1; j--) {
			sum += used[j] + P[j];
			mn = min(mn, S[i + 1] - S[j - 1] - sum);
		}
		if (mn < 0) {
			cout << "NO" << ln;
			return 0;
		}
		used[i] = mn;
		ans -= mn;
	}
	cout << "YES" << ln;
	cout << ans << ln;
	for (i = 1; i < N; i++) {
		P[i] += used[i];
		ll left = min(P[i], B[i] - cur[i]);
		ll right = P[i] - left;
		cout << left << bb << add[i] - used[i] << bb << right << ln;
		cur[i + 1] += right;
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 225 ms 53592 KB Output is correct
5 Correct 258 ms 61084 KB Output is correct
6 Execution timed out 1561 ms 55512 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
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 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 225 ms 53592 KB Output is correct
5 Correct 258 ms 61084 KB Output is correct
6 Execution timed out 1561 ms 55512 KB Time limit exceeded
7 Halted 0 ms 0 KB -