| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 888341 |
2023-12-17T02:08:47 Z |
12345678 |
Gap (APIO16_gap) |
C++17 |
|
47 ms |
3996 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long findGap(int T, int N)
{
if (T==1)
{
ll x=0, y=1e18, a, b, idx=0, mx=0;
vector<ll> v;
while (v.size()<N)
{
MinMax(x, y, &a, &b);
if (a==b) v.push_back(a);
else v.push_back(a), v.push_back(b);
x=a+1; y=b-1;
}
sort(v.begin(), v.end());
for (int i=1; i<v.size(); i++) mx=max(mx, v[i]-v[i-1]);
return mx;
}
else
{
ll x=0, y=1e18, mn, mx, mmn, mmx, res=0, cnt=0, lst;
vector<ll> v;
MinMax(x, y, &mmn, &mmx);
if (mmx-mmn+1<N+1) return 1;
ll gap=(mmx-mmn-1)/(N-1), rem=(mmx-mmn-1)%(N-1);
v.push_back(mmn);
v.push_back(mmx);
lst=mmn+1;
for (ll i=mmn+1; i<=mmx-1&&cnt<rem; i+=gap+1, cnt++)
{
MinMax(i, i+gap, &mn, &mx);
lst=i+gap+1;
if (mn==-1) continue;
v.push_back(mn);
if (mn!=mx) v.push_back(mx);
}
for (ll i=lst; i<=mmx-1; i+=gap)
{
MinMax(i, i+gap-1, &mn, &mx);
if (mn==-1) continue;
v.push_back(mn);
if (mn!=mx) v.push_back(mx);
}
sort(v.begin(), v.end());
for (int i=1; i<v.size(); i++) res=max(res, v[i]-v[i-1]);
return res;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:15:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
15 | while (v.size()<N)
| ~~~~~~~~^~
gap.cpp:23:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for (int i=1; i<v.size(); i++) mx=max(mx, v[i]-v[i-1]);
| ~^~~~~~~~~
gap.cpp:13:31: warning: unused variable 'idx' [-Wunused-variable]
13 | ll x=0, y=1e18, a, b, idx=0, mx=0;
| ^~~
gap.cpp:52:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for (int i=1; i<v.size(); i++) res=max(res, v[i]-v[i-1]);
| ~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2644 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2844 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2836 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2836 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2912 KB |
Output is correct |
| 20 |
Correct |
7 ms |
2808 KB |
Output is correct |
| 21 |
Correct |
31 ms |
3992 KB |
Output is correct |
| 22 |
Correct |
31 ms |
3992 KB |
Output is correct |
| 23 |
Correct |
31 ms |
3812 KB |
Output is correct |
| 24 |
Correct |
32 ms |
3952 KB |
Output is correct |
| 25 |
Correct |
28 ms |
3984 KB |
Output is correct |
| 26 |
Correct |
31 ms |
3992 KB |
Output is correct |
| 27 |
Correct |
31 ms |
3996 KB |
Output is correct |
| 28 |
Correct |
31 ms |
3992 KB |
Output is correct |
| 29 |
Correct |
31 ms |
3988 KB |
Output is correct |
| 30 |
Correct |
27 ms |
3988 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2648 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 16 |
Correct |
10 ms |
2840 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2832 KB |
Output is correct |
| 18 |
Correct |
10 ms |
2844 KB |
Output is correct |
| 19 |
Correct |
11 ms |
2844 KB |
Output is correct |
| 20 |
Correct |
5 ms |
2568 KB |
Output is correct |
| 21 |
Correct |
42 ms |
3992 KB |
Output is correct |
| 22 |
Correct |
45 ms |
3980 KB |
Output is correct |
| 23 |
Correct |
42 ms |
3996 KB |
Output is correct |
| 24 |
Correct |
41 ms |
3988 KB |
Output is correct |
| 25 |
Correct |
38 ms |
3996 KB |
Output is correct |
| 26 |
Correct |
41 ms |
3984 KB |
Output is correct |
| 27 |
Correct |
46 ms |
3980 KB |
Output is correct |
| 28 |
Correct |
42 ms |
3912 KB |
Output is correct |
| 29 |
Correct |
47 ms |
3960 KB |
Output is correct |
| 30 |
Correct |
23 ms |
3104 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
