| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 573980 |
2022-06-07T14:15:27 Z |
cadmiumsky |
Gap (APIO16_gap) |
C++14 |
|
62 ms |
3284 KB |
#include "gap.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
ll findGap(int t, int n) {
// cerr << t << ' ' << n << '\n';
ll l = 0, r = 1e18;
if(t == 1) {
vector<ll> elem[2];
l--;
r++;
while(l <= r) {
MinMax(l + 1, r - 1, &l, &r);
if(l == -1)
break;
elem[0].push_back(l);
if(l != r)
elem[1].push_back(r);
}
reverse(all(elem[1]));
copy(all(elem[1]), back_inserter(elem[0]));
ll mx = -1;
for(int i = 1; i < elem[0].size(); i++)
mx = max(mx, elem[0][i] - elem[0][i - 1]);
return mx;
}
MinMax(l, r, &l, &r);
ll mx = r;
vector<pii> v;
ll minl = (r - l + n - 2) / (n - 1);
v.emplace_back(l, l);
// cerr << l << ' ' << r << ' ' << minl << '\n';
for(ll i = l; i < mx; i += minl) {
// cerr << i << ' ' << i + minl << ' ' << mx << '\n';
MinMax(i, min(mx, i + minl) - 1, &l, &r);
if(l == -1)
continue;
v.emplace_back(l, r);
}
v.emplace_back(mx, mx);
mx = -1;
for(int i = 1; i < v.size(); i++)
mx = max(v[i].first - v[i - 1].second, mx);
return mx;
}
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | for(int i = 1; i < elem[0].size(); i++)
| ~~^~~~~~~~~~~~~~~~
gap.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
44 | for(int i = 1; i < v.size(); i++)
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Runtime error |
0 ms |
208 KB |
Execution failed because the return code was nonzero |
| 3 |
Runtime error |
1 ms |
208 KB |
Execution failed because the return code was nonzero |
| 4 |
Runtime error |
0 ms |
208 KB |
Execution failed because the return code was nonzero |
| 5 |
Runtime error |
0 ms |
208 KB |
Execution failed because the return code was nonzero |
| 6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 10 |
Runtime error |
0 ms |
208 KB |
Execution failed because the return code was nonzero |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 16 |
Incorrect |
13 ms |
932 KB |
Output isn't correct |
| 17 |
Incorrect |
12 ms |
976 KB |
Output isn't correct |
| 18 |
Incorrect |
10 ms |
924 KB |
Output isn't correct |
| 19 |
Incorrect |
11 ms |
976 KB |
Output isn't correct |
| 20 |
Runtime error |
7 ms |
720 KB |
Execution failed because the return code was nonzero |
| 21 |
Incorrect |
45 ms |
2640 KB |
Output isn't correct |
| 22 |
Incorrect |
42 ms |
2616 KB |
Output isn't correct |
| 23 |
Incorrect |
34 ms |
2576 KB |
Output isn't correct |
| 24 |
Incorrect |
42 ms |
2540 KB |
Output isn't correct |
| 25 |
Incorrect |
32 ms |
2576 KB |
Output isn't correct |
| 26 |
Incorrect |
42 ms |
2580 KB |
Output isn't correct |
| 27 |
Incorrect |
52 ms |
2584 KB |
Output isn't correct |
| 28 |
Incorrect |
51 ms |
2636 KB |
Output isn't correct |
| 29 |
Incorrect |
37 ms |
2572 KB |
Output isn't correct |
| 30 |
Runtime error |
28 ms |
1996 KB |
Execution failed because the return code was nonzero |
| 31 |
Runtime error |
0 ms |
208 KB |
Execution failed because the return code was nonzero |
| 32 |
Runtime error |
0 ms |
208 KB |
Execution failed because the return code was nonzero |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
316 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
336 KB |
Output is correct |
| 12 |
Correct |
2 ms |
336 KB |
Output is correct |
| 13 |
Correct |
2 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
14 ms |
860 KB |
Output is correct |
| 17 |
Correct |
13 ms |
860 KB |
Output is correct |
| 18 |
Correct |
12 ms |
892 KB |
Output is correct |
| 19 |
Correct |
12 ms |
848 KB |
Output is correct |
| 20 |
Correct |
6 ms |
532 KB |
Output is correct |
| 21 |
Correct |
54 ms |
2188 KB |
Output is correct |
| 22 |
Correct |
49 ms |
2204 KB |
Output is correct |
| 23 |
Correct |
61 ms |
2176 KB |
Output is correct |
| 24 |
Correct |
62 ms |
2228 KB |
Output is correct |
| 25 |
Correct |
46 ms |
3284 KB |
Output is correct |
| 26 |
Correct |
55 ms |
2208 KB |
Output is correct |
| 27 |
Correct |
48 ms |
2204 KB |
Output is correct |
| 28 |
Correct |
48 ms |
2244 KB |
Output is correct |
| 29 |
Correct |
51 ms |
2188 KB |
Output is correct |
| 30 |
Correct |
26 ms |
1396 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
