| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298289 | daotuankhoi | Remittance (JOI19_remittance) | C++20 | 278 ms | 8260 KiB |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
template <class T> bool ckmax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <class T> bool ckmin(T &a, T b) { return a > b ? (a = b, true) : false; }
const int MAXN = 1e6 + 5;
int a[MAXN], b[MAXN];
int main() {
#define NAME "test"
if (fopen(NAME".inp", "r")) {
freopen(NAME".inp", "r", stdin);
freopen(NAME".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n; cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int t = 50;
while (t--) {
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
int val = min(a[i] / 2, (a[i] - b[i] + 1) / 2);
a[i] -= val * 2;
a[(i + 1) % n] += val;
}
}
}
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) return cout << "No\n", 0;
}
cout << "Yes\n";
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... | ||||
