#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
typedef pair<int32_t, int32_t> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 200010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
long long findGap(int T, int N)
{
ll mx = 1, x = 0, _;
while (x != -1 && x < (ll)1e18){
ll amt = mx;
ll res = -1;
while (res == -1 && x + amt - 1 <= (ll)1e18){
MinMax(x+1,x+amt,&res,&_);
amt <<= 1;
}
mx = max(mx, res - x);
x = res;
}
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
13 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
14 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
16 |
Incorrect |
15 ms |
524 KB |
Output isn't correct |
17 |
Incorrect |
13 ms |
484 KB |
Output isn't correct |
18 |
Incorrect |
14 ms |
464 KB |
Output isn't correct |
19 |
Incorrect |
14 ms |
520 KB |
Output isn't correct |
20 |
Incorrect |
10 ms |
464 KB |
Output isn't correct |
21 |
Incorrect |
53 ms |
1080 KB |
Output isn't correct |
22 |
Incorrect |
57 ms |
1004 KB |
Output isn't correct |
23 |
Incorrect |
53 ms |
1056 KB |
Output isn't correct |
24 |
Incorrect |
54 ms |
1084 KB |
Output isn't correct |
25 |
Incorrect |
49 ms |
1064 KB |
Output isn't correct |
26 |
Incorrect |
54 ms |
1056 KB |
Output isn't correct |
27 |
Incorrect |
51 ms |
1084 KB |
Output isn't correct |
28 |
Incorrect |
52 ms |
1064 KB |
Output isn't correct |
29 |
Incorrect |
56 ms |
1080 KB |
Output isn't correct |
30 |
Incorrect |
42 ms |
1076 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
208 KB |
Partially correct |
2 |
Partially correct |
1 ms |
208 KB |
Partially correct |
3 |
Partially correct |
0 ms |
208 KB |
Partially correct |
4 |
Partially correct |
1 ms |
208 KB |
Partially correct |
5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
6 |
Partially correct |
0 ms |
208 KB |
Partially correct |
7 |
Partially correct |
0 ms |
208 KB |
Partially correct |
8 |
Partially correct |
1 ms |
208 KB |
Partially correct |
9 |
Partially correct |
0 ms |
208 KB |
Partially correct |
10 |
Partially correct |
1 ms |
208 KB |
Partially correct |
11 |
Partially correct |
1 ms |
336 KB |
Partially correct |
12 |
Partially correct |
1 ms |
208 KB |
Partially correct |
13 |
Partially correct |
1 ms |
336 KB |
Partially correct |
14 |
Partially correct |
1 ms |
336 KB |
Partially correct |
15 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
16 |
Partially correct |
17 ms |
488 KB |
Partially correct |
17 |
Partially correct |
12 ms |
512 KB |
Partially correct |
18 |
Partially correct |
14 ms |
504 KB |
Partially correct |
19 |
Partially correct |
14 ms |
520 KB |
Partially correct |
20 |
Partially correct |
9 ms |
464 KB |
Partially correct |
21 |
Partially correct |
58 ms |
1084 KB |
Partially correct |
22 |
Partially correct |
54 ms |
1088 KB |
Partially correct |
23 |
Partially correct |
59 ms |
1088 KB |
Partially correct |
24 |
Partially correct |
63 ms |
1084 KB |
Partially correct |
25 |
Incorrect |
55 ms |
1120 KB |
Output isn't correct |
26 |
Partially correct |
53 ms |
976 KB |
Partially correct |
27 |
Partially correct |
52 ms |
1056 KB |
Partially correct |
28 |
Partially correct |
53 ms |
1088 KB |
Partially correct |
29 |
Partially correct |
56 ms |
1088 KB |
Partially correct |
30 |
Partially correct |
41 ms |
1176 KB |
Partially correct |
31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
32 |
Correct |
0 ms |
208 KB |
Output is correct |