Submission #126591

#TimeUsernameProblemLanguageResultExecution timeMemory
126591jakob_noglerGap (APIO16_gap)C++14
30 / 100
2094 ms524292 KiB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;
typedef vector<ll> vll;

const ll inf = 1e18;

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

	if(N == 2) return hi - lo;
	if(T == 1){
		while(lo < hi){
			t_lo = lo, t_hi = hi;
			if(cnt == N){
				ans = max(ans, hi - lo);
				break;
			}
			if(lo + 1 >= hi - 1) break;
			MinMax(lo + 1, hi - 1, &lo, &hi);
			ans = max(ans, t_hi - hi);
			ans = max(ans, lo - t_lo);
			cnt += 2;
		}

		return ans;
	}

	vll vec;
	ll amm = (hi - lo) / (N - 2);
	cout << amm << endl;

	int id = lo + 1;
	while(true){
		MinMax(id, id + amm, &t_lo, &t_hi);
		if(t_lo != - 1){
			vec.push_back(t_lo);
			vec.push_back(t_hi);
		}
		id += amm + 1;
		if(id + amm + 1 >= hi) break;
	}

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

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:49:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < vec.size() - 1; i++)
                 ~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...