제출 #400625

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
400625	2021-05-08 12:12:07	Falcon	Gap (APIO16_gap)	C++17	100 / 100	69 ms	1936 KiB

gap

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "gap.h"
#include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
long long findGap(int T, int N) {
    if(T == 1) {
        std::vector<long long> a; a.reserve(N);
        long long s{0}, e{(long long)1e18}; 
        while(int(a.size()) < N) {
            MinMax(s, e, &s, &e);
            assert(s != -1);
            a.push_back(s); a.push_back(e);
            ++s, --e;
        }
        std::sort(a.begin(), a.end());
        long long ans{};
        for(int i{}; i < int(a.size()) - 1; ++i)
            ans = std::max(ans, a[i + 1] - a[i]);
        return ans;
    }
    
    long long a1{}, aN{};
    MinMax(0, (long long)1e18, &a1, &aN);
    long long d = (aN - a1 + N - 2) / (N - 1), ans = d;
    for(long long i = a1, p = a1; i <= aN; i += d + 1) {
        long long s{}, e{};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70