# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710914 | penguin133 | Rainy Markets (CCO22_day1problem2) | C++17 | 535 ms | 61144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 n, A[1000005], B[1000005], C[1000005];
pi ans[1000005];
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];
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 = B[i];
A[i+1] -= B[i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |