| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1322623 | maxFedorchuk | 송금 (JOI19_remittance) | C++20 | 0 ms | 332 KiB |
#include <bits/stdc++.h>
using namespace std;
const long long MX=1e6+10;
long long a[MX],b[MX];
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
long long n;
cin>>n;
for(long long i=0;i<n;i++)
{
cin>>a[i]>>b[i];
}
while(true)
{
bool cng=0;
for(long long i=0;i<n;i++)
{
if(a[i]>=b[i]+2)
{
cng=1;
long long am=(a[i]-b[i])/2;
a[(i+1)%n]+=am;
a[i]-=2*am;
}
}
if(!cng)
{
break;
}
}
for(long long i=1;i<=n;i++)
{
if(a[i]!=b[i])
{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
