#include <bits/stdc++.h>
#include "gap.h"
void MinMax(long long, long long, long long*, long long*);
using ll = long long;
long long findGap(int T, int N)
{
if(T==2)
return 0;
else {
std::map<ll,bool> mapa;
ll l=-1,r=1e18+1;
while(mapa.size()!=N){
ll a,b;
MinMax(std::min(l+1,r-1),std::max(l+1,r-1),&a,&b);
if(a!=-1){
mapa[a]=true;
l=a;
}
if(b!=-1){
mapa[b]=true;
r=b;
}
if(a==b&&a==-1)break;
}
ll max=0;
std::vector<ll> vec;
for(auto&x:mapa)vec.push_back(x.first);
for(int i=1;i!=vec.size();++i)max=std::max(max,vec[i]-vec[i-1]);
return max;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:15:26: warning: comparison of integer expressions of different signedness: 'std::map<long long int, bool>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
15 | while(mapa.size()!=N){
| ~~~~~~~~~~~^~~
gap.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | for(int i=1;i!=vec.size();++i)max=std::max(max,vec[i]-vec[i-1]);
| ~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
0 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
208 KB |
Output is correct |
10 |
Correct |
0 ms |
208 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
464 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
14 ms |
2360 KB |
Output is correct |
17 |
Correct |
13 ms |
2416 KB |
Output is correct |
18 |
Correct |
14 ms |
2476 KB |
Output is correct |
19 |
Correct |
13 ms |
2472 KB |
Output is correct |
20 |
Correct |
13 ms |
2384 KB |
Output is correct |
21 |
Correct |
64 ms |
8624 KB |
Output is correct |
22 |
Correct |
60 ms |
8476 KB |
Output is correct |
23 |
Correct |
71 ms |
8476 KB |
Output is correct |
24 |
Correct |
68 ms |
8400 KB |
Output is correct |
25 |
Correct |
74 ms |
8392 KB |
Output is correct |
26 |
Correct |
58 ms |
8392 KB |
Output is correct |
27 |
Correct |
58 ms |
8476 KB |
Output is correct |
28 |
Correct |
60 ms |
8480 KB |
Output is correct |
29 |
Correct |
75 ms |
8504 KB |
Output is correct |
30 |
Correct |
64 ms |
8484 KB |
Output is correct |
31 |
Execution timed out |
3083 ms |
208 KB |
Time limit exceeded |
32 |
Execution timed out |
3093 ms |
208 KB |
Time limit exceeded |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
16 |
Incorrect |
5 ms |
428 KB |
Output isn't correct |
17 |
Incorrect |
5 ms |
428 KB |
Output isn't correct |
18 |
Incorrect |
5 ms |
464 KB |
Output isn't correct |
19 |
Incorrect |
4 ms |
464 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
464 KB |
Output isn't correct |
21 |
Incorrect |
19 ms |
1056 KB |
Output isn't correct |
22 |
Incorrect |
19 ms |
968 KB |
Output isn't correct |
23 |
Incorrect |
23 ms |
992 KB |
Output isn't correct |
24 |
Incorrect |
17 ms |
968 KB |
Output isn't correct |
25 |
Incorrect |
14 ms |
1000 KB |
Output isn't correct |
26 |
Incorrect |
16 ms |
1060 KB |
Output isn't correct |
27 |
Incorrect |
18 ms |
988 KB |
Output isn't correct |
28 |
Incorrect |
20 ms |
1008 KB |
Output isn't correct |
29 |
Incorrect |
18 ms |
1084 KB |
Output isn't correct |
30 |
Incorrect |
11 ms |
964 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |