#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){
LL B = 1000000000000000000LL / N;
queue<pair<LL, LL>> kukan;
for(LL i=0; i<=1000000000000000000LL; i+=B){
kukan.push(MP(i,i+B-1));
}
vector<LL> v;
while(kukan.size() > 0){
LL m = kukan.front().first;
LL M = kukan.front().second;
kukan.pop();
LL tmp1, tmp2;
MinMax(m, M, &tmp1, &tmp2);
if(tmp1 == -1) continue;
v.PB(tmp1);
if(tmp1 == tmp2) continue;
v.PB(tmp2);
B = (tmp2 - tmp1) / sqrt(N);
for(LL i=tmp1+1; i<=tmp2-1; i+=B){
kukan.push(MP(i, min(i+B-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:62:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v.size(); i++){
~^~~~~~~~~
gap.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 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 |
1 ms |
380 KB |
Output is correct |
| 8 |
Correct |
3 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 |
4 ms |
384 KB |
Output is correct |
| 12 |
Correct |
4 ms |
384 KB |
Output is correct |
| 13 |
Correct |
3 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 |
19 ms |
964 KB |
Output is correct |
| 17 |
Correct |
16 ms |
896 KB |
Output is correct |
| 18 |
Correct |
21 ms |
896 KB |
Output is correct |
| 19 |
Correct |
17 ms |
896 KB |
Output is correct |
| 20 |
Correct |
13 ms |
984 KB |
Output is correct |
| 21 |
Correct |
65 ms |
2288 KB |
Output is correct |
| 22 |
Correct |
60 ms |
2288 KB |
Output is correct |
| 23 |
Correct |
61 ms |
2260 KB |
Output is correct |
| 24 |
Correct |
53 ms |
2288 KB |
Output is correct |
| 25 |
Correct |
52 ms |
2296 KB |
Output is correct |
| 26 |
Correct |
54 ms |
2288 KB |
Output is correct |
| 27 |
Correct |
60 ms |
2292 KB |
Output is correct |
| 28 |
Correct |
77 ms |
2284 KB |
Output is correct |
| 29 |
Correct |
56 ms |
2416 KB |
Output is correct |
| 30 |
Correct |
39 ms |
2288 KB |
Output is correct |
| 31 |
Correct |
2 ms |
412 KB |
Output is correct |
| 32 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
428 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Partially correct |
2 ms |
256 KB |
Partially correct |
| 4 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
384 KB |
Partially 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 |
2 ms |
384 KB |
Partially correct |
| 10 |
Runtime error |
608 ms |
525312 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 11 |
Partially correct |
6 ms |
640 KB |
Partially correct |
| 12 |
Partially correct |
5 ms |
672 KB |
Partially correct |
| 13 |
Partially correct |
5 ms |
640 KB |
Partially correct |
| 14 |
Partially correct |
5 ms |
640 KB |
Partially correct |
| 15 |
Partially correct |
4 ms |
384 KB |
Partially correct |
| 16 |
Partially correct |
230 ms |
18060 KB |
Partially correct |
| 17 |
Partially correct |
192 ms |
17708 KB |
Partially correct |
| 18 |
Partially correct |
273 ms |
17832 KB |
Partially correct |
| 19 |
Partially correct |
189 ms |
18088 KB |
Partially correct |
| 20 |
Runtime error |
701 ms |
525312 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 21 |
Partially correct |
1894 ms |
139420 KB |
Partially correct |
| 22 |
Partially correct |
1716 ms |
139320 KB |
Partially correct |
| 23 |
Partially correct |
1747 ms |
139224 KB |
Partially correct |
| 24 |
Partially correct |
1882 ms |
139036 KB |
Partially correct |
| 25 |
Partially correct |
103 ms |
4056 KB |
Partially correct |
| 26 |
Partially correct |
1688 ms |
139180 KB |
Partially correct |
| 27 |
Partially correct |
1741 ms |
139428 KB |
Partially correct |
| 28 |
Partially correct |
1640 ms |
139056 KB |
Partially correct |
| 29 |
Partially correct |
1787 ms |
139384 KB |
Partially correct |
| 30 |
Runtime error |
655 ms |
525312 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 31 |
Runtime error |
719 ms |
525312 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 32 |
Runtime error |
610 ms |
525312 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
