Submission #877577

#	Time	Username	Problem	Language	Result	Execution time	Memory
877577		marvinthang	Gap (APIO16_gap)	C++17	100 / 100	43 ms	3868 KiB

gap

/*************************************
*    author: marvinthang             *
*    created: 23.11.2023 16:28:38    *
*************************************/

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

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const long long INF = 1e18;

long long findGap(int T, int N) {
	if (T == 1) {
		vector <long long> A(N);
		long long s = 0, t = INF;
		for (int l = 0, r = N - 1; l <= r; ++l, --r) {
			MinMax(s, t, &A[l], &A[r]);
			s = A[l] + 1; t = A[r] - 1;
		}
		long long res = 0;
		REP(i, N - 1) res = max(res, A[i + 1] - A[i]);
		return res;
	}
	long long mn, mx;
	MinMax(0, INF, &mn, &mx);
	long long ms = (mx - mn + N - 2) / (N - 1);
	long long res = ms, last = mn;
	for (long long x = mn + 1; x <= mx; x += ms + 1) {
		long long a, b;
		MinMax(x, x + ms, &a, &b);
		if (a >= 0) {
			res = max(res, a - last);
			last = b;
		}
	}
	return res;
}

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