#include<iostream>
#include<string>
#include<set>
#include<utility>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include<stack>
#include"gap.h"
using namespace std;
long long findGap(int T, int N){
if(T == 1){
vector<int> a;
long long s = 0, t = 1000000000000000000;
while (true)
{
long long mn, mx;
if(s > t) break;
MinMax(s, t, &mn, &mx);
if(mn == -1) break;
if(mn < mx){
a.push_back(mn);
a.push_back(mx);
s = mn + 1;
t = mx - 1;
}
if(mn == mx){
a.push_back(mn);
break;
}
}
sort(a.begin(), a.end());
int ans = 0;
for(int i=0; i<N-1; i++){
ans = max(ans, a[i+1] - a[i]);
}
cout << ans << endl;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Expected EOF |
2 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
3 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
4 |
Incorrect |
3 ms |
384 KB |
Expected EOF |
5 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
6 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
7 |
Incorrect |
3 ms |
384 KB |
Expected EOF |
8 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
9 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
10 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
11 |
Incorrect |
3 ms |
304 KB |
Expected EOF |
12 |
Incorrect |
4 ms |
384 KB |
Expected EOF |
13 |
Incorrect |
3 ms |
384 KB |
Expected EOF |
14 |
Incorrect |
3 ms |
384 KB |
Expected EOF |
15 |
Incorrect |
3 ms |
384 KB |
Expected EOF |
16 |
Incorrect |
15 ms |
768 KB |
Expected EOF |
17 |
Incorrect |
16 ms |
768 KB |
Expected EOF |
18 |
Incorrect |
41 ms |
892 KB |
Expected EOF |
19 |
Incorrect |
16 ms |
768 KB |
Expected EOF |
20 |
Incorrect |
12 ms |
768 KB |
Expected EOF |
21 |
Incorrect |
63 ms |
1808 KB |
Expected EOF |
22 |
Incorrect |
61 ms |
1780 KB |
Expected EOF |
23 |
Incorrect |
60 ms |
1780 KB |
Expected EOF |
24 |
Incorrect |
59 ms |
1752 KB |
Expected EOF |
25 |
Incorrect |
48 ms |
1744 KB |
Expected EOF |
26 |
Incorrect |
56 ms |
1780 KB |
Expected EOF |
27 |
Incorrect |
57 ms |
1780 KB |
Expected EOF |
28 |
Incorrect |
59 ms |
1780 KB |
Expected EOF |
29 |
Incorrect |
82 ms |
1908 KB |
Expected EOF |
30 |
Incorrect |
45 ms |
1784 KB |
Expected EOF |
31 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
32 |
Incorrect |
2 ms |
384 KB |
Expected EOF |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
5 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
14 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
15 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
16 |
Incorrect |
10 ms |
512 KB |
Output isn't correct |
17 |
Incorrect |
8 ms |
512 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
512 KB |
Output isn't correct |
19 |
Incorrect |
9 ms |
512 KB |
Output isn't correct |
20 |
Incorrect |
6 ms |
512 KB |
Output isn't correct |
21 |
Incorrect |
34 ms |
1144 KB |
Output isn't correct |
22 |
Incorrect |
36 ms |
1016 KB |
Output isn't correct |
23 |
Incorrect |
43 ms |
1136 KB |
Output isn't correct |
24 |
Incorrect |
34 ms |
1060 KB |
Output isn't correct |
25 |
Incorrect |
23 ms |
1152 KB |
Output isn't correct |
26 |
Incorrect |
24 ms |
1152 KB |
Output isn't correct |
27 |
Incorrect |
29 ms |
1148 KB |
Output isn't correct |
28 |
Incorrect |
28 ms |
1152 KB |
Output isn't correct |
29 |
Incorrect |
29 ms |
1144 KB |
Output isn't correct |
30 |
Incorrect |
17 ms |
1152 KB |
Output isn't correct |
31 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |