제출 #545064

#제출 시각아이디문제언어결과실행 시간메모리
545064Sohsoh84Gap (APIO16_gap)C++17
0 / 100
612 ms5828 KiB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;

#define debug(x)		cerr << #x << ": " << x << endl;
#define sep			' '

const ll INF = 2e18;

ll findGap(int t, int n) {	
	ll mn = 0, mx = INF;
	MinMax(0, INF, &mn, &mx);
	if (n == 1) return 0;

	ll len = mx - mn;
	ll sq = (len + n - 1) / (n - 1), ans = sq;

	vector<ll> vec;
	for (ll l = mn; l <= mx; l += sq) { // sq + 1
		ll a = 0, b = 0;
		MinMax(l, l + sq - 1, &a, &b); //
		
		cerr << l << sep << l + sq - 1 << endl;
		if (a >= 0) {
			vec.push_back(a);
			if (b != a) vec.push_back(b);
		}
	}

	for (int i = 1; i < int(vec.size()); i++) {
		ans = max(ans, vec[i] - vec[i - 1]);
	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...