제출 #888341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
888341		12345678	Gap (APIO16_gap)	C++17	100 / 100	47 ms	3996 KiB

gap

#include "gap.h"
 
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
 
long long findGap(int T, int N)
{
    if (T==1)
    {
        ll x=0, y=1e18, a, b, idx=0, mx=0;
        vector<ll> v;
        while (v.size()<N)
        {
            MinMax(x, y, &a, &b);
            if (a==b) v.push_back(a);
            else v.push_back(a), v.push_back(b);
            x=a+1; y=b-1;
        }
        sort(v.begin(), v.end());
        for (int i=1; i<v.size(); i++) mx=max(mx, v[i]-v[i-1]);
        return mx;
    }
    else
    {
        ll x=0, y=1e18, mn, mx, mmn, mmx, res=0, cnt=0, lst;
        vector<ll> v;
        MinMax(x, y, &mmn, &mmx);
        if (mmx-mmn+1<N+1) return 1;
        ll gap=(mmx-mmn-1)/(N-1), rem=(mmx-mmn-1)%(N-1);
        v.push_back(mmn);
        v.push_back(mmx);
        lst=mmn+1;
        for (ll i=mmn+1; i<=mmx-1&&cnt<rem; i+=gap+1, cnt++)
        {
            MinMax(i, i+gap, &mn, &mx);
            lst=i+gap+1;
            if (mn==-1) continue;
            v.push_back(mn);
            if (mn!=mx) v.push_back(mx);
        }
        for (ll i=lst; i<=mmx-1; i+=gap)
        {
            MinMax(i, i+gap-1, &mn, &mx);
            if (mn==-1) continue;
            v.push_back(mn);
            if (mn!=mx) v.push_back(mx);
        }
        sort(v.begin(), v.end());
        for (int i=1; i<v.size(); i++) res=max(res, v[i]-v[i-1]);
        return res;
    }
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:15:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |         while (v.size()<N)
      |                ~~~~~~~~^~
gap.cpp:23:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int i=1; i<v.size(); i++) mx=max(mx, v[i]-v[i-1]);
      |                       ~^~~~~~~~~
gap.cpp:13:31: warning: unused variable 'idx' [-Wunused-variable]
   13 |         ll x=0, y=1e18, a, b, idx=0, mx=0;
      |                               ^~~
gap.cpp:52:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for (int i=1; i<v.size(); i++) res=max(res, v[i]-v[i-1]);
      |                       ~^~~~~~~~~

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