Submission #852069

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
852069	2023-09-21T07:55:02 Z	8pete8	Gap (APIO16_gap)	C++14	Compilation error	0 ms	0 KB

gap

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include "gap.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
//#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define ll long long
const int mxn=1e5,mod=1000000007,lg=20,root=1000,inf=1e18;
ll findGap(int T,int N){
    ll mn,mx;
    ll ans=0;
    if(T==1){
        int lmn=1,lmx=1e18;
        vector<int>v;
        for(int i=0;i<(n+1)/2;i++){
            MinMax(lmn,lmx,&mn,&mx);
            v.pb(mn);
            v.pb(mx);
            lmn=mn+1;
            lmx=mx-1;
        }
        sort(all(v));
        for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
        return ans;
    }
    ans=((mx-mn-1)+(N-2))/(N-2);//min max gap
    int add=0,cur=mn;
    for(int i=0;i<N;i++){
        MinMax(cur+1,cur+ans,&mn,&mx);
        if(mn==-1)add+=(ans);
        else cur=mx,ans=max(ans,add+(mn-cur));
    }
    return ans;
}

Compilation message

gap.cpp:30:54: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   30 | const int mxn=1e5,mod=1000000007,lg=20,root=1000,inf=1e18;
      |                                                      ^~~~
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:35:23: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   35 |         int lmn=1,lmx=1e18;
      |                       ^~~~
gap.cpp:37:24: error: 'n' was not declared in this scope
   37 |         for(int i=0;i<(n+1)/2;i++){
      |                        ^
gap.cpp:45:52: error: no matching function for call to 'max(long long int&, __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type)'
   45 |         for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
      |                                                    ^
In file included from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/ostream:38,
                 from /usr/include/c++/10/iostream:39,
                 from gap.cpp:1:
/usr/include/c++/10/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++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
gap.cpp:45:52: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   45 |         for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
      |                                                    ^
In file included from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/ostream:38,
                 from /usr/include/c++/10/iostream:39,
                 from gap.cpp:1:
/usr/include/c++/10/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++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
gap.cpp:45:52: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   45 |         for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
      |                                                    ^
In file included from /usr/include/c++/10/algorithm:62,
                 from gap.cpp:12:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
gap.cpp:45:52: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   45 |         for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
      |                                                    ^
In file included from /usr/include/c++/10/algorithm:62,
                 from gap.cpp:12:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
gap.cpp:45:52: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   45 |         for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
      |                                                    ^