제출 #237511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237511		thtsshz_bgwrswh	Gap (APIO16_gap)	C++17	30 / 100	71 ms	2296 KiB

gap

#pragma GCC optimize("Ofast")
#include<stdio.h>
#include<vector>
#include<assert.h>
#include<algorithm>
#include "gap.h"
using namespace std;
vector<long long> num;
long long findGap(int T,int N){
	if(T==1){
		long long i,maxv=1000000000000000000,minv=0,ans,ans2;
		while(maxv>=minv&&num.size()<N){
			MinMax(minv,maxv,&ans,&ans2);
			if(ans==-1||ans2==-1)
				break;
			if(ans==ans2){
				num.emplace_back(ans);
				break;
			}
			num.emplace_back(ans);
			num.emplace_back(ans2);
			maxv=ans2-1;
			minv=ans+1;
		}
		sort(num.begin(),num.end());
		assert(num.size()==N);
		ans=0;
		for(i=1;i<num.size();i++)
			ans=max(ans,num[i]-num[i-1]);
		return ans;
	}
	else{
		return 0;
	}
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:12:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(maxv>=minv&&num.size()<N){
                     ~~~~~~~~~~^~
In file included from gap.cpp:4:0:
gap.cpp:26:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   assert(num.size()==N);
          ~~~~~~~~~~^~~
gap.cpp:28:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=1;i<num.size();i++)
           ~^~~~~~~~~~~

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