제출 #30723

#제출 시각아이디문제언어결과실행 시간메모리
30723PrOAhMeTGap (APIO16_gap)C++14
0 / 100
79 ms6772 KiB
#include "gap.h"
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

long long findGap(int T, int N)
{
	
	vector<LL> v;
	LL x=-1,y=1e18+1,nx,ny,ret=0;
	if(T==1) {

		while(x!=y) {
			MinMax(x+1,y-1,&nx,&ny);
			x=nx; y=ny;
			if(x==-1)
				break;
			v.pb(x);
			if(x!=y)
				v.pb(y);
			x=nx;
			y=ny;
		}
		sort(v.begin(),v.end());
		for(int i=1;i<v.size();++i)
			ret=max(ret,v[i]-v[i-1]);
		return ret;

	}
	else {



	}

}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1;i<v.size();++i)
                ^
gap.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...