# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483413 | Lam_lai_cuoc_doi | Remittance (JOI19_remittance) | C++17 | 223 ms | 36296 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;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
void read(T &x)
{
x = 0;
register int c;
while ((c = getchar()) && (c > '9' || c < '0'))
;
for (; c >= '0' && c <= '9'; c = getchar())
x = x * 10 + c - '0';
}
constexpr bool typetest = 0;
constexpr int N = 1e6 + 5;
int n;
ll a[N], b[N];
void Read()
{
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i] >> b[i];
}
void Send(int pos, ll v)
{
a[pos] -= v * 2;
++pos;
if (pos > n)
pos = 1;
a[pos] += v;
}
void Solve()
{
while (1)
{
bool ok(1);
for (int i = 1; i <= n; ++i)
if (a[i] > b[i])
{
ll v = (a[i] - b[i]) / 2;
if (v == 0 && a[i] > 1)
Send(i, 1), ok = 0;
if (v > 0)
Send(i, v), ok = 0;
}
if (ok)
break;
}
for (int i = 1; i <= n; ++i)
if (a[i] != b[i])
{
cout << "No";
return;
}
cout << "Yes";
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t(1);
if (fopen(".INP", "r"))
{
freopen("and.inp", "r", stdin);
freopen("and.out", "w", stdout);
}
if (typetest)
cin >> t;
for (int _ = 1; _ <= t; ++_)
{
// cout << "Case #" << _ << ": ";
Read();
Solve();
}
// cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
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... |