# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
367535 | BartolM | Remittance (JOI19_remittance) | C++17 | 314 ms | 36712 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 X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
const int INF=0x3f3f3f3f;
const int N=1e6+5;
int n;
ll A[N], B[N];
ll suma, sumb;
int main() {
scanf("%d", &n);
for (int i=0; i<n; ++i) {
scanf("%lld %lld", A+i, B+i);
sumb+=B[i]; suma+=A[i];
}
if (!sumb) {
printf("%s\n", suma ? "No" : "Yes");
return 0;
}
int ok=1;
while (ok) {
ok=0;
for (int i=0; i<n; ++i) {
if (A[i]<=B[i]) continue;
ok=1;
ll br=(A[i]-B[i]+1)/2;
A[(i+1)%n]+=br;
A[i]-=2*br;
}
}
int res=1;
for (int i=0; i<n; ++i) res&=A[i]==B[i];
printf("%s\n", res ? "Yes" : "No");
return 0;
}
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... |