제출 #668299

#제출 시각아이디문제언어결과실행 시간메모리
668299danikoynovGap (APIO16_gap)C++14
0 / 100
48 ms2436 KiB

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

long long findGap(int T, int N)
{
    ll lf = 0, rf = 1e18, mn, mx;
    MinMax(lf, rf, &mn, &mx);
    vector < ll > vec;
    while(true)
    {
        if (N == 0)
            break;

        if (N == 1)
        {
            MinMax(lf, rf, &mn, &mx);
            vec.push_back(mn);
            break;
        }

        N -= 2;
        MinMax(lf, rf, &mn, &mx);
        vec.push_back(mn);
        vec.push_back(mx);
        lf = mn + 1;
        rf = mx - 1;
    }

    ll ans = 0;
    sort(vec.begin(), vec.end());
    for (int i = 1; i < vec.size(); i ++)
        ans = max(ans, vec[i] - vec[i - 1]);
    return ans;
}

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

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