Submission #579526

# Submission time Handle Problem Language Result Execution time Memory
579526 2022-06-19T10:13:36 Z jiahng Gap (APIO16_gap) C++14
12.6461 / 100
51 ms 1132 KB
#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, ans = 1, x = 0, _;
    MinMax(0,(ll)1e18,&x,&mx);
    while (x < mx){
        ll amt = ans, res = -1, y;
        while (res == -1){
            MinMax(x+1,min(mx, x+amt),&res,&y);
            if (x + amt >= mx) break;
            amt <<= 1;
        }
        if (res == -1) break;
        ans = max(ans, res - x);
        x = y;
    }
    return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:34:28: warning: unused variable '_' [-Wunused-variable]
   34 |     ll mx, ans = 1, x = 0, _;
      |                            ^
# Verdict Execution time Memory 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 1 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 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Incorrect 1 ms 208 KB Output isn't correct
16 Correct 7 ms 464 KB Output is correct
17 Correct 6 ms 464 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Correct 7 ms 464 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 25 ms 1056 KB Output is correct
22 Correct 32 ms 1080 KB Output is correct
23 Correct 31 ms 1060 KB Output is correct
24 Correct 30 ms 1000 KB Output is correct
25 Incorrect 48 ms 1004 KB Output isn't correct
26 Correct 30 ms 992 KB Output is correct
27 Correct 30 ms 972 KB Output is correct
28 Correct 30 ms 1004 KB Output is correct
29 Correct 29 ms 968 KB Output is correct
30 Correct 21 ms 1084 KB Output is correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 1 ms 252 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 208 KB Partially correct
2 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 0 ms 208 KB Partially correct
4 Partially correct 0 ms 208 KB Partially correct
5 Partially correct 0 ms 208 KB Partially correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Partially correct 1 ms 208 KB Partially correct
16 Correct 9 ms 476 KB Output is correct
17 Correct 9 ms 464 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Correct 7 ms 520 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 23 ms 1052 KB Output is correct
22 Correct 28 ms 1052 KB Output is correct
23 Correct 26 ms 1008 KB Output is correct
24 Correct 23 ms 972 KB Output is correct
25 Partially correct 51 ms 1132 KB Partially correct
26 Correct 24 ms 1068 KB Output is correct
27 Correct 28 ms 964 KB Output is correct
28 Correct 23 ms 1064 KB Output is correct
29 Correct 23 ms 1080 KB Output is correct
30 Correct 23 ms 1096 KB Output is correct
31 Partially correct 0 ms 208 KB Partially correct
32 Correct 0 ms 208 KB Output is correct