#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void ngha();
const int mod2=1e9+7;
const int mod1=998244353;
struct ib
{
int a;
int b;
};
struct icd
{
int a,b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c, d,e;
};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int i,s10,s12;
int el=29;
main()
{
//#ifndef ONLINE_JUDGE
//fin(task),fou(task);
//#endif
NHP
//modwwe
// cin>>res;
ngha(),down
checktime
}
stack<int> s;
ib a[1000001];
int c[1000001];
void ngha()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].a>>a[i].b;
if(a[i].a>a[i].b) c[i]=1,s.push(i);
}
while(!s.empty())
{
i=s.top();
s.pop();
c[i]=0;
s3=a[i].a-a[i].b;
s4=s3/2;
if(s3%2!=0&&a[i].b==0)a[i].a=a[i].b+1;
else
if(s3%2!=0&&a[i].b!=0)s4++,a[i].a=a[i].b-1;
else a[i].a=a[i].b;
if(i==n) i=0;
if(s4==0) continue;
a[i+1].a+=s4;
if(c[i+1]==0)
{
if(a[i+1].a>a[i+1].b) s.push(i+1),c[i+1]=1;
}
}
for(int i=1;i<=n;i++)
if(a[i].a!=a[i].b)
{
cout<<"NO";
exit(0);
}
cout<<"Yes";
}
Compilation message
remittance.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
45 | main()
| ^~~~
remittance.cpp: In function 'void ngha()':
remittance.cpp:74:10: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
74 | else
| ^~~~
remittance.cpp:77:11: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
77 | if(i==n) i=0;
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |