Submission #844816

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
844816	2023-09-06 01:43:48	dutinmeow	Gap (APIO16_gap)	C++17	100 / 100	42 ms	4164 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 <bits/stdc++.h>
using namespace std;
 
#include "gap.h"
 
const long long MAX_A = 1e18;
 
long long findGap(int T, int N) {
  if (T == 1) {
    long long l = 1, r = MAX_A;
    vector<long long> A;
    for (int i = 0; i < (N + 1) / 2; i++) {
      long long nl, nr;
      MinMax(l, r, &nl, &nr);
      A.push_back(nl);
      A.push_back(nr);
      l = nl + 1, r = nr - 1;
    }
    sort(A.begin(), A.begin() + N);
    long long ans = 0;
    for (int i = 1; i < N; i++) 
      ans = max(ans, A[i] - A[i - 1]);
    return ans;
  } else {
    long long l, r;
    MinMax(1, MAX_A, &l, &r);
    long long step = (r - l) / (N - 1);
    long long lb, ans = step;
    for (lb = l; lb + step < r; lb += step + 1) {
      long long nl, nr;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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