#include <bits/stdc++.h>
#include "gap.h"
#define N 100005
#define inf 1000000000000000000LL
using namespace std;
typedef long long ll;
ll n, v[N], ans[N];
vector<ll> val;
void solve(ll ini, ll fim)
{
if(fim < ini) return;
if(ini == fim)
{
val.push_back(ini);
return;
}
ll mid = (ini + fim)/2;
ll a, b;
MinMax(mid + 1, fim, &a, &b);
if(a != -1 && b != -1)
{
if(a == b) val.push_back(a);
else solve(a + 1, b - 1);
}
MinMax(ini, mid, &a, &b);
if(a != -1 && b != -1)
{
if(a == b) val.push_back(a);
else solve(a + 1, b - 1);
}
}
ll findGap(int T, int N_)
{
ll best = 0;
if(T == 1)
{
n = N_;
ll esq = 0, dir = inf;
for(int i = 1, st = 1, en = n; i <= (n + 1)/2; i++, st ++, en --)
{
ll a, b;
MinMax(esq, dir, &a, &b);
esq = a + 1, dir = b - 1;
if(a != -1 && b != -1) ans[st] = a, ans[en] = b;
}
for(int i = 2; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);
return best;
}
else
{
solve(0, inf);
sort(val.begin(), val.end());
for(int i = 1; i < val.size(); i++) best = max(best, val[i] - val[i - 1]);
return best;
}
}
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:78:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i < val.size(); i++) best = max(best, val[i] - val[i - 1]);
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
352 KB |
Output is correct |
| 3 |
Correct |
1 ms |
408 KB |
Output is correct |
| 4 |
Correct |
1 ms |
408 KB |
Output is correct |
| 5 |
Correct |
2 ms |
460 KB |
Output is correct |
| 6 |
Correct |
2 ms |
532 KB |
Output is correct |
| 7 |
Correct |
2 ms |
632 KB |
Output is correct |
| 8 |
Correct |
1 ms |
632 KB |
Output is correct |
| 9 |
Correct |
1 ms |
632 KB |
Output is correct |
| 10 |
Correct |
2 ms |
636 KB |
Output is correct |
| 11 |
Correct |
2 ms |
636 KB |
Output is correct |
| 12 |
Correct |
2 ms |
636 KB |
Output is correct |
| 13 |
Correct |
2 ms |
636 KB |
Output is correct |
| 14 |
Correct |
2 ms |
636 KB |
Output is correct |
| 15 |
Correct |
2 ms |
684 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1004 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1004 KB |
Output is correct |
| 18 |
Correct |
14 ms |
1004 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1004 KB |
Output is correct |
| 20 |
Correct |
11 ms |
1004 KB |
Output is correct |
| 21 |
Correct |
80 ms |
2264 KB |
Output is correct |
| 22 |
Correct |
57 ms |
2276 KB |
Output is correct |
| 23 |
Correct |
56 ms |
2276 KB |
Output is correct |
| 24 |
Correct |
56 ms |
2276 KB |
Output is correct |
| 25 |
Correct |
44 ms |
2276 KB |
Output is correct |
| 26 |
Correct |
52 ms |
2276 KB |
Output is correct |
| 27 |
Correct |
52 ms |
2276 KB |
Output is correct |
| 28 |
Correct |
56 ms |
2276 KB |
Output is correct |
| 29 |
Correct |
51 ms |
2276 KB |
Output is correct |
| 30 |
Correct |
38 ms |
2276 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2276 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2276 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2276 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
2276 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
2276 KB |
Output isn't correct |
| 12 |
Incorrect |
3 ms |
2276 KB |
Output isn't correct |
| 13 |
Incorrect |
3 ms |
2276 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
2276 KB |
Output isn't correct |
| 15 |
Incorrect |
2 ms |
2276 KB |
Output isn't correct |
| 16 |
Incorrect |
19 ms |
2276 KB |
Output isn't correct |
| 17 |
Incorrect |
20 ms |
2276 KB |
Output isn't correct |
| 18 |
Incorrect |
19 ms |
2276 KB |
Output isn't correct |
| 19 |
Incorrect |
20 ms |
2276 KB |
Output isn't correct |
| 20 |
Incorrect |
12 ms |
2276 KB |
Output isn't correct |
| 21 |
Incorrect |
71 ms |
2276 KB |
Output isn't correct |
| 22 |
Incorrect |
72 ms |
2276 KB |
Output isn't correct |
| 23 |
Incorrect |
75 ms |
2276 KB |
Output isn't correct |
| 24 |
Incorrect |
73 ms |
2276 KB |
Output isn't correct |
| 25 |
Incorrect |
66 ms |
2276 KB |
Output isn't correct |
| 26 |
Incorrect |
72 ms |
2276 KB |
Output isn't correct |
| 27 |
Incorrect |
73 ms |
2276 KB |
Output isn't correct |
| 28 |
Incorrect |
73 ms |
2276 KB |
Output isn't correct |
| 29 |
Incorrect |
71 ms |
2276 KB |
Output isn't correct |
| 30 |
Incorrect |
44 ms |
2276 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
2276 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
2276 KB |
Output isn't correct |
