Submission #1266498

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266498		StefanSebez	Remittance (JOI19_remittance)	C++20	Compilation error	0 ms	0 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=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,0);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;
}

Compilation message (stderr)

remittance.cpp: In function 'int main()':
remittance.cpp:22:18: error: no matching function for call to 'max(long long int, int)'
   22 |     for(ll X1=max(tempx-S,0);X1<=tempx+S;X1++){
      |               ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/bits/specfun.h:45,
                 from /usr/include/c++/11/cmath:1935,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
                 from remittance.cpp:1:
/usr/include/c++/11/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/11/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
remittance.cpp:22:18: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   22 |     for(ll X1=max(tempx-S,0);X1<=tempx+S;X1++){
      |               ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/bits/specfun.h:45,
                 from /usr/include/c++/11/cmath:1935,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
                 from remittance.cpp:1:
/usr/include/c++/11/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/11/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
remittance.cpp:22:18: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   22 |     for(ll X1=max(tempx-S,0);X1<=tempx+S;X1++){
      |               ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/string:52,
                 from /usr/include/c++/11/bits/locale_classes.h:40,
                 from /usr/include/c++/11/bits/ios_base.h:41,
                 from /usr/include/c++/11/ios:42,
                 from /usr/include/c++/11/istream:38,
                 from /usr/include/c++/11/sstream:38,
                 from /usr/include/c++/11/complex:45,
                 from /usr/include/c++/11/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
                 from remittance.cpp:1:
/usr/include/c++/11/bits/stl_algo.h:3461:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3461 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/11/bits/stl_algo.h:3461:5: note:   template argument deduction/substitution failed:
remittance.cpp:22:18: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   22 |     for(ll X1=max(tempx-S,0);X1<=tempx+S;X1++){
      |               ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/string:52,
                 from /usr/include/c++/11/bits/locale_classes.h:40,
                 from /usr/include/c++/11/bits/ios_base.h:41,
                 from /usr/include/c++/11/ios:42,
                 from /usr/include/c++/11/istream:38,
                 from /usr/include/c++/11/sstream:38,
                 from /usr/include/c++/11/complex:45,
                 from /usr/include/c++/11/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
                 from remittance.cpp:1:
/usr/include/c++/11/bits/stl_algo.h:3467:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3467 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/11/bits/stl_algo.h:3467:5: note:   template argument deduction/substitution failed:
remittance.cpp:22:18: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   22 |     for(ll X1=max(tempx-S,0);X1<=tempx+S;X1++){
      |               ~~~^~~~~~~~~~~
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];
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~