제출 #655461

#제출 시각아이디문제언어결과실행 시간메모리
655461benjaminkleynGap (APIO16_gap)C++17
30 / 100
3084 ms1864 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;

ll a[100000];

ll findGap(int T, int N)
{
    if (T == 1)
    {
        ll lo = 0, hi = 1000000000000000000;
        int l = 0, r = N - 1;
        while (l <= r)
        {
            MinMax(lo, hi, &a[l], &a[r]);
            lo = a[l++] + 1;
            hi = a[r--] - 1;
        }
        ll mx = 0;
        for (int i = 0; i < N; i++)
            mx = max(mx, a[i+1] - a[i]);
        return mx;
    }
    else
    {
        ll lo = 0, hi = 1000000000000000000, prev;
        MinMax(lo, hi, &lo, &hi);
        ll ans = (hi - lo) / (N - 1);
        while (lo <= hi)
        {
            ll x = -1, y;
            ll i = lo, step = ans;

            while (x == -1)
            {
                MinMax(i + 1, i + step, &x, &y);
                i += step;
            }
            ans = max(ans, x - lo);
            lo = y;
        }
        return ans;
    }
}

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:27:46: warning: unused variable 'prev' [-Wunused-variable]
   27 |         ll lo = 0, hi = 1000000000000000000, prev;
      |                                              ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...