제출 #798038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
798038		coding_snorlax	Gap (APIO16_gap)	C++14	0 / 100	3085 ms	6804 KiB

gap

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
set<ll> all_data;
vector<pair<ll,ll>> now_interval;
vector<pair<ll,ll>> next_interval;
ll mn,mx;
ll find_ans(){
    ll answer = 0;
    for(auto i = all_data.begin();i!=all_data.end();i++){
        i++;
        if(i!=all_data.end()){
            ll check = *i; i--;
            answer = max(answer, check - *i);
        }
        else break;
    }
    return answer;
}
ll findGap(int T, int N)
{
    now_interval.push_back(make_pair(0,1e18));
    while((int)now_interval.size()){
        for(auto i:now_interval){
            MinMax(i.first,i.second,&mn,&mx);
            if(mn!=-1){
                if(mn==mx) all_data.insert(mn);
                else{
                    all_data.insert(mn);
                    all_data.insert(mx);
                    if((mx-mn)==1) next_interval.push_back(make_pair(mn+1,(mn+mx)/2));
                    else{
                        next_interval.push_back(make_pair(mn+1,(mn+mx)/2));
                        next_interval.push_back(make_pair((mn+mx)/2+1,mx-1));
                    }
                }
            }
        }
        now_interval=next_interval;
        next_interval.clear();
    }
    //return find_ans();
}
/*
    for(int i=1;i<=(N+1)/2;i++){
        MinMax(mn+1,mx-1,&mn,&mx);
        Data1.push_back(mn);
        Data2.push_back(mx);
    }
    ll answer = 0;
    for(ll i=0;i<(int)Data1.size()-1;i++){
        answer=max(answer,Data1[i+1]-Data1[i]);
    }
    answer=max(answer,Data2.back()-Data1.back());
    for(ll i=0;i<(int)Data2.size()-1;i++){
        answer=max(answer,-Data2[i+1]+Data2[i]);
    }
    return answer;
}*/

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:44:1: warning: no return statement in function returning non-void [-Wreturn-type]
   44 | }
      | ^

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