# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1083382 |
2024-09-03T04:07:36 Z |
djs100201 |
Gap (APIO16_gap) |
C++17 |
|
2000 ms |
524288 KB |
#include "gap.h"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll findGap(int T, int N) {
if (T == 1) {
vector<ll> res(N);
ll l = 0, r = 1e18, mn, mx, lidx = 0, ridx = N - 1;
for (int i = 0; i < (N + 1) / 2; i++) {
MinMax(l, r, &mn, &mx);
res[lidx++] = mn, res[ridx--] = mx;
l = mn + 1, r = mx - 1;
}
ll ret = 0;
for (int i = 1; i < N; i++)
ret = max(ret, res[i] - res[i - 1]);
return ret;
} else {
ll l = 0, r = 1e18, ret = 0, mn, mx;
MinMax(l, r, &mn, &mx);
r = mx;
vector<ll> R;
ll gap = mx - mn, new_gap = gap / N;
R.push_back(mn);
ll x = mn;
while (1) {
MinMax(x, x + new_gap, &mn, &mx);
if (mx == -1) {
// 사이에 없으면...
// 걍 넘기자
x += new_gap + 1;
} else {
R.push_back(mn);
x = mx;
if (mn == r)
break;
}
}
for (int i = 1; i < R.size(); i++)
ret = max(ret, R[i] - R[i - 1]);
return ret;
}
}
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for (int i = 1; i < R.size(); i++)
| ~~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
7 ms |
600 KB |
Output is correct |
17 |
Correct |
7 ms |
660 KB |
Output is correct |
18 |
Correct |
7 ms |
660 KB |
Output is correct |
19 |
Correct |
8 ms |
856 KB |
Output is correct |
20 |
Correct |
5 ms |
652 KB |
Output is correct |
21 |
Correct |
27 ms |
1880 KB |
Output is correct |
22 |
Correct |
26 ms |
1880 KB |
Output is correct |
23 |
Correct |
26 ms |
1880 KB |
Output is correct |
24 |
Correct |
25 ms |
1828 KB |
Output is correct |
25 |
Correct |
23 ms |
1880 KB |
Output is correct |
26 |
Correct |
27 ms |
1880 KB |
Output is correct |
27 |
Correct |
26 ms |
1880 KB |
Output is correct |
28 |
Correct |
25 ms |
1880 KB |
Output is correct |
29 |
Correct |
25 ms |
1880 KB |
Output is correct |
30 |
Correct |
21 ms |
1880 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
710 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Runtime error |
1048 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Runtime error |
988 ms |
524288 KB |
Execution killed with signal 9 |
4 |
Runtime error |
1028 ms |
524288 KB |
Execution killed with signal 9 |
5 |
Runtime error |
992 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Runtime error |
1445 ms |
524288 KB |
Execution killed with signal 9 |
7 |
Runtime error |
1495 ms |
524288 KB |
Execution killed with signal 9 |
8 |
Runtime error |
1449 ms |
524288 KB |
Execution killed with signal 9 |
9 |
Runtime error |
1576 ms |
524288 KB |
Execution killed with signal 9 |
10 |
Runtime error |
1770 ms |
524288 KB |
Execution killed with signal 9 |
11 |
Execution timed out |
2478 ms |
524288 KB |
Time limit exceeded |
12 |
Execution timed out |
2420 ms |
524288 KB |
Time limit exceeded |
13 |
Execution timed out |
2430 ms |
524288 KB |
Time limit exceeded |
14 |
Execution timed out |
2439 ms |
524288 KB |
Time limit exceeded |
15 |
Execution timed out |
2368 ms |
524288 KB |
Time limit exceeded |
16 |
Execution timed out |
3046 ms |
263384 KB |
Time limit exceeded |
17 |
Execution timed out |
3037 ms |
263412 KB |
Time limit exceeded |
18 |
Execution timed out |
3086 ms |
263332 KB |
Time limit exceeded |
19 |
Execution timed out |
3082 ms |
263276 KB |
Time limit exceeded |
20 |
Execution timed out |
3070 ms |
263348 KB |
Time limit exceeded |
21 |
Execution timed out |
3072 ms |
263820 KB |
Time limit exceeded |
22 |
Execution timed out |
3013 ms |
263920 KB |
Time limit exceeded |
23 |
Execution timed out |
3048 ms |
263932 KB |
Time limit exceeded |
24 |
Execution timed out |
3039 ms |
263948 KB |
Time limit exceeded |
25 |
Execution timed out |
3083 ms |
264016 KB |
Time limit exceeded |
26 |
Execution timed out |
3046 ms |
263896 KB |
Time limit exceeded |
27 |
Execution timed out |
3055 ms |
263848 KB |
Time limit exceeded |
28 |
Execution timed out |
3084 ms |
263832 KB |
Time limit exceeded |
29 |
Execution timed out |
3064 ms |
263844 KB |
Time limit exceeded |
30 |
Execution timed out |
3052 ms |
263848 KB |
Time limit exceeded |
31 |
Runtime error |
1608 ms |
524288 KB |
Execution killed with signal 9 |
32 |
Runtime error |
1538 ms |
524288 KB |
Execution killed with signal 9 |