제출 #793123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793123		algorithm16	Gap (APIO16_gap)	C++14	12.88 / 100	41 ms	1192 KiB

gap

#include "gap.h"
#include<iostream>
using namespace std;
typedef long long int llint;
llint findGap(int T, int N)
{
	llint mn,mx;
	/*cout << 1 << " " << 1e18 << "\n";
	cin >> mn >> mx;*/
	MinMax(1LL,(llint)1e18,&mn,&mx);
	llint x=mn,y=mx,rr=mx-mn,r=(mx-mn)/(N-1)+((mx-mn)%(N-1)!=0);
	while(x!=y) {
		if(y-x<=r) break;
		/*cout << x << " " << x+r << "\n";
		cin >> mn >> mx;*/
		MinMax(x+1,x+r,&mn,&mx);
		if(mx!=-1) {
			x=mx;
			continue;
		}
		llint lo=r,hi=min(y-x,r*3/2);
		while(lo<hi) {
			llint mid=(lo+hi)/2;
			/*cout << x << " " << x+mid << "\n";
			cin >> mn >> mx;*/
			MinMax(x+1,x+mid,&mn,&mx);
			if(mx!=-1) hi=mid;
			else lo=mid+1;
		}
		if(lo<r*3/2) x+=lo;
		r=lo;
	}
	return r;
}
/*int main()
{
	cout << findGap(1,5);
	return 0;
}*/

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

gap.cpp: In function 'llint findGap(int, int)':
gap.cpp:11:18: warning: unused variable 'rr' [-Wunused-variable]
   11 |  llint x=mn,y=mx,rr=mx-mn,r=(mx-mn)/(N-1)+((mx-mn)%(N-1)!=0);
      |                  ^~

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