제출 #797118

#제출 시각아이디문제언어결과실행 시간메모리
797118fatemetmhr송금 (JOI19_remittance)C++17
0 / 100
0 ms340 KiB
// Be name khoda // #include <bits/stdc++.h> #define all(x) x.begin(), x.end() #define pb push_back #define fi first #define se second #define mp make_pair typedef long long ll; using namespace std; const int maxn5 = 1e6 + 10; bool mark[maxn5]; ll a[maxn5], b[maxn5]; queue <int> q; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for(int i = 0; i < n; i++){ cin >> a[i] >> b[i]; if(a[i] - b[i] > 1){ mark[i] = true; q.push(i); } } while(q.size()){ int i = q.front(); q.pop(); mark[i] = false; int j = (i + 1) % n; a[j] += (a[i] - b[i]) / 2; a[i] -= (a[i] - b[i]) / 2 * 2; if(a[j] - b[j] > 1 && !mark[j]) q.push(j); } bool re = true; for(int i = 0; i < n; i++) re &= (a[i] == b[i]); cout << (re ? "Yes" : "No") << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...