#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
long long int n,a[200005],b[200005];
void read()
{
cin>>n;
int brr=0,brr1=0;
for(int i=1; i<=n; i++)
{
cin>>a[i]>>b[i];
if(b[i]==0)brr++;
brr1+=a[i];
}
if(brr==n)
{
if(brr1)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
return;
}
int pren=0;
for(int j=1; j<=50; j++)
{
for(int i=1; i<=n; i++)
{
a[i]+=pren;
if(a[i]>=b[i])
{
pren=(a[i]-b[i]+1)/2;
if((a[i]-b[i])%2==1)a[i]=b[i]-1;
else a[i]=b[i];
}
}
}
for(int i=1;i<=n;i++)
{
if(a[i]!=b[i])
{
cout<<"No"<<endl;
}
}
cout<<"Yes"<<endl;
}
int main()
{
speed();
read();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |