제출 #532797

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
532797	2022-03-03 23:33:41	new_acc	Gap (APIO16_gap)	C++14	100 / 100	68 ms	1084 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>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e3+10;
ll solve1(int n){
  ll mn,mx;
  ll curr1=0,curr2=1e18,last1=-1,last2=-1;
  ll res=0;
  for(int i=1;i<=(n+1)/2;i++){
    MinMax(curr1,curr2,&mn,&mx);  
    if(last1!=-1) res=max({res,mn-last1,last2-mx});
    last1=mn,last2=mx;
    curr1=mn+1,curr2=mx-1;
  }
  return (n%2==0?max(res,last2-last1):res);
}
ll solve2(int n){
  if(n<=6) return solve1(n);
  ll mn,mx;
  MinMax(0,1e18,&mn,&mx);
  ll last=mx;
  ll minim=(mx-mn)/(n-1LL);
  ll curr=mn,res=minim;
  for(ll i=curr+1;i<=last;i+=minim+1){
    MinMax(i,i+minim,&mn,&mx);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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