Submission #1266796

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266796		StefanSebez	송금 (JOI19_remittance)	C++20	15 / 100	220 ms	444 KiB

remittance

#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=5e7;
ll a[N],b[N],c[N],x[N];
bool res=true;
int main(){
    ll n;scanf("%lld",&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];
    bool bul=true;
    for(int i=1;i<=n;i++){if(b[i]>0) bul=false;}
    bool bul1=true;
    for(int i=1;i<=n;i++){if(a[i]>0) bul1=false;}
    if(bul&&!bul1){
        printf("No\n");
        return 0;
    }
    /*for(int i=0;i<=0;i++){
        ll sum=0;
        for(ll j=i+1,ct=0;ct<n;j=(j+1)%n,ct++){
            sum+=c[j]*(1LL<<ct);
        }
        ll e=(1LL<<n)-1;
        x[i]=sum/e;
        if(x[i]<0||x[i]*e!=sum) res=false;
    }*/
    ld X=0;
    for(ll i=n;i>=max(n-58,1LL);i--){
        ll e=1LL<<(n-i+1);
        X+=((ld)c[i])/((ld)e);
    }
    ll tempx=floor(X);
    //printf("%lld\n",tempx);
    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]=(c[i]+x[i-1])/2;
            if(x[i]<0||2*x[i]!=c[i]+x[i-1]){moze=false;break;}
        }
        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) printf("Yes\n");
    else printf("No\n");
    return 0;
}

Compilation message (stderr)

remittance.cpp: In function 'int main()':
remittance.cpp:12:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     ll n;scanf("%lld",&n);
      |          ~~~~~^~~~~~~~~~~
remittance.cpp:13:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for(int i=1;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]),c[i]=a[i]-b[i];
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45