#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
const long long INF = 1e18;
long long findGap(int T, int N) {
multiset < pair< long long,pair<long long,long long> > > st;
long long mn, mx;
MinMax(0ll,INF,&mn,&mx);
st.insert({-(mx-mn),{mn,mx}});
long long ans = 0;
if(N == 2){
return mx - mn;
}
if (T == 1){
for (int i=1;i<(N+1)/2;i++){
long long mmn, mmx;
MinMax(mn+1,mx-1,&mmn,&mmx);
ans = max(ans,mmn-mn);
ans = max(ans,mx-mmx);
mn = mmn;
mx = mmx;
}
ans = max(ans,mx-mn);
return ans;
}
long long dis = (mx-mn)/N;
vector < pair<long long,long long> > v;
for(long long i = mn; i <= mx; i++){
long long a, b;
MinMax(i,i+dis,&a,&b);
v.push_back({a,b});
}
for(int i = 0; i < v.size(); i++)
ans = max(ans,v[i].second-v[i].first);
return ans;
return 0;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:40:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < v.size(); i++)
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 17 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 18 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 19 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 21 |
Correct |
59 ms |
5144 KB |
Output is correct |
| 22 |
Correct |
63 ms |
5144 KB |
Output is correct |
| 23 |
Correct |
49 ms |
5144 KB |
Output is correct |
| 24 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 25 |
Correct |
43 ms |
5144 KB |
Output is correct |
| 26 |
Correct |
43 ms |
5144 KB |
Output is correct |
| 27 |
Correct |
63 ms |
5144 KB |
Output is correct |
| 28 |
Correct |
49 ms |
5144 KB |
Output is correct |
| 29 |
Correct |
56 ms |
5144 KB |
Output is correct |
| 30 |
Correct |
43 ms |
5144 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Memory limit exceeded |
776 ms |
524288 KB |
Memory limit exceeded |
| 3 |
Memory limit exceeded |
746 ms |
524288 KB |
Memory limit exceeded |
| 4 |
Memory limit exceeded |
853 ms |
524288 KB |
Memory limit exceeded |
| 5 |
Memory limit exceeded |
873 ms |
524288 KB |
Memory limit exceeded |
| 6 |
Memory limit exceeded |
1269 ms |
524288 KB |
Memory limit exceeded |
| 7 |
Memory limit exceeded |
1226 ms |
524288 KB |
Memory limit exceeded |
| 8 |
Memory limit exceeded |
1279 ms |
524288 KB |
Memory limit exceeded |
| 9 |
Memory limit exceeded |
1313 ms |
524288 KB |
Memory limit exceeded |
| 10 |
Incorrect |
99 ms |
29808 KB |
Output isn't correct |
| 11 |
Execution timed out |
2000 ms |
524288 KB |
Execution timed out |
| 12 |
Memory limit exceeded |
1929 ms |
524288 KB |
Memory limit exceeded |
| 13 |
Memory limit exceeded |
1973 ms |
524288 KB |
Memory limit exceeded |
| 14 |
Memory limit exceeded |
1906 ms |
524288 KB |
Memory limit exceeded |
| 15 |
Execution timed out |
2000 ms |
524288 KB |
Execution timed out |
| 16 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 17 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 18 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 19 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 20 |
Incorrect |
213 ms |
29808 KB |
Output isn't correct |
| 21 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 22 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 23 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 24 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 25 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 26 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 27 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 28 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 29 |
Execution timed out |
2000 ms |
398448 KB |
Execution timed out |
| 30 |
Incorrect |
299 ms |
54384 KB |
Output isn't correct |
| 31 |
Memory limit exceeded |
1443 ms |
524288 KB |
Memory limit exceeded |
| 32 |
Memory limit exceeded |
1209 ms |
524288 KB |
Memory limit exceeded |
