Submission #242140

#	Time	Username	Problem	Language	Result	Execution time	Memory
242140		syy	Gap (APIO16_gap)	C++17	0 / 100	136 ms	1272 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

ll findGap(int t, int n) {
	ll l, r; FOR(i, 1, 3*n+1) MinMax(0, 1e18, &l, &r);
	MinMax(0, 1e18, &l, &r);
	if (n == 2) return r - l;
	ll gap = (r-l-1)/(n-1), pre = -1, ans = 0;
	for (ll i = l+1; i < r-1; i += gap) {
		ll x, y; MinMax(i, min(i+gap-1, r-1), &x, &y);
		if (x == -1) continue;
		if (pre != -1) ans = max(ans, x - pre);
		pre = y;
	}
	return ans;
}

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