/*************************************
* 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;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
596 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2496 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 |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2656 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 |
7 ms |
2752 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2608 KB |
Output is correct |
| 18 |
Correct |
7 ms |
2584 KB |
Output is correct |
| 19 |
Correct |
9 ms |
2604 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2900 KB |
Output is correct |
| 21 |
Correct |
34 ms |
3788 KB |
Output is correct |
| 22 |
Correct |
27 ms |
3620 KB |
Output is correct |
| 23 |
Correct |
27 ms |
3620 KB |
Output is correct |
| 24 |
Correct |
30 ms |
3624 KB |
Output is correct |
| 25 |
Correct |
25 ms |
3616 KB |
Output is correct |
| 26 |
Correct |
29 ms |
3616 KB |
Output is correct |
| 27 |
Correct |
31 ms |
3620 KB |
Output is correct |
| 28 |
Correct |
28 ms |
3788 KB |
Output is correct |
| 29 |
Correct |
34 ms |
3668 KB |
Output is correct |
| 30 |
Correct |
28 ms |
3612 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 16 |
Incorrect |
3 ms |
2592 KB |
Output isn't correct |
| 17 |
Incorrect |
3 ms |
2588 KB |
Output isn't correct |
| 18 |
Incorrect |
4 ms |
2588 KB |
Output isn't correct |
| 19 |
Incorrect |
3 ms |
2584 KB |
Output isn't correct |
| 20 |
Incorrect |
2 ms |
2740 KB |
Output isn't correct |
| 21 |
Incorrect |
12 ms |
2968 KB |
Output isn't correct |
| 22 |
Incorrect |
14 ms |
2836 KB |
Output isn't correct |
| 23 |
Incorrect |
12 ms |
3016 KB |
Output isn't correct |
| 24 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
| 25 |
Incorrect |
9 ms |
2848 KB |
Output isn't correct |
| 26 |
Incorrect |
12 ms |
2832 KB |
Output isn't correct |
| 27 |
Incorrect |
12 ms |
2852 KB |
Output isn't correct |
| 28 |
Incorrect |
12 ms |
2860 KB |
Output isn't correct |
| 29 |
Incorrect |
13 ms |
2856 KB |
Output isn't correct |
| 30 |
Incorrect |
7 ms |
2852 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
