제출 #749086

#제출 시각아이디문제언어결과실행 시간메모리
749086ljubaRemittance (JOI19_remittance)C++17
100 / 100
232 ms28492 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<pair<int, int>> v(n); for(auto &z : v) cin >> z.first >> z.second; while(1) { bool promenio = false; for(int i = 0; i < n; ++i) { if(v[i].first >= 2 && v[i].first > v[i].second) { int uzmi = max(1, (v[i].first - v[i].second) / 2); v[i].first -= 2 * uzmi; v[(i + 1) % n].first += uzmi; promenio = true; } } if(!promenio) break; } for(int i = 0; i < n; ++i) { if(v[i].first != v[i].second) { cout << "No" << '\n'; return 0; } } cout << "Yes" << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...