제출 #400597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400597		A_D	Gap (APIO16_gap)	C++14	30 / 100	63 ms	3336 KiB

gap

#include "gap.h"

#include <bits/stdc++.h>

#define ll long long

using namespace std;
ll l2=0,r2=1e18;
ll *l1=&l2;
ll *r1=&r2;
vector <ll> vec;
set <ll> st;
int n;
ll s(ll m)
{
    vector<ll> vec;
    ll l=0,r=1e18;
    l2=0,r2=1e18;
    while(l<=r&&m--){
        MinMax(l,r,l1,r1);
        if(l2!=-1)vec.push_back(l2);
        if(r2!=-1)vec.push_back(r2);
        l=l2;
        r=r2;
        l++;
        r--;
    }
    sort(vec.begin(),vec.end());
    ll ans=1;
    for(ll i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
    return ans;
}
void bs(int l,int r)
{
    if(l>r||n==0)return;
    int mid=(l+r)/2;
    MinMax(l,mid,l1,r1);
    if(l2==-1){
        bs(mid+1,r);
    }
    else if(l2==r2){
        vec.push_back(l2);
        n--;
        st.insert(l2);
        bs(mid+1,r);
    }
    else{
        n-=2;
        vec.push_back(l2);
        vec.push_back(r2);
        bs(l2+1,r2-1);
        bs(mid+1,r);
    }
}
ll s2()
{
    st.clear();vec.clear();
    bs(0,1e18);
    ll ans=1;
    sort(vec.begin(),vec.end());
    for(ll i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
    return ans;
}
long long findGap(int T, int N)
{
    n=N;
    if(T==1)return s((N+1)/2);
    else{
        return s2();
    }
}

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

gap.cpp: In function 'long long int s(long long int)':
gap.cpp:30:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(ll i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
      |                ~^~~~~~~~~~~
gap.cpp: In function 'long long int s2()':
gap.cpp:58:10: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   58 |     bs(0,1e18);
      |          ^~~~
gap.cpp:61:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for(ll i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
      |                ~^~~~~~~~~~~

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