제출 #295874

#제출 시각아이디문제언어결과실행 시간메모리
295874dCodingGap (APIO16_gap)C++14
0 / 100
48 ms2212 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long 

ll findGap(int t, int n) {
	ll lo = 0, hi = 1e18;
	vector<ll> l,h;
	ll mn = 0,mx = 0;
	while(l.size()+h.size() < n) {
		MinMax(lo,hi,&mn,&mx);
		assert((mn!=-1) && (mx!=-1));
		if(mn == mx) {
			l.push_back(mn);
		} else {
			l.push_back(mn);
			h.push_back(mx);
		}
		lo = mn;
		hi = mx;
	}
	ll ans = 0;
	for(int i=1;i<l.size();i++) ans = max(ans, l[i]-l[i-1]);
	for(int i=1;i<h.size();i++) ans = max(ans, h[i]-h[i-1]);
	ans = max(ans, h[0]-l.back());
	return ans;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:10:26: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   10 |  while(l.size()+h.size() < n) {
      |        ~~~~~~~~~~~~~~~~~~^~~
gap.cpp:23:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(int i=1;i<l.size();i++) ans = max(ans, l[i]-l[i-1]);
      |              ~^~~~~~~~~
gap.cpp:24:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for(int i=1;i<h.size();i++) ans = max(ans, h[i]-h[i-1]);
      |              ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...