| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 266411 |
2020-08-15T08:39:14 Z |
_7_7_ |
Gap (APIO16_gap) |
C++14 |
|
61 ms |
2468 KB |
#include "gap.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2e5 + 12;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 1300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
ll a, b, ans, res, nn;
long long findGap(int T, int n) {
nn = n;
srand(time(0));
if (T == 1) {
ll l = 0, r = INF;
vector < ll > v;
while (l <= r) {
if (sz(v) >= n)
break;
MinMax(l, r, &a, &b);
v.pb(a);
v.pb(b);
l = a + 1;
r = b - 1;
}
sort(all(v));
ll ans = 0;
for (ll i = 1; i < sz(v); ++i)
ans = max(ans, v[i] - v[i - 1]);
return ans;
}
MinMax(0, INF, &a, &b);
if (n == 2)
return b - a;
ll ans = (b - a + n - 1) / n;
ll l = a + 1, r, prv = a;
while (n--) {
r = min(INF, l + ans);
if (l > r)
break;
MinMax(l, r, &a, &b);
if (a != -1) {
ans = max(ans, a - prv);
prv = b;
r = b;
}
l = r + 1;
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
512 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
15 ms |
888 KB |
Output is correct |
| 17 |
Correct |
14 ms |
896 KB |
Output is correct |
| 18 |
Correct |
14 ms |
896 KB |
Output is correct |
| 19 |
Correct |
14 ms |
896 KB |
Output is correct |
| 20 |
Correct |
10 ms |
896 KB |
Output is correct |
| 21 |
Correct |
61 ms |
2316 KB |
Output is correct |
| 22 |
Correct |
56 ms |
2288 KB |
Output is correct |
| 23 |
Correct |
58 ms |
2224 KB |
Output is correct |
| 24 |
Correct |
57 ms |
2468 KB |
Output is correct |
| 25 |
Correct |
47 ms |
2296 KB |
Output is correct |
| 26 |
Correct |
56 ms |
2276 KB |
Output is correct |
| 27 |
Correct |
55 ms |
2276 KB |
Output is correct |
| 28 |
Correct |
55 ms |
2288 KB |
Output is correct |
| 29 |
Correct |
56 ms |
2240 KB |
Output is correct |
| 30 |
Correct |
42 ms |
2292 KB |
Output is correct |
| 31 |
Correct |
0 ms |
384 KB |
Output is correct |
| 32 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
512 KB |
Output is correct |
| 8 |
Correct |
1 ms |
512 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
2 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
10 ms |
512 KB |
Output is correct |
| 17 |
Correct |
11 ms |
512 KB |
Output is correct |
| 18 |
Correct |
10 ms |
512 KB |
Output is correct |
| 19 |
Correct |
10 ms |
512 KB |
Output is correct |
| 20 |
Correct |
8 ms |
512 KB |
Output is correct |
| 21 |
Correct |
36 ms |
1272 KB |
Output is correct |
| 22 |
Correct |
38 ms |
1120 KB |
Output is correct |
| 23 |
Correct |
38 ms |
1076 KB |
Output is correct |
| 24 |
Correct |
41 ms |
1144 KB |
Output is correct |
| 25 |
Correct |
60 ms |
1232 KB |
Output is correct |
| 26 |
Correct |
39 ms |
1144 KB |
Output is correct |
| 27 |
Correct |
38 ms |
1052 KB |
Output is correct |
| 28 |
Correct |
39 ms |
1152 KB |
Output is correct |
| 29 |
Correct |
42 ms |
1136 KB |
Output is correct |
| 30 |
Correct |
30 ms |
1168 KB |
Output is correct |
| 31 |
Correct |
0 ms |
384 KB |
Output is correct |
| 32 |
Correct |
0 ms |
384 KB |
Output is correct |
