답안 #1077473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1077473	2024-08-27T07:33:48 Z	Icelast	Gap (APIO16_gap)	C++17	30 / 100	35 ms	2220 KB

gap

#include "gap.h"
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;

long long findGap(int T, int n)
{
    ll ans = 0;
    if(T == 1){
        ll l = 0, r = INF;
        ll mn, mx;
        vector<ll> a(n+1);
        for(int i = 1; i <= (n+1)/2; i++){
            MinMax(l, r, &mn, &mx);
            a[i] = mn; a[n-i+1] = mx;
            l = mn+1, r = mx-1;
        }
        for(int i = 2; i <= n; i++){
            ans = max(ans, a[i]-a[i-1]);
        }
    }else{
        ll l = 0, r = INF;
        ll mn, mx;
        vector<ll> a(n+1);
        MinMax(l, r, &mn, &mx);
        l = mn, r = mx;
        ll d = ceil((r-l)/(n-1));
        while(l < r){
            MinMax(l+1, l+d, &mn, &mx);
            if(mn != -1){
                l = mx;
                continue;
            }

            MinMax(l+1, l+d*2, &mn, &mx);
            ll t = mn;

            while(t == -1){
                d*=2;
                MinMax(l+1, l+d*2, &mn, &mx);
                t = mn;
            }
            d = max(d, t-l);
            l = mx;
        }
        ans = d;
    }
	return ans;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	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	340 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 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	Correct	1 ms	344 KB	Output is correct
16	Correct	6 ms	752 KB	Output is correct
17	Correct	6 ms	856 KB	Output is correct
18	Correct	6 ms	856 KB	Output is correct
19	Correct	6 ms	856 KB	Output is correct
20	Correct	5 ms	856 KB	Output is correct
21	Correct	27 ms	1828 KB	Output is correct
22	Correct	26 ms	1880 KB	Output is correct
23	Correct	26 ms	1880 KB	Output is correct
24	Correct	33 ms	1880 KB	Output is correct
25	Correct	22 ms	1880 KB	Output is correct
26	Correct	32 ms	1880 KB	Output is correct
27	Correct	35 ms	1880 KB	Output is correct
28	Correct	33 ms	1880 KB	Output is correct
29	Correct	25 ms	1880 KB	Output is correct
30	Correct	21 ms	1880 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Output isn't 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	388 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	1 ms	344 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	5 ms	856 KB	Output is correct
17	Correct	5 ms	856 KB	Output is correct
18	Correct	5 ms	856 KB	Output is correct
19	Correct	4 ms	856 KB	Output is correct
20	Correct	2 ms	856 KB	Output is correct
21	Correct	16 ms	1968 KB	Output is correct
22	Correct	17 ms	1880 KB	Output is correct
23	Correct	17 ms	1880 KB	Output is correct
24	Correct	19 ms	1944 KB	Output is correct
25	Correct	33 ms	1880 KB	Output is correct
26	Correct	17 ms	1880 KB	Output is correct
27	Correct	21 ms	2220 KB	Output is correct
28	Correct	18 ms	1880 KB	Output is correct
29	Correct	17 ms	1876 KB	Output is correct
30	Correct	14 ms	1880 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct