제출 #108459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108459		nxteru	Gap (APIO16_gap)	C++14	30 / 100	73 ms	2760 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
#define PB push_back
ll ans,mn,mx,n;
long long findGap(int t, int N)
{
	n=N;
	if(t==1){
		ll l=-1,r=1e19+1;
		vector<ll>x,y;
		while(x.size()+y.size()<n){
			l++,r--;
			MinMax(l,r,&l,&r);
			x.PB(l);
			y.PB(r);
		}
		for(int i=y.size()-1;i>=0;i--)x.PB(y[i]);
		for(int i=0;i+1<x.size();i++)ans=max(ans,x[i+1]-x[i]);
		return ans;
	}
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:11:17: warning: overflow in implicit constant conversion [-Woverflow]
   ll l=-1,r=1e19+1;
             ~~~~^~
gap.cpp:13:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(x.size()+y.size()<n){
         ~~~~~~~~~~~~~~~~~^~
gap.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i+1<x.size();i++)ans=max(ans,x[i+1]-x[i]);
               ~~~^~~~~~~~~
gap.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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