Submission #1012158

# Submission time Handle Problem Language Result Execution time Memory
1012158 2024-07-01T18:21:18 Z codefox Gap (APIO16_gap) C++14
64.6316 / 100
34 ms 1264 KB
#include "gap.h"

#define ll long long

long long findGap(int T, int N)
{
    if (T==1 || N<=7)
    {
        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;
    }
}
# Verdict Execution time Memory 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 344 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 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 23 ms 1028 KB Output is correct
22 Correct 24 ms 1108 KB Output is correct
23 Correct 34 ms 1140 KB Output is correct
24 Correct 24 ms 1112 KB Output is correct
25 Correct 20 ms 1216 KB Output is correct
26 Correct 29 ms 1112 KB Output is correct
27 Correct 22 ms 1112 KB Output is correct
28 Correct 22 ms 1024 KB Output is correct
29 Correct 23 ms 1112 KB Output is correct
30 Correct 25 ms 1264 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory 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 1 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 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Partially correct 1 ms 344 KB Partially correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 4 ms 632 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 14 ms 1184 KB Output is correct
22 Correct 17 ms 1112 KB Output is correct
23 Correct 14 ms 1112 KB Output is correct
24 Correct 24 ms 1112 KB Output is correct
25 Partially correct 28 ms 1112 KB Partially correct
26 Correct 18 ms 1108 KB Output is correct
27 Correct 17 ms 1112 KB Output is correct
28 Correct 19 ms 1188 KB Output is correct
29 Correct 15 ms 1112 KB Output is correct
30 Correct 14 ms 1184 KB Output is correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct