Submission #852059

#	Time	Username	Problem	Language	Result	Execution time	Memory
852059		8pete8	Gap (APIO16_gap)	C++17	0 / 100	24 ms	2864 KiB

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;
    MinMax(1,1e18,&mn,&mx);
    if(N==2)return mx-mn;
    ll ans=0;
    if(T==1){
        int lmn=mn,lmx=mx;
        while(mn<mx){
            MinMax(lmn+1,lmx-1,&mn,&mx);
            ans=max({ans,mn-lmn,lmx-mx});
            lmn=mn;
            lmx=mx;
            if(mn==-1)break;
        }
        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 (stderr)

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;
      |                                                      ^~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70