제출 #963051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963051		anton	Roads (CEOI20_roads)	C++17	15 / 100	60 ms	1876 KiB

roads

#include<bits/stdc++.h>

using namespace std;

struct Point{
    int x, y;
};
const int MAX_N = 1e5;
pair<Point, Point> pts[MAX_N];
signed main(){
    int n;
    cin>>n;
    for(int i = 0; i<n; i++){
        Point a, b;
        cin>>a.x>>a.y>>b.x>>b.y;
        if(a.y<b.y){
            pts[i] = {a, b};
        }
        else{
            pts[i] = {b, a};
        }
    }
    auto cmp =[&](pair<Point, Point>& a, pair<Point, Point>& b){
        if(a.first.x!=b.first.x){
            return a.first.x<b.first.x;
        }
        else{
            return a.first.y< b.first.y;
        }
    };
    sort(&pts[0], &pts[n], cmp);

    for(int i = 0; i<n-1; i++){
        cout<<pts[i].second.x<<" "<<pts[i].second.y<<" "<<pts[i+1].first.x<<" "<<pts[i+1].first.y<<endl;
    }
}

• Subtask 1: 0 / 0
• Subtask 2: 15 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 40