#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include "gap.h"
using namespace std;
long long findGap(int t, int n)
{
vector<long long> ve;
if (t == 1)
{
long long le = 0, ri = 1E18;
for (int i = 0; i < (n + 1) / 2; i++)
{
long long mi, ma;
MinMax(le, ri, &mi, &ma);
if (mi > -1)
{
ve.push_back(mi);
if (ma != mi)
ve.push_back(ma);
}
le = mi + 1; ri = ma - 1;
}
}
else
{
long long le, ri;
MinMax(0, 1E18, &le, &ri);
ve.push_back(le++); ve.push_back(ri--);
long long ga = (ri - le + 1) / (n - 1), mo = (ri - le + 1) % (n - 1);
for (int i = 1; i < n; i++)
{
long long mi, ma;
MinMax(le, le + ga + (i <= mo) - 1, &mi, &ma);
le += ga + (i <= mo);
if (mi > -1)
{
ve.push_back(mi);
if (ma != mi)
ve.push_back(ma);
}
}
}
sort(ve.begin(), ve.end());
long long ans = 0;
for (int i = 1; i < ve.size(); i++)
ans = max(ans, ve[i] - ve[i - 1]);
return ans;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:48:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i < ve.size(); i++)
~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
3 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
16 |
Correct |
14 ms |
896 KB |
Output is correct |
17 |
Correct |
18 ms |
896 KB |
Output is correct |
18 |
Correct |
18 ms |
896 KB |
Output is correct |
19 |
Correct |
16 ms |
896 KB |
Output is correct |
20 |
Correct |
13 ms |
1024 KB |
Output is correct |
21 |
Correct |
54 ms |
2288 KB |
Output is correct |
22 |
Correct |
62 ms |
2388 KB |
Output is correct |
23 |
Correct |
57 ms |
2416 KB |
Output is correct |
24 |
Correct |
62 ms |
2292 KB |
Output is correct |
25 |
Correct |
51 ms |
2288 KB |
Output is correct |
26 |
Correct |
51 ms |
2288 KB |
Output is correct |
27 |
Correct |
51 ms |
2288 KB |
Output is correct |
28 |
Correct |
51 ms |
2288 KB |
Output is correct |
29 |
Correct |
52 ms |
2288 KB |
Output is correct |
30 |
Correct |
41 ms |
2288 KB |
Output is correct |
31 |
Correct |
3 ms |
384 KB |
Output is correct |
32 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
3 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
3 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
4 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
412 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
18 ms |
888 KB |
Output is correct |
17 |
Correct |
19 ms |
868 KB |
Output is correct |
18 |
Correct |
17 ms |
944 KB |
Output is correct |
19 |
Correct |
17 ms |
896 KB |
Output is correct |
20 |
Correct |
10 ms |
512 KB |
Output is correct |
21 |
Correct |
62 ms |
2260 KB |
Output is correct |
22 |
Correct |
63 ms |
2288 KB |
Output is correct |
23 |
Correct |
71 ms |
2424 KB |
Output is correct |
24 |
Correct |
77 ms |
2292 KB |
Output is correct |
25 |
Correct |
61 ms |
2288 KB |
Output is correct |
26 |
Correct |
69 ms |
2288 KB |
Output is correct |
27 |
Correct |
68 ms |
2228 KB |
Output is correct |
28 |
Correct |
65 ms |
2240 KB |
Output is correct |
29 |
Correct |
68 ms |
2288 KB |
Output is correct |
30 |
Correct |
38 ms |
1528 KB |
Output is correct |
31 |
Correct |
1 ms |
384 KB |
Output is correct |
32 |
Correct |
2 ms |
384 KB |
Output is correct |