제출 #534558

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534558		pokmui9909	Gap (APIO16_gap)	C++17	100 / 100	64 ms	3276 KiB

gap

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

#define x first
#define y second

pair<ll, ll> ask(ll s, ll e){
    pair<ll, ll> p;
    MinMax(s, e, &p.x, &p.y);
    return p;
}

long long findGap(int T, int N){
    vector<ll> A;
    if(T == 1){
        ll L = 0, R = 2e18;
        while(N >= 1){
            pair<ll, ll> r = ask(L, R);
            A.push_back(r.x);
            A.push_back(r.y);
            L = r.x + 1, R = r.y - 1;
            N -= 2;
        }
    } else {
        pair<ll, ll> r = ask(0, 1e18 + 5);
        ll md = (r.y - r.x) / (N - 1) + 1;
        for(ll i = r.x; i <= r.y; i += md + 1){
            pair<ll, ll> p = ask(i, i + md);
            A.push_back(p.x);
            A.push_back(p.y);
        }
    }
    sort(A.begin(), A.end());
    ll ans = 0;
    for(int i = 0; i < A.size() - 1; i++){
        ans = max(ans, A[i + 1] - A[i]);
    }
    return ans;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = 0; i < A.size() - 1; i++){
      |                    ~~^~~~~~~~~~~~~~

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