Submission #312234

#TimeUsernameProblemLanguageResultExecution timeMemory
312234TemmieRemittance (JOI19_remittance)C++17
100 / 100
391 ms27608 KiB
#include <bits/stdc++.h> typedef long long ll; int main() { std::ios::sync_with_stdio(0); std::cin.tie(0); int n; std::cin >> n; std::vector <int> a(n, 0), b(a); for (int i = 0; i < n; i++) std::cin >> a[i] >> b[i]; for (int tr = 0; tr < 100; tr++) { for (int i = 0; i < n; i++) { if (a[i] > b[i] && a[i] > 1) { int now = a[i] - b[i] + 1; now >>= 1; if ((now << 1) > a[i]) now--; a[i] -= now << 1; a[(i + 1) % n] += now; } } if (a == b) { std::cout << "Yes\n"; return 0; } } std::cout << "No\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...