제출 #835892

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
835892	2023-08-23 22:02:22	BT21tata	Gap (APIO16_gap)	C++17	43.91 / 100	58 ms	1108 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<bits/stdc++.h>
typedef long long ll;
using namespace std;
 
long long findGap(int T, int n)
{
  ll mn, mx;
  MinMax(0, 1e18, &mn, &mx);
  ll gap=(mx-mn-1)/(n-1)+1;
  ll l=mn, r=mx, curl=l, curr=l+gap-1, ans=gap;
  //cout<<curr<<endl;
  while(curr-gap<=r)
  {
    //cout<<curl<<' '<<curr<<" "<<ans<<endl;
    MinMax(curl+1, curr, &mn, &mx);
    if(mx==-1) mn=mx=curl;
    else mn=curl;
    if(mn!=mx and mx-mn<=gap) curl=mx, curr=curl+gap-1;
    else if(mn==mx) curl=mn, curr+=gap;
    else
    {
      MinMax(curr-gap+1, curr, &mn, &mx);
      if(mn==mx) ans=max(ans, mx-curl);
      else ans=max(ans, mn-curl);
      curl=mx, curr=curl+gap-1;
    }
  }
  return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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