제출 #105008

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105008		puyu_liao	Gap (APIO16_gap)	C++14	100 / 100	88 ms	2720 KiB

gap

#include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define N 300006
 
//vector<int> vv;
//void MinMax(long long s, long long t, long long* mn, long long* mx){
//	cout << "ASKed " << s << ' ' << t << '\n';
//	auto imn = lower_bound(vv.begin(),vv.end(),s);
//	auto imx = upper_bound(vv.begin(),vv.end(),t);
//	if(imn == vv.end() || imx == vv.begin() || *imn > *--imx) {
//		cout << "return (-1,-1)" << '\n';
//		return *mn = *mx = -1ll, void();
//	}
//	*mn = *imn;
//	*mx = *imx;
//	cout << "return " << complex<int>(*mn,*mx) << '\n';
//}
 
#include "gap.h"
typedef long long ll;
 
ll findGap(int T,int n){
	if(T==1){
		vector<ll> v1,v2;
		ll ans = 0;
		ll s = 0, t = 1000000000000000000ll,mn,mx;
		for(int i=1,j=n;i<=j;i++,j--){
			MinMax(s,t,&mn,&mx);
			v1.push_back(mn);
			if(i != j) v2.push_back(mx);
			s = mn+1; t=mx-1;
		}
		reverse(v2.begin(),v2.end());
		for(ll i : v2) v1.push_back(i);
		for(int i=0;i<v1.size()-1;i++) ans = max(ans,v1[i+1]-v1[i]);
		return ans;
	}
	else{
		ll ans = 0;
		ll s = 0,t=1000000000000000000ll,mn,mx,gap,last;
		MinMax(s,t,&mn,&mx);
		s = mn + 1, t = mx - 1;
		if(n == 2) return mx - mn;
		gap = (mx-mn+1)/(n);
		last = mn;
		while(s + gap + 1 <= t){
			MinMax(s,s + gap,&mn,&mx);
			if(mn != -1) ans = max(ans,mn - last),last = mx;
			s += gap+1;
		}
		MinMax(s,t,&mn,&mx);
		if(mn != -1) ans = max(ans,mn - last),last = mx;
		ans = max(ans,t+1 - last);
		return ans;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:37:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<v1.size()-1;i++) ans = max(ans,v1[i+1]-v1[i]);
               ~^~~~~~~~~~~~

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