제출 #1091026

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1091026		Nurislam	Gap (APIO16_gap)	C++17	0 / 100	21 ms	1224 KiB

gap

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#include "gap.h"
typedef long long ll;

ll solve1(int t, int n){
	ll l = 0, r = 1e18;
	vector<ll> a;
	ll lf = 1, rf = 1;
	
	while(lf != rf && a.size()*2 < n){
		MinMax(l, r, &lf, &rf);
		if(lf == -1)break;
		a.pb(lf);
		a.pb(rf);
		l = lf+1, r = rf-1;
		
	}
	
	ll ans = 1;
	sort(all(a));
	for(int i = 1; i < a.size(); i++)
		ans = max(ans, a[i] - a[i-1]);
	
	return ans;

}

long long findGap(int t, int n)
{
	//if(t == 1){
		return solve1(t, n);
	//}
	return 0;
}

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

gap.cpp: In function 'll solve1(int, int)':
gap.cpp:18:31: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |  while(lf != rf && a.size()*2 < n){
      |                    ~~~~~~~~~~~^~~
gap.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for(int i = 1; i < a.size(); i++)
      |                 ~~^~~~~~~~~~

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