답안 #1012160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012160 2024-07-01T18:23:53 Z codefox Gap (APIO16_gap) C++14
72.604 / 100
32 ms 1212 KB
#include "gap.h"

#define ll long long

long long findGap(int T, int N)
{
    if (T==1 || N<=18)
    {
        ll l = 0;
        ll r = 1e18;
        ll mxdist = 0;
        ll nl = 0;
        ll nr = 0;
        ll fl = -1;
        ll fr = -1;
        for (int j = 0; j < N && l<=r; j+=2)
        {
            MinMax(l, r, &nl, &nr);
            if (nr==-1) break;
            if (fl != -1 && nl-fl>mxdist) mxdist = nl-fl;
            if (fr != -1 && fr-nr>mxdist) mxdist = fr-nr;
            fl = nl;
            fr = nr;
            l = nl+1;
            r = nr-1;
        }
        if (fr-fl>mxdist) mxdist = fr-fl;
        return mxdist;
    }
    else
    {
        ll l = 0;
        ll rr = 0;
        MinMax(0, 1e18, &l, &rr);
        ll dd = 1;
        while (l != rr)
        {
            ll sl = -1;
            ll sr = -1;
            MinMax(l+1, l+dd, &sl, &sr);
            while (sr==-1)
            {
                MinMax(l+dd, l+2*dd, &sl, &sr);
                if (sr==-1) dd*=2;
            }
            if (sl-l>dd) dd = sl-l;
            l = sr;
        }
        return dd;
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 5 ms 628 KB Output is correct
17 Correct 6 ms 392 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 532 KB Output is correct
21 Correct 22 ms 1212 KB Output is correct
22 Correct 29 ms 1112 KB Output is correct
23 Correct 23 ms 1152 KB Output is correct
24 Correct 22 ms 1112 KB Output is correct
25 Correct 23 ms 1112 KB Output is correct
26 Correct 21 ms 1112 KB Output is correct
27 Correct 21 ms 1112 KB Output is correct
28 Correct 21 ms 1112 KB Output is correct
29 Correct 20 ms 1112 KB Output is correct
30 Correct 18 ms 1112 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Partially correct 0 ms 344 KB Partially correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 5 ms 464 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 22 ms 1140 KB Output is correct
22 Correct 14 ms 1112 KB Output is correct
23 Correct 15 ms 1112 KB Output is correct
24 Correct 13 ms 1112 KB Output is correct
25 Partially correct 32 ms 1112 KB Partially correct
26 Correct 14 ms 1112 KB Output is correct
27 Correct 20 ms 1112 KB Output is correct
28 Correct 23 ms 1112 KB Output is correct
29 Correct 14 ms 1112 KB Output is correct
30 Correct 18 ms 1112 KB Output is correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct