제출 #112669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
112669		dolphingarlic	Gap (APIO16_gap)	C++14	0 / 100	61 ms	2388 KiB

gap

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

ll findGap(int T, int N) {
    if (T == 1) {
        ll l = 1, r = MAXN;
        ll mn, mx;
        vector<ll> v;
        while (l <= r) {
            MinMax(l, r, &mn, &mx);
            if (mn != -1) {
                v.push_back(mn);
                v.push_back(mx);
            }
            l = mn + 1, r = mx - 1;
        }
        sort(v.begin(), v.end());
        ll ans = 0;
        for (ll i = 0; i < v.size() - 1; i++) ans = max(ans, v[i + 1] - v[i]);
        return ans;
    } else {
        ll mn, mx;
        MinMax(1, MAXN, &mn, &mx);
        ll step = ceil((mx - mn) / (double)(N - 1));
        ll ans = step, x, y, l = mn;
        for (ll i = mn; i + step <= mx; i += step + 1) {
            MinMax(i, i + step, &x, &y);
            if (x != -1) {
                ans = max(ans, x - l);
                l = y;
            }
        }
        ans = max(ans, mx - l);
        return ans;
    }
}

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:22:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (ll i = 0; i < v.size() - 1; i++) ans = max(ans, v[i + 1] - v[i]);
                        ~~^~~~~~~~~~~~~~

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