Submission #1005795

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005795		omsincoconut	Gap (APIO16_gap)	C++17	30 / 100	36 ms	6988 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"

using namespace std;
typedef long long ll;

ll findGap1(int N) {
	ll l = 1, r = N;
	ll fl = LLONG_MIN, fr = LLONG_MAX;
	ll arr[N+1];
	while (l <= r) {
		ll *q1 = new ll(0), *q2 = new ll(0);
		MinMax(fl, fr, q1, q2);
		arr[l++] = *q1;
		arr[r--] = *q2;
		fl = *q1+1;
		fr = *q2-1;
	}
	ll ans = 0;
	for (ll i = 1; i < N; i++) ans = max(ans, arr[i+1] - arr[i]);
	return ans;
}

ll findGap2(int N) {
	return 0;
}

ll findGap(int T, int N) {
	return T == 1 ? findGap1(N) : findGap1(N);
}

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