#include "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>
using namespace std;
const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
long long findGap(int T, int N)
{
if(T == 1)
{
long long l = 0;
long long r = inf;
long long rez = 0;
vector<long long> nizl;
vector<long long> nizr;
while(nizl.size() + nizr.size() < N && l<=r)
{
long long a;
long long b;
MinMax(l, r, &a ,&b);
if(a==-1)break;
l = a+1;
r = b-1;
if(a!=b)
{
nizl.push_back(a);
nizr.push_back(b);
}
else nizl.pb(a);
}
reverse(all(nizr));
vector<long long> merged(nizl.size()+ nizr.size());
merge(all(nizl), all(nizr), merged.begin());
for(int i=0; i<N-1; i++) rez = max(rez, merged[i+1] - merged[i]);
return rez;
}
else
{
long long l = 0;
long long r = inf;
long long rez = 0;
vector<long long> niz;
MinMax(l, r, &l ,&r);
if(N==2)return r-l;
long long razlika = (r-l-2) / (N-2);
if(razlika == 0)razlika++;
for(int i=l+1; i<=r; i+= razlika)
{
long long a;
long long b;
MinMax(i, min(i+razlika, r), &a ,&b);
if(a==-1)continue;
niz.pb(a);
if(a!=b)niz.pb(b);
}
sort(all(niz));
for(int i=0; i<niz.size()-1; i++) rez = max(rez, niz[i+1] - niz[i]);
return rez;
}
}
/*
2 4
2 3 6 8
*/
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:26:41: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
26 | while(nizl.size() + nizr.size() < N && l<=r)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
gap.cpp:67:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for(int i=0; i<niz.size()-1; i++) rez = max(rez, niz[i+1] - niz[i]);
| ~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
2392 KB |
Output is correct |
3 |
Correct |
1 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 |
2392 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 |
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 |
2392 KB |
Output is correct |
16 |
Correct |
7 ms |
2904 KB |
Output is correct |
17 |
Correct |
7 ms |
2904 KB |
Output is correct |
18 |
Correct |
7 ms |
3084 KB |
Output is correct |
19 |
Correct |
7 ms |
2904 KB |
Output is correct |
20 |
Correct |
6 ms |
2904 KB |
Output is correct |
21 |
Correct |
29 ms |
4348 KB |
Output is correct |
22 |
Correct |
36 ms |
4476 KB |
Output is correct |
23 |
Correct |
28 ms |
4476 KB |
Output is correct |
24 |
Correct |
32 ms |
4468 KB |
Output is correct |
25 |
Correct |
23 ms |
4368 KB |
Output is correct |
26 |
Correct |
37 ms |
4468 KB |
Output is correct |
27 |
Correct |
30 ms |
4560 KB |
Output is correct |
28 |
Correct |
26 ms |
4352 KB |
Output is correct |
29 |
Correct |
28 ms |
4488 KB |
Output is correct |
30 |
Correct |
21 ms |
4476 KB |
Output is correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Runtime error |
1084 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Runtime error |
1066 ms |
524288 KB |
Execution killed with signal 9 |
4 |
Runtime error |
1133 ms |
524288 KB |
Execution killed with signal 9 |
5 |
Correct |
1 ms |
2392 KB |
Output is correct |
6 |
Runtime error |
1636 ms |
524288 KB |
Execution killed with signal 9 |
7 |
Runtime error |
1024 ms |
524288 KB |
Execution killed with signal 9 |
8 |
Execution timed out |
3061 ms |
2392 KB |
Time limit exceeded |
9 |
Runtime error |
1545 ms |
524288 KB |
Execution killed with signal 9 |
10 |
Correct |
1 ms |
2392 KB |
Output is correct |
11 |
Execution timed out |
3091 ms |
2392 KB |
Time limit exceeded |
12 |
Execution timed out |
2484 ms |
524288 KB |
Time limit exceeded |
13 |
Execution timed out |
2486 ms |
524288 KB |
Time limit exceeded |
14 |
Runtime error |
1402 ms |
524288 KB |
Execution killed with signal 9 |
15 |
Execution timed out |
3058 ms |
133832 KB |
Time limit exceeded |
16 |
Execution timed out |
3017 ms |
2392 KB |
Time limit exceeded |
17 |
Execution timed out |
3061 ms |
2392 KB |
Time limit exceeded |
18 |
Execution timed out |
3047 ms |
2392 KB |
Time limit exceeded |
19 |
Execution timed out |
3062 ms |
2392 KB |
Time limit exceeded |
20 |
Partially correct |
5 ms |
2392 KB |
Partially correct |
21 |
Execution timed out |
2269 ms |
524288 KB |
Time limit exceeded |
22 |
Execution timed out |
3039 ms |
2648 KB |
Time limit exceeded |
23 |
Execution timed out |
3027 ms |
2780 KB |
Time limit exceeded |
24 |
Execution timed out |
2218 ms |
524288 KB |
Time limit exceeded |
25 |
Execution timed out |
3065 ms |
134256 KB |
Time limit exceeded |
26 |
Execution timed out |
3070 ms |
265584 KB |
Time limit exceeded |
27 |
Execution timed out |
3069 ms |
265408 KB |
Time limit exceeded |
28 |
Execution timed out |
3076 ms |
265412 KB |
Time limit exceeded |
29 |
Execution timed out |
3100 ms |
2648 KB |
Time limit exceeded |
30 |
Partially correct |
23 ms |
3160 KB |
Partially correct |
31 |
Runtime error |
1164 ms |
524288 KB |
Execution killed with signal 9 |
32 |
Execution timed out |
3083 ms |
300732 KB |
Time limit exceeded |