#ifndef hwe
#include "gap.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T>
void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
#ifdef hwe
void MinMax(ll s, ll t, ll *mn, ll *mx) {
cerr << s << ' ' << t << '\n';
cin >> *mn >> *mx;
}
#endif
namespace sub1 {
ll a[N];
ll findGap(int n) {
a[0] = -1, a[n + 1] = INF + 1;
for (int i = 1; i <= (n + 1) / 2; ++i) {
MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
}
ll ans = -INF;
for (int i = 2; i <= n; ++i) maximize(ans, a[i] - a[i - 1]);
return ans;
}
}
namespace sub2 {
ll findGap(int n) {
ll mi, ma;
MinMax(0, INF, &mi, &ma);
ll L = ma - mi, lowerbound = ceil(1.0 * (L + n - 1) / (n - 1));
ll last_max = -1, ans = lowerbound;
for (ll i = mi; i <= ma; i += lowerbound) {
ll mn, mx;
MinMax(i, min(i + lowerbound - 1, ma), &mn, &mx);
if (mn != -1 && last_max != -1) maximize(ans, mn - last_max);
if (mx != -1) last_max = mx;
}
return ans;
}
}
ll findGap(int t, int n) {
if (t == 1) return sub1::findGap(n);
return sub2::findGap(n);
}
#ifdef hwe
signed main() {
findGap(2, 3);
cerr << '\n'; return 0;
}
#endif
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
0 ms |
344 KB |
Output is correct |
| 13 |
Correct |
0 ms |
344 KB |
Output is correct |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
344 KB |
Output is correct |
| 16 |
Correct |
5 ms |
828 KB |
Output is correct |
| 17 |
Correct |
5 ms |
704 KB |
Output is correct |
| 18 |
Correct |
5 ms |
856 KB |
Output is correct |
| 19 |
Correct |
7 ms |
856 KB |
Output is correct |
| 20 |
Correct |
4 ms |
856 KB |
Output is correct |
| 21 |
Correct |
24 ms |
1880 KB |
Output is correct |
| 22 |
Correct |
22 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
24 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
22 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
19 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
21 ms |
1880 KB |
Output is correct |
| 27 |
Correct |
31 ms |
1872 KB |
Output is correct |
| 28 |
Correct |
21 ms |
1868 KB |
Output is correct |
| 29 |
Correct |
24 ms |
1916 KB |
Output is correct |
| 30 |
Correct |
17 ms |
1880 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 16 |
Correct |
7 ms |
448 KB |
Output is correct |
| 17 |
Correct |
7 ms |
600 KB |
Output is correct |
| 18 |
Correct |
7 ms |
528 KB |
Output is correct |
| 19 |
Correct |
7 ms |
600 KB |
Output is correct |
| 20 |
Correct |
4 ms |
600 KB |
Output is correct |
| 21 |
Correct |
28 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
34 ms |
1112 KB |
Output is correct |
| 23 |
Correct |
29 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
28 ms |
1112 KB |
Output is correct |
| 25 |
Incorrect |
33 ms |
1112 KB |
Output isn't correct |
| 26 |
Correct |
29 ms |
1112 KB |
Output is correct |
| 27 |
Correct |
29 ms |
1364 KB |
Output is correct |
| 28 |
Correct |
29 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
39 ms |
1232 KB |
Output is correct |
| 30 |
Correct |
16 ms |
1112 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
