제출 #367744

#제출 시각아이디문제언어결과실행 시간메모리
367744abra_stoneGap (APIO16_gap)C++14
100 / 100
84 ms3424 KiB
#include "gap.h"
#include <vector>
#include <algorithm>
using namespace std;

typedef long long ll;
ll ans;
vector<ll> a;

ll findGap(int T, int n) {
    ll i, mn = 0, mx = 2e18;
    if (T == 1) {
        for (i = 0; i < n; i += 2) {
            MinMax(mn, mx, &mn, &mx);
            a.push_back(mn);
            a.push_back(mx);
            mn++;
            mx--;
        }
    } else {
        ll tmn, tmx;
        MinMax(mn, mx, &mn, &mx);
        a.push_back(mn);
        a.push_back(mx);
        ll t = (mx - mn + n - 2) / (n - 1);
        mn++;
        mx--;
        for (i = mn; i <= mx; i += t + 1) {
            MinMax(i, i + t, &tmn, &tmx);
            a.push_back(tmn);
            a.push_back(tmx);
        }
    }
    sort(a.begin(), a.end());
    for (i = 1; i < a.size(); i++) {
        ans = max(ans, a[i] - a[i - 1]);
    }
	return ans;
}

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:35:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (i = 1; i < a.size(); i++) {
      |                 ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...