# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
42687 |
2018-03-02T16:40:32 Z |
MatheusLealV |
Gap (APIO16_gap) |
C++14 |
|
82 ms |
3488 KB |
#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;
ll qtd = 0;
void solve(ll ini, ll fimi, ll best)
{
while(true)
{
qtd ++;
if(ini > fimi || qtd > N) break;
ll a, b, fim = ini + best;
MinMax(ini, fim, &a, &b);
if(a != -1 && b != -1) val.push_back(a), val.push_back(b);
ini = ini + best + 1;
}
}
ll findGap(int T, int N_)
{
ll best = 0, n = N_;
if(T == 1)
{
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
{
ll st, en, dx;
MinMax(0, inf, &st, &en);
if((en - st)%(n - 1) > 0) dx = 1 + (en - st)/(n - 1);
else dx = (en - st)/(n - 1);
solve(st, en, dx);
sort(val.begin(), val.end());
dx = 0;
for(int i = 1; i < val.size(); i++) dx = max(dx, val[i] - val[i - 1]);
return dx;
}
}
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i < val.size(); i++) dx = max(dx, val[i] - val[i - 1]);
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
248 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
392 KB |
Output is correct |
5 |
Correct |
1 ms |
412 KB |
Output is correct |
6 |
Correct |
2 ms |
464 KB |
Output is correct |
7 |
Correct |
2 ms |
464 KB |
Output is correct |
8 |
Correct |
1 ms |
464 KB |
Output is correct |
9 |
Correct |
1 ms |
484 KB |
Output is correct |
10 |
Correct |
1 ms |
484 KB |
Output is correct |
11 |
Correct |
2 ms |
484 KB |
Output is correct |
12 |
Correct |
2 ms |
484 KB |
Output is correct |
13 |
Correct |
2 ms |
484 KB |
Output is correct |
14 |
Correct |
2 ms |
484 KB |
Output is correct |
15 |
Correct |
2 ms |
484 KB |
Output is correct |
16 |
Correct |
15 ms |
948 KB |
Output is correct |
17 |
Correct |
14 ms |
948 KB |
Output is correct |
18 |
Correct |
16 ms |
948 KB |
Output is correct |
19 |
Correct |
14 ms |
948 KB |
Output is correct |
20 |
Correct |
10 ms |
948 KB |
Output is correct |
21 |
Correct |
53 ms |
2076 KB |
Output is correct |
22 |
Correct |
52 ms |
2076 KB |
Output is correct |
23 |
Correct |
53 ms |
2076 KB |
Output is correct |
24 |
Correct |
53 ms |
2076 KB |
Output is correct |
25 |
Correct |
44 ms |
2204 KB |
Output is correct |
26 |
Correct |
52 ms |
2204 KB |
Output is correct |
27 |
Correct |
62 ms |
2204 KB |
Output is correct |
28 |
Correct |
52 ms |
2204 KB |
Output is correct |
29 |
Correct |
54 ms |
2204 KB |
Output is correct |
30 |
Correct |
40 ms |
2204 KB |
Output is correct |
31 |
Correct |
1 ms |
2204 KB |
Output is correct |
32 |
Correct |
2 ms |
2204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2204 KB |
Output is correct |
2 |
Correct |
1 ms |
2204 KB |
Output is correct |
3 |
Correct |
1 ms |
2204 KB |
Output is correct |
4 |
Correct |
1 ms |
2204 KB |
Output is correct |
5 |
Correct |
1 ms |
2204 KB |
Output is correct |
6 |
Correct |
1 ms |
2204 KB |
Output is correct |
7 |
Correct |
2 ms |
2204 KB |
Output is correct |
8 |
Correct |
1 ms |
2204 KB |
Output is correct |
9 |
Correct |
1 ms |
2204 KB |
Output is correct |
10 |
Correct |
1 ms |
2204 KB |
Output is correct |
11 |
Correct |
2 ms |
2204 KB |
Output is correct |
12 |
Correct |
2 ms |
2204 KB |
Output is correct |
13 |
Correct |
3 ms |
2204 KB |
Output is correct |
14 |
Correct |
2 ms |
2204 KB |
Output is correct |
15 |
Correct |
2 ms |
2204 KB |
Output is correct |
16 |
Correct |
20 ms |
2204 KB |
Output is correct |
17 |
Correct |
20 ms |
2204 KB |
Output is correct |
18 |
Correct |
22 ms |
2204 KB |
Output is correct |
19 |
Correct |
21 ms |
2204 KB |
Output is correct |
20 |
Correct |
16 ms |
2204 KB |
Output is correct |
21 |
Correct |
82 ms |
2468 KB |
Output is correct |
22 |
Correct |
78 ms |
2468 KB |
Output is correct |
23 |
Correct |
76 ms |
2468 KB |
Output is correct |
24 |
Correct |
75 ms |
2468 KB |
Output is correct |
25 |
Correct |
72 ms |
3488 KB |
Output is correct |
26 |
Correct |
75 ms |
3488 KB |
Output is correct |
27 |
Correct |
74 ms |
3488 KB |
Output is correct |
28 |
Correct |
74 ms |
3488 KB |
Output is correct |
29 |
Correct |
79 ms |
3488 KB |
Output is correct |
30 |
Correct |
36 ms |
3488 KB |
Output is correct |
31 |
Correct |
1 ms |
3488 KB |
Output is correct |
32 |
Correct |
2 ms |
3488 KB |
Output is correct |