| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299058 | Jawad_Akbar_JJ | 송금 (JOI19_remittance) | C++20 | 1 ms | 580 KiB |
#include <iostream>
using namespace std;
int a[1<<20], b[1<<20];
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, ch = 1, ans1 = 0, ans2 = 0;
cin>>n;
for (int i=0;i<n;i++)
cin>>a[i]>>b[i];
while (ch){
ch = 0;
for (int i=0;i<n;i++){
int k = max(0, a[i] - b[i]);
k = (k>>1)<<1;
ch += !!k;
a[(i + 1) % n] += k / 2;
a[i] -= k;
}
}
for (int i=0;i<n;i++){
if (a[i] == b[i])
ans1++;
else if (a[i] == b[i] + 1)
ans2++;
}
if (ans1 == n or ans2 == n)
cout<<"Yes\n";
else
cout<<"No\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
