#include "gap.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using namespace std;
using lli=long long;
using pll=pair<lli,lli>;
const lli INF=1000000000000000000ll;
lli sub1(int n) {
lli mx=0, lv=0, rv=1000000000000000000ll;
for(int i=0;i<(n+1)/2;i++) {
lli s=lv, t=rv, l, r;
MinMax(s+1, t-1, &l, &r);
if(i!=0) {
mx = max(mx, l-lv);
mx = max(mx, rv-r);
}
lv = l; rv = r;
}
if(!(n&1)) mx = max(mx, rv-lv);
return mx;
}
lli mx=0;
int SEG = 2;
pll dfs(lli lv,lli rv) {
if(lv>rv) return pll(-1,-1);
lli s=lv, t=rv, l,r;
MinMax(s,t,&l,&r);
if(l==-1) return pll(-1, -1);
else if(l==r) return pll(l,l);
else {
pll lt = dfs(l+1, (l+r)/2);
pll rt = dfs((l+r)/2+1, r-1);
if(lt.fi!=-1) {
mx = max(mx, lt.fi-l);
} else if(rt.fi!=-1) {
mx = max(mx, rt.fi-l);
} else mx = max(mx, r-l);
if(rt.se!=-1) mx = max(mx,r-rt.se);
else if(lt.se!=-1) mx = max(mx, r-lt.se);
else mx = max(mx, (r-l));
if(lt.se!=-1 && rt.fi!=-1) mx = max(mx, rt.fi-lt.se);
return pll(l, r);
}
}
lli sub2(int n) {
dfs(0, INF);
return mx;
}
long long findGap(int T, int N)
{
mx=0;
if(N<=10 || T==1) return sub1(N);
else return sub2(N);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
3 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 |
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 |
512 KB |
Output is correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
4 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
14 ms |
512 KB |
Output is correct |
17 |
Correct |
13 ms |
512 KB |
Output is correct |
18 |
Correct |
15 ms |
512 KB |
Output is correct |
19 |
Correct |
16 ms |
512 KB |
Output is correct |
20 |
Correct |
12 ms |
512 KB |
Output is correct |
21 |
Correct |
52 ms |
1144 KB |
Output is correct |
22 |
Correct |
50 ms |
1052 KB |
Output is correct |
23 |
Correct |
45 ms |
1144 KB |
Output is correct |
24 |
Correct |
49 ms |
1152 KB |
Output is correct |
25 |
Correct |
39 ms |
1272 KB |
Output is correct |
26 |
Correct |
58 ms |
1152 KB |
Output is correct |
27 |
Correct |
53 ms |
1144 KB |
Output is correct |
28 |
Correct |
51 ms |
1152 KB |
Output is correct |
29 |
Correct |
49 ms |
1272 KB |
Output is correct |
30 |
Correct |
35 ms |
1152 KB |
Output is correct |
31 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
32 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 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 |
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 |
Partially correct |
2 ms |
384 KB |
Partially correct |
11 |
Partially correct |
2 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 |
3 ms |
384 KB |
Partially correct |
15 |
Partially correct |
3 ms |
384 KB |
Partially correct |
16 |
Partially correct |
17 ms |
512 KB |
Partially correct |
17 |
Partially correct |
21 ms |
512 KB |
Partially correct |
18 |
Partially correct |
18 ms |
512 KB |
Partially correct |
19 |
Partially correct |
21 ms |
640 KB |
Partially correct |
20 |
Partially correct |
11 ms |
512 KB |
Partially correct |
21 |
Partially correct |
61 ms |
1152 KB |
Partially correct |
22 |
Partially correct |
70 ms |
1280 KB |
Partially correct |
23 |
Partially correct |
66 ms |
1272 KB |
Partially correct |
24 |
Partially correct |
66 ms |
1076 KB |
Partially correct |
25 |
Partially correct |
53 ms |
1280 KB |
Partially correct |
26 |
Partially correct |
71 ms |
1152 KB |
Partially correct |
27 |
Partially correct |
88 ms |
1144 KB |
Partially correct |
28 |
Partially correct |
71 ms |
1152 KB |
Partially correct |
29 |
Partially correct |
73 ms |
1220 KB |
Partially correct |
30 |
Partially correct |
44 ms |
1152 KB |
Partially correct |
31 |
Partially correct |
2 ms |
384 KB |
Partially correct |
32 |
Partially correct |
2 ms |
384 KB |
Partially correct |