Submission #406906

#	Time	Username	Problem	Language	Result	Execution time	Memory
406906		SeDunion	Gap (APIO16_gap)	C++17	30 / 100	56 ms	1904 KiB

gap

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

ll solve1(int N) {
	ll L = -1, R = ll(1e18)+1;
	vector<ll>a(N);
	int l = 0, r = N - 1;
	while (l <= r) {
		MinMax(L+1, R-1, &L, &R);
		a[l++] = L, a[r--] = R;
	}
	ll answer = 0;
	for (int i = 0 ; i < N - 1 ; ++ i) answer = max(answer, a[i + 1] - a[i]);
	return answer;
}

ll solve2(int N) {
	return -1;
}

ll findGap(int T, int N) {
	if (T == 1) {
		return solve1(N);
	} else {
		return solve2(N);
	}
}

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