| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 971424 |
2024-04-28T13:28:23 Z |
hariaakas646 |
Gap (APIO16_gap) |
C++14 |
|
47 ms |
3032 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;
// Subtask 1 too trivial
long long findGap(int T, int n)
{
lli st, en;
MinMax(0, 1e18, &st, &en);
lli l = en - st;
lli x = (l + n-2) / (n-1);
lli pre = st;
lli out = 0;
for(lli i=st; i<=en; i+=x) {
lli mi, ma;
MinMax(i, min(en, i+x-1), &mi, &ma);
if(mi != -1)
out = max(out, mi - pre);
if(ma != -1)
pre = ma;
}
return out;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 8 |
Incorrect |
1 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 |
2 ms |
2500 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
2644 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 |
12 ms |
2828 KB |
Output isn't correct |
| 17 |
Incorrect |
10 ms |
2588 KB |
Output isn't correct |
| 18 |
Incorrect |
10 ms |
2832 KB |
Output isn't correct |
| 19 |
Incorrect |
10 ms |
2572 KB |
Output isn't correct |
| 20 |
Incorrect |
5 ms |
2576 KB |
Output isn't correct |
| 21 |
Incorrect |
41 ms |
2860 KB |
Output isn't correct |
| 22 |
Incorrect |
44 ms |
2840 KB |
Output isn't correct |
| 23 |
Incorrect |
47 ms |
2852 KB |
Output isn't correct |
| 24 |
Incorrect |
42 ms |
2852 KB |
Output isn't correct |
| 25 |
Incorrect |
38 ms |
2848 KB |
Output isn't correct |
| 26 |
Incorrect |
42 ms |
2852 KB |
Output isn't correct |
| 27 |
Incorrect |
40 ms |
2864 KB |
Output isn't correct |
| 28 |
Incorrect |
42 ms |
2864 KB |
Output isn't correct |
| 29 |
Incorrect |
42 ms |
2856 KB |
Output isn't correct |
| 30 |
Incorrect |
23 ms |
2740 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 5 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 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 |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 16 |
Correct |
11 ms |
2740 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2748 KB |
Output is correct |
| 18 |
Correct |
11 ms |
2584 KB |
Output is correct |
| 19 |
Correct |
12 ms |
2644 KB |
Output is correct |
| 20 |
Correct |
5 ms |
2820 KB |
Output is correct |
| 21 |
Correct |
44 ms |
3000 KB |
Output is correct |
| 22 |
Correct |
43 ms |
2852 KB |
Output is correct |
| 23 |
Correct |
45 ms |
2844 KB |
Output is correct |
| 24 |
Correct |
40 ms |
3032 KB |
Output is correct |
| 25 |
Partially correct |
38 ms |
2868 KB |
Partially correct |
| 26 |
Correct |
44 ms |
2852 KB |
Output is correct |
| 27 |
Correct |
46 ms |
2864 KB |
Output is correct |
| 28 |
Correct |
46 ms |
2884 KB |
Output is correct |
| 29 |
Correct |
40 ms |
2852 KB |
Output is correct |
| 30 |
Correct |
23 ms |
2784 KB |
Output is correct |
| 31 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
