제출 #579513

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
579513		jiahng	Gap (APIO16_gap)	C++14	0 / 100	71 ms	1092 KiB

gap

#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 = 1, _;
    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;
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70