Submission #720368

#	Time	Username	Problem	Language	Result	Execution time	Memory
720368		joelgun14	Gap (APIO16_gap)	C++17	88.38 / 100	64 ms	3232 KiB

gap

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

long long findGap(int T, int N)
{
	// can call findmax function
	// let's say range is between 1 to 1e18
	// divide n into blocks size n / k
	if(T == 1) {
		ll l = 0, r = 1e18;
		ll a[N];
		for(int i = 0; i < N / 2 + N % 2; ++i) {
			MinMax(l, r, &a[i], &a[N - i - 1]);
			l = a[i] + 1, r = a[N - i - 1] - 1;
		}
		ll mxdiff = 0;
		for(int i = 1; i < N; ++i)
			mxdiff = max(mxdiff, a[i] - a[i - 1]);
		return mxdiff;
	}
	else {
		// divide N blocks size len / N into blocks
		ll l, r;
		MinMax((ll)0, (ll)1e18, &l, &r);
		if(N == 2)
			return r - l;
		ll minres = (r - l + N - 2) / (ll)(N - 1);
		// kita query dr l + 1 ke l + min_res
		// n - 1 query total n elem?
		vector<ll> x = {l};
		ll a, b;
		__int128 crl = l + 1 ,crr = l + minres + 1;
		for(int i = 0; i < N - 1; ++i) {
			MinMax(min((ll)crl, (ll)r - 1), min((ll)crr, (ll)r - 1), &a, &b);
			crl += minres + 1;
			crr += minres + 1;
			if(a != -1)
				x.push_back(a), x.push_back(b);
		}
		x.push_back(r);
		ll res = 0;
		for(int i = 1; i < x.size(); ++i)
			res = max(res, x[i] - x[i - 1]);
		return res;
	}
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for(int i = 1; i < x.size(); ++i)
      |                  ~~^~~~~~~~~~

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