#include"bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define PB push_back
#define MP make_pair
#define MOD 1000000007
#include"gap.h"
//MinMax(LL s, LL t, LL& mn, LL& mx)
//aiのうちs以上の最小の数がmnに、aiのうちt以下の最大値がmxに格納される
//aiの差分のうち最大のものを返す
LL findGap(int T, int N){
if(T == 1){
LL m = 0LL;
LL M = 1000000000000000000LL;
vector<LL> v;
for(int i=0; i<(N+1)/2; i++){
LL tmp1, tmp2;
MinMax(m, M, &tmp1, &tmp2);
v.PB(tmp1);
v.PB(tmp2);
m = tmp1+1;
M = tmp2-1;
}
sort(v.begin(), v.end());
LL ans = 0;
for(int i=1; i<v.size(); i++){
ans = max(ans, v[i] - v[i-1]);
}
return ans;
}
if(T == 2){
vector<LL> v;
LL tmp1, tmp2;
MinMax(0, 1000000000000000001LL, &tmp1, &tmp2);
v.PB(tmp1);
v.PB(tmp2);
LL B = ceil((double)(tmp2-tmp1)/N);
queue<pair<LL, LL>> kukan;
for(LL i=tmp1+1; i<=tmp2-1; i+=B){
kukan.push(MP(i, min(i+B-1,tmp2-1)));
}
while(kukan.size() > 0){
LL m = kukan.front().first;
LL M = kukan.front().second;
kukan.pop();
MinMax(m, M, &tmp1, &tmp2);
if(tmp1 == -1) continue;
v.PB(tmp1);
if(tmp1 == tmp2) continue;
v.PB(tmp2);
/*
B = (tmp2 - tmp1) / 4 + 1;
for(LL i=tmp1+1; i<=tmp2-1; i+=B){
kukan.push(MP(i, min(i+B-1, tmp2-1)));
}*/
kukan.push(MP(tmp1+1,tmp2-1));
}
sort(v.begin(), v.end());
LL ans = 0;
for(int i=1; i<v.size(); i++){
ans = max(ans, v[i] - v[i-1]);
}
return ans;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v.size(); i++){
~^~~~~~~~~
gap.cpp:68:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v.size(); i++){
~^~~~~~~~~
gap.cpp:73:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
3 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
3 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Correct |
2 ms |
384 KB |
Output is correct |
| 14 |
Correct |
3 ms |
384 KB |
Output is correct |
| 15 |
Correct |
3 ms |
384 KB |
Output is correct |
| 16 |
Correct |
14 ms |
896 KB |
Output is correct |
| 17 |
Correct |
14 ms |
896 KB |
Output is correct |
| 18 |
Correct |
16 ms |
1152 KB |
Output is correct |
| 19 |
Correct |
19 ms |
896 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1024 KB |
Output is correct |
| 21 |
Correct |
50 ms |
2288 KB |
Output is correct |
| 22 |
Correct |
56 ms |
2288 KB |
Output is correct |
| 23 |
Correct |
56 ms |
2372 KB |
Output is correct |
| 24 |
Correct |
53 ms |
2288 KB |
Output is correct |
| 25 |
Correct |
49 ms |
2288 KB |
Output is correct |
| 26 |
Correct |
56 ms |
2288 KB |
Output is correct |
| 27 |
Correct |
58 ms |
2288 KB |
Output is correct |
| 28 |
Correct |
58 ms |
2288 KB |
Output is correct |
| 29 |
Correct |
52 ms |
2336 KB |
Output is correct |
| 30 |
Correct |
48 ms |
2420 KB |
Output is correct |
| 31 |
Correct |
2 ms |
384 KB |
Output is correct |
| 32 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 4 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 9 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 10 |
Runtime error |
2 ms |
384 KB |
Execution failed because the return code was nonzero |
| 11 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 12 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 13 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 14 |
Partially correct |
4 ms |
384 KB |
Partially correct |
| 15 |
Correct |
3 ms |
384 KB |
Output is correct |
| 16 |
Partially correct |
21 ms |
1280 KB |
Partially correct |
| 17 |
Partially correct |
25 ms |
1272 KB |
Partially correct |
| 18 |
Partially correct |
31 ms |
1408 KB |
Partially correct |
| 19 |
Partially correct |
24 ms |
1408 KB |
Partially correct |
| 20 |
Runtime error |
12 ms |
896 KB |
Execution failed because the return code was nonzero |
| 21 |
Partially correct |
102 ms |
3936 KB |
Partially correct |
| 22 |
Partially correct |
92 ms |
3932 KB |
Partially correct |
| 23 |
Partially correct |
91 ms |
4092 KB |
Partially correct |
| 24 |
Partially correct |
97 ms |
3980 KB |
Partially correct |
| 25 |
Correct |
70 ms |
4032 KB |
Output is correct |
| 26 |
Partially correct |
121 ms |
3980 KB |
Partially correct |
| 27 |
Partially correct |
98 ms |
3972 KB |
Partially correct |
| 28 |
Partially correct |
103 ms |
3956 KB |
Partially correct |
| 29 |
Partially correct |
91 ms |
3944 KB |
Partially correct |
| 30 |
Runtime error |
42 ms |
2828 KB |
Execution failed because the return code was nonzero |
| 31 |
Runtime error |
2 ms |
384 KB |
Execution failed because the return code was nonzero |
| 32 |
Runtime error |
2 ms |
256 KB |
Execution failed because the return code was nonzero |
