제출 #782266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
782266		PoonYaPat	Road Construction (JOI21_road_construction)	C++14	100 / 100	1490 ms	15360 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;

int n,k;
pii a[250005];
vector<ll> ans;

bool check(ll want, int mode) {
    vector<ll> res;
    set<pii> s;

    for (int l=1, r=1; r<=n; ++r) {
        while (a[l].first<a[r].first-want) {
            s.erase(s.find({a[l].second,a[l].first}));
            ++l;
        }

        auto it=s.upper_bound({a[r].second-want,-1e15});
        while (it!=s.end() && (*it).first<=a[r].second+want) {
            res.push_back(max(abs((*it).second-a[r].first),abs((*it).first-a[r].second)));
            if (res.size()==k) return true;
            ++it;
        }

        s.insert(pii(a[r].second,a[r].first));
    }

    if (mode) swap(ans,res);
    return false;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>k;
    for (int i=1; i<=n; ++i) {
        ll x,y; cin>>x>>y;
        a[i].first=x+y;
        a[i].second=x-y;
    }
    sort(a+1,a+n+1);

    ll l=1, r=4e9;
    while (l<r) {
        ll mid=(l+r)/2;
        if (check(mid,0)) r=mid;
        else l=mid+1;
    }
    check(l-1,1);
    while (ans.size()<k) ans.push_back(l);
    sort(ans.begin(),ans.end());
    for (auto s : ans) cout<<s<<"\n";
}

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

road_construction.cpp: In function 'bool check(ll, int)':
road_construction.cpp:23:27: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |             if (res.size()==k) return true;
      |                 ~~~~~~~~~~^~~
road_construction.cpp: In function 'int main()':
road_construction.cpp:51:22: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |     while (ans.size()<k) ans.push_back(l);
      |            ~~~~~~~~~~^~

• Subtask 1: 5 / 5
• Subtask 2: 6 / 6
• Subtask 3: 7 / 7
• Subtask 4: 20 / 20
• Subtask 5: 27 / 27
• Subtask 6: 35 / 35