제출 #1003718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003718		MarwenElarbi	Gap (APIO16_gap)	C++17	34.63 / 100	34 ms	1364 KiB

gap

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=2e3+5;
void MinMax(long long, long long, long long*, long long*);
long long findGap(int T, int N)
{
    long long lst,mx;
    MinMax(0,1e18,&lst,&mx);
    if(N<=2) return mx-lst;
    else if(N<=9){
      long long ans=0;
      int j=N-1;
      int i=2;
      while(i<j){
        long long a,b;
        MinMax(lst+1,mx-1,&a,&b);
        ans=max(ans,max(a-lst,mx-b));
        a=lst;
        b=mx;
        i++;j--;
      }
      return ans;
    }
    long long ans=1;
    while(mx!=lst){
        long long a,b;
        MinMax(lst+1,lst+ans,&a,&b);
        if(a==-1){
            while(a==-1){
                ans*=2;
                MinMax(lst+1,lst+ans,&a,&b);
            }
            ans=a-lst;
            lst=b;
        }else{
            lst=b;
        }
    }
    return ans;
}

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