Submission #1168591

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168591		Zero_OP	Gap (APIO16_gap)	C++20	70 / 100	51 ms	1864 KiB

gap

#include <bits/stdc++.h>

#ifndef LOCAL
#include "gap.h"
#endif

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r)-1; i >= (l); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))

#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
      bool minimize(T& a, const T& b){
            if(a > b) return a = b, true;
            return false;
      }

template<typename T>
      bool maximize(T& a, const T& b){
            if(a < b) return a = b, true;
            return false;
      }

typedef long long ll;

using db = double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vd = vector<db>;
using vb = vector<bool>;

using vpi = vector<pi>;
using vpl = vector<pl>;

#ifdef LOCAL
static void my_assert(int k){ if (!k) exit(1); }

static int subtask_num, N;
static long long A[100001];
static long long call_count;

void MinMax(long long s, long long t, long long *mn, long long *mx)
{
	int lo = 1, hi = N, left = N+1, right = 0;
	my_assert(s <= t && mn != NULL && mx != NULL);
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] >= s) hi = mid - 1, left = mid;
		else lo = mid + 1;
	}
	lo = 1, hi = N;
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] <= t) lo = mid + 1, right = mid;
		else hi = mid - 1;
	}
	if (left > right) *mn = *mx = -1;
	else{
		*mn = A[left];
		*mx = A[right];
	}
	if (subtask_num == 1) call_count++;
	else if (subtask_num == 2) call_count += right-left+2;
}
#endif //LOCAL

const int MAX = 2e5 + 5;
ll a[MAX];

long long findGap(int T, int N){
      if(T == 1){
            MinMax(0ll, (long long)1e18, &a[0], &a[N-1]);
            for(int i = 0, j = N-1; i < j; ++i, --j){
                  MinMax(a[i]+1, a[j]-1, &a[i+1], &a[j-1]);
            }

            long long ans = 1;
            FOR(i, 1, N) maximize(ans, a[i] - a[i-1]);
            return ans;
      } else{
            long long L, R;
            MinMax(0, 1e18, &L, &R);

            long long D = (R - L + N - 2) / (N-1) + 1; //ceil((R-L)/(N-1))
            long long ans = D-1, pre = L;
            for(long long lo = L+1; lo <= R; lo += D){
                  long long x, y;
                  MinMax(lo, min(lo + D, R), &x, &y);
                  if(x != -1) maximize(ans, x - pre), pre = y;
            }

            return ans;
      }
}


#ifdef LOCAL
int main()
{
	FILE *in = stdin, *out = stdout;
	my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
	my_assert(1 <= subtask_num && subtask_num <= 2);
	my_assert(2 <= N && N <= 100000);
	for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
	for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
	fprintf(out, "%lld\n", findGap(subtask_num, N));
	fprintf(out, "%lld\n", call_count);
}
#endif // LOCAL

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