#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
const int N=1e6+50,S=37;
ll a[N],b[N],c[N],x[N];
int main(){
int n;scanf("%i",&n);
for(int i=1;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]),c[i]=a[i]-b[i];
a[0]=a[n],b[0]=b[n],c[0]=a[0]-b[0];
ld X=0;
for(int i=n;i>=max(n-60,1);i--){
ll e=1<<(n-i+1);
X+=(ld)c[i]/(ld)e;
}
ll tempx=floor(X);
//printf("%lld\n",tempx);
bool res=false;
for(ll X1=max(tempx-S,0LL);X1<=tempx+S;X1++){
bool moze=true;
x[0]=X1;
for(int i=1;i<=n;i++) x[i]=0;
for(int i=1;i<=n;i++){
if((c[i]+x[i-1])%2==1){moze=false;break;}
x[i]=(c[i]+x[i-1])/2;
if(x[i]<0) moze=false;
}
if(x[n]!=x[0]) moze=false;
if(moze){res=true;break;}
}
//for(int i=1;i<=n;i++) printf("%lld ",x[i]);printf("\n");
if(res){
set<pair<ll,int>>st;
for(int i=0;i<n;i++) st.insert({a[i],i});
while(!st.empty()){
auto [nesto,i]=*st.rbegin();st.erase({nesto,i});
ll d=min(a[i]/2,x[i]);
if(d==0) continue;
a[i]-=2*d;x[i]-=d;
int j=(i+1)%n;
if(st.find({a[j],j})!=st.end())st.erase({a[j],j});
a[j]+=d;
if(x[j]>0)st.insert({a[j],j});
if(x[i]>0)st.insert({a[i],i});
}
for(int i=0;i<n;i++) if(a[i]!=b[i]) res=false;
}
if(res) printf("Yes\n");
else printf("No\n");
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
remittance.cpp: In function 'int main()':
remittance.cpp:11:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | int n;scanf("%i",&n);
| ~~~~~^~~~~~~~~
remittance.cpp:12:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
12 | for(int i=1;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]),c[i]=a[i]-b[i];
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |