제출 #657216

#제출 시각아이디문제언어결과실행 시간메모리
657216sandry24Remittance (JOI19_remittance)C++17
100 / 100
528 ms27468 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pi; #define pb push_back #define mp make_pair #define f first #define s second bool is_equal(vector<pi> &a){ bool equal = true; for(auto i : a) equal &= (i.f == i.s); return equal; } void solve(){ int n; cin >> n; vector<pi> a(n); for(int i = 0; i < n; i++) cin >> a[i].f >> a[i].s; for(int i = 0; i < 50; i++){ if(is_equal(a)){ cout << "Yes\n"; return; } for(int j = 0; j < n; j++){ int diff = a[j].f - a[j].s; int next = (j == n-1 ? 0 : j+1); if(diff <= 0) continue; if(diff % 2) diff++; if(a[j].f < diff) continue; a[next].f += diff/2; a[j].f -= diff; } //for(auto i : a) //cout << i.f << ' ' << i.s << '\n'; //cout << '\n' << '\n'; } cout << "No\n"; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t = 1; //cin >> t; while(t--){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...