Submission #564453

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
564453	2022-05-19 09:01:58	penguin133	Gap (APIO16_gap)	C++14	100 / 100	65 ms	1868 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>
#include "gap.h"
using namespace std;
 
long long B[100005];
long long findGap(int T, int N)
{
  if(T == 1){
    long long ans = 0, mini, maxi;
    B[N+1] = (long long)1e18 + 5, B[0] = -1;
    int j = N;
    for(int i=1;i<=j;i++){
      //cout << B[i-1] << " " << B[j+1] << '\n';
      MinMax(B[i-1]+1, B[j+1]-1, &mini, &maxi);
      //cout << mini << '\n';
      B[i] = mini, B[j] = maxi;
      //cout << *mini << " " << *maxi << '\n';
      j--;
    }
    for(int i=1;i<N;i++)ans = max(ans, B[i+1] - B[i]);
    return ans;
  }
  else{
    long long ans = 0, mini, maxi;
    MinMax(0, (long long)1e18, &mini, &maxi);
    long long tmp = maxi - mini - 1;
    if(N == 2)return maxi-mini;
    long long prev = mini, prev2 = mini, tmp2 = maxi;
    for(int i=1;i<=N-1;i++){
      long long x  = tmp/(N-i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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