제출 #413647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413647		Ronin13	Road Construction (JOI21_road_construction)	C++14	11 / 100	10102 ms	352392 KiB

road_construction

#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ull unsigned ll
#define pb push_back
#define epb emplace_back
using namespace std;

struct Point{
    ll x,y;
    Point(ll x,ll y):x(x),y(y){}
    Point(){
    }
};

ll dist(Point A,Point B){
    return abs(A.x-B.x)+abs(A.y-B.y);
}

bool check(vector<Point>a){
    for(Point A:a){
        if(A.y!=0)return false;
    }
    return true;
}
bool comp(Point A,Point B){
    if(A.x==B.x)return A.y<B.y;
    return A.x<B.x;
}
void solve(){
    int n;cin>>n;
    int k;cin>>k;
    vector<Point>a(n);
    for(int i=0;i<n;i++)cin>>a[i].x>>a[i].y;
    sort(a.begin(),a.end(),comp);
    if(check(a)){
        multiset<pair<ll,pii> >d;
        for(int i=0;i<n-1;i++)d.insert({dist(a[i],a[i+1]),{i,i+1}});
        vector<ll>ans;
        while(ans.size()<k){
            pair<ll,pii>x=*d.begin();
            ans.pb(x.f);
            int l=x.s.f,r=x.s.s;
            d.erase(x);
            if(r<n-1)
            d.insert({dist(a[l],a[r+1]),{l,r+1}});
        }
        for(ll to:ans){
            cout<<to<<"\n";
        }
        return;
    }
    multiset<ll>d;
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            d.insert(dist(a[i],a[j]));
        }
    }
    int ind=0;
    for(ll to:d){
            if(ind>=k)break;
            cout<<to<<"\n";
            ind++;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
}

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

road_construction.cpp: In function 'void solve()':
road_construction.cpp:43:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |         while(ans.size()<k){
      |               ~~~~~~~~~~^~

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