제출 #126579

#제출 시각아이디문제언어결과실행 시간메모리
126579jakob_noglerGap (APIO16_gap)C++14
0 / 100
65 ms3064 KiB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;

const ll inf = 1e18;

ll findGap(int T, int N){
	ll lo, hi, t_lo, t_hi, ans = 0;
	MinMax(0, inf, &lo, &hi);

	while(lo < hi){
		t_lo = lo, t_hi = hi;
		MinMax(lo + 1, hi - 1, &lo, &hi);
		if(lo == - 1){
			ans = max(ans, t_hi - t_lo);
			break;
		}
		ans = max(ans, t_hi - hi);
		ans = max(ans, lo - t_hi);
	}
	
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...