oj.uz

답안 #877577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877577 2023-11-23T10:41:34 Z marvinthang Gap (APIO16_gap) C++17
100 / 100
 43 ms 3868 KB 
/*************************************
*    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.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2644 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2584 KB Output is correct
17 Correct 8 ms 2752 KB Output is correct
18 Correct 8 ms 2588 KB Output is correct
19 Correct 8 ms 2660 KB Output is correct
20 Correct 6 ms 2572 KB Output is correct
21 Correct 29 ms 3624 KB Output is correct
22 Correct 29 ms 3520 KB Output is correct
23 Correct 29 ms 3624 KB Output is correct
24 Correct 29 ms 3532 KB Output is correct
25 Correct 26 ms 3616 KB Output is correct
26 Correct 32 ms 3868 KB Output is correct
27 Correct 29 ms 3612 KB Output is correct
28 Correct 29 ms 3624 KB Output is correct
29 Correct 29 ms 3616 KB Output is correct
30 Correct 24 ms 3612 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2404 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 10 ms 2588 KB Output is correct
17 Correct 10 ms 2736 KB Output is correct
18 Correct 10 ms 2588 KB Output is correct
19 Correct 10 ms 2828 KB Output is correct
20 Correct 6 ms 2536 KB Output is correct
21 Correct 41 ms 2856 KB Output is correct
22 Correct 43 ms 2860 KB Output is correct
23 Correct 41 ms 2852 KB Output is correct
24 Correct 41 ms 2864 KB Output is correct
25 Correct 39 ms 2848 KB Output is correct
26 Correct 41 ms 2856 KB Output is correct
27 Correct 40 ms 2856 KB Output is correct
28 Correct 41 ms 2856 KB Output is correct
29 Correct 41 ms 2860 KB Output is correct
30 Correct 23 ms 2856 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct