답안 #579527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579527 2022-06-19T10:18:57 Z jiahng Gap (APIO16_gap) C++14
12.6461 / 100
46 ms 1104 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, _;
    ll empty_num = 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);
            empty_num += (res == -1);
            if (x + amt >= mx) break;
            amt <<= 1;
        }
        if (res == -1) break;
        ans = max(ans, res - x);
        x = y;
    }
    assert(empty_num <= N+70);
    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, _;
      |                            ^
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Incorrect 1 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 1 ms 208 KB Output isn't correct
9 Incorrect 1 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 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Incorrect 1 ms 336 KB Output isn't correct
16 Correct 6 ms 428 KB Output is correct
17 Correct 7 ms 464 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Correct 8 ms 464 KB Output is correct
20 Correct 5 ms 464 KB Output is correct
21 Correct 22 ms 1104 KB Output is correct
22 Correct 29 ms 1072 KB Output is correct
23 Correct 22 ms 1044 KB Output is correct
24 Correct 24 ms 1024 KB Output is correct
25 Incorrect 44 ms 1028 KB Output isn't correct
26 Correct 28 ms 1044 KB Output is correct
27 Correct 22 ms 1060 KB Output is correct
28 Correct 21 ms 1068 KB Output is correct
29 Correct 26 ms 968 KB Output is correct
30 Correct 21 ms 1100 KB Output is correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct
# 결과 실행 시간 메모리 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 0 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 0 ms 208 KB Output is correct
10 Correct 0 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 336 KB Output is correct
15 Partially correct 1 ms 208 KB Partially correct
16 Correct 6 ms 464 KB Output is correct
17 Correct 7 ms 464 KB Output is correct
18 Correct 6 ms 464 KB Output is correct
19 Correct 7 ms 432 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 22 ms 1048 KB Output is correct
22 Correct 23 ms 968 KB Output is correct
23 Correct 27 ms 1084 KB Output is correct
24 Correct 28 ms 968 KB Output is correct
25 Partially correct 46 ms 1084 KB Partially correct
26 Correct 24 ms 968 KB Output is correct
27 Correct 23 ms 1084 KB Output is correct
28 Correct 26 ms 968 KB Output is correct
29 Correct 25 ms 1048 KB Output is correct
30 Correct 21 ms 1052 KB Output is correct
31 Partially correct 1 ms 208 KB Partially correct
32 Correct 0 ms 208 KB Output is correct