제출 #242179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
242179		jiahng	Gap (APIO16_gap)	C++14	0 / 100	3099 ms	1272 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0)
#define INF (ll)1e18

long long findGap(int T, int N)
{
	ll mn=0,mx=0;
	MinMax(0LL,INF,&mn,&mx);
	
	//ll lb = ceil(double(mx - mn + 1) / (double)N);
	ll lb = 1;
	ll cur = mn;
	ll ans = lb;
	
	ll prev = mn;
	while (cur <= mx){
		ll x,y;
		MinMax(cur,cur + lb - 1,&x,&y);
		if (x == -1){
			cur = min(mx,cur+lb);
			continue;
		}
		ans = max(ans,x - prev);
		prev = y;
		
		cur += lb;
	}
	ans = max(ans,mx - prev);
	return ans;
}

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