답안 #347977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
347977	2021-01-14T01:26:10 Z	joylintp	Gap (APIO16_gap)	C++17	19.7181 / 100	57 ms	1772 KB

gap

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

long long findGap(int T, int N)
{
    long long l, r, ans = 0;
    MinMax(0, 1000000000000000000, &l, &r);

    queue<pair<long long, long long>> q;
    q.push({l, r});
    while (!q.empty())
    {
        l = q.front().first, r = q.front().second, q.pop();
        if (r - l <= ans)
            continue;

        if (r - l <= 1)
            ans = max(ans, r - l);
        else if (r - l == 2)
        {
            long long tl, tr;
            MinMax(l, l + 1, &tl, &tr);
            ans = max(ans, 2LL - (tr == l + 1));
        }
        else if (r - l == 3)
        {
            long long tl, tr;
            MinMax(l + 1, r - 1, &tl, &tr);
            ans = max(ans, 3LL - (tl == l + 1) - (tr == r - 1));
        }
        else
        {
            long long m = (l + r) / 2, ll, lr, rl, rr;
            MinMax(l + 1, m, &ll, &lr), MinMax(m + 1, r - 1, &rl, &rr);

            if (ll == -1 && rl == -1)
                ans = max(ans, r - l);
            else if (ll == -1)
                ans = max({ans, rl - l, r - rr}), q.push({rl, rr});
            else if (rl == -1)
                ans = max({ans, ll - l, r - lr}), q.push({ll, lr});
            else
                ans = max({ans, ll - l, rl - lr, r - rr}), q.push({ll, lr}), q.push({rl, rr});
        }
    }

	return ans;
}

Subtask #1

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	Output isn't correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Incorrect	0 ms	364 KB	Output isn't correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Incorrect	1 ms	364 KB	Output isn't correct
16	Correct	9 ms	620 KB	Output is correct
17	Correct	8 ms	696 KB	Output is correct
18	Correct	9 ms	620 KB	Output is correct
19	Correct	9 ms	620 KB	Output is correct
20	Correct	4 ms	492 KB	Output is correct
21	Correct	39 ms	1260 KB	Output is correct
22	Correct	40 ms	1260 KB	Output is correct
23	Correct	33 ms	1260 KB	Output is correct
24	Correct	35 ms	1260 KB	Output is correct
25	Incorrect	57 ms	1772 KB	Output isn't correct
26	Correct	34 ms	1260 KB	Output is correct
27	Correct	35 ms	1260 KB	Output is correct
28	Correct	34 ms	1260 KB	Output is correct
29	Correct	33 ms	1260 KB	Output is correct
30	Correct	14 ms	1132 KB	Output is correct
31	Correct	0 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct

Subtask #2

19.7180885677 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Partially correct	1 ms	364 KB	Partially correct
6	Partially correct	1 ms	364 KB	Partially correct
7	Partially correct	1 ms	364 KB	Partially correct
8	Partially correct	0 ms	364 KB	Partially correct
9	Partially correct	0 ms	364 KB	Partially correct
10	Correct	1 ms	364 KB	Output is correct
11	Partially correct	1 ms	364 KB	Partially correct
12	Partially correct	1 ms	364 KB	Partially correct
13	Partially correct	1 ms	364 KB	Partially correct
14	Partially correct	1 ms	364 KB	Partially correct
15	Partially correct	1 ms	364 KB	Partially correct
16	Partially correct	9 ms	620 KB	Partially correct
17	Partially correct	9 ms	620 KB	Partially correct
18	Partially correct	9 ms	620 KB	Partially correct
19	Partially correct	9 ms	620 KB	Partially correct
20	Correct	4 ms	492 KB	Output is correct
21	Partially correct	35 ms	1260 KB	Partially correct
22	Partially correct	34 ms	1260 KB	Partially correct
23	Partially correct	35 ms	1260 KB	Partially correct
24	Partially correct	34 ms	1260 KB	Partially correct
25	Partially correct	55 ms	1720 KB	Partially correct
26	Partially correct	34 ms	1260 KB	Partially correct
27	Partially correct	36 ms	1260 KB	Partially correct
28	Partially correct	35 ms	1260 KB	Partially correct
29	Partially correct	34 ms	1388 KB	Partially correct
30	Correct	17 ms	1132 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct