제출 #703458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
703458		Darren0724	Roads (CEOI20_roads)	C++17	30 / 100	206 ms	9244 KiB

roads

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
struct line{
    int x1,y1,x2,y2;
    line(){}
    line(int a,int b,int c,int d){
        x1=a,y1=b,x2=c,y2=d;
        if(y1>y2){
            swap(x1,x2);
            swap(y1,y2);
        }
    }
};
bool operator<(line a,line b){
    if(a.x1==b.x1){
        return a.y1<b.y1;
    }
    return a.x1<b.x1;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    vector<line> v(n);
    for(int i=0;i<n;i++){
        int a,b,c,d;cin>>a>>b>>c>>d;
        v[i]=line(a,b,c,d);
    }
    int tmp1=v[0].x2-v[0].x1;
    int tmp2=v[0].y2-v[0].y1;
    if(tmp2==0){
        for(int i=0;i<n;i++){
            swap(v[i].x1,v[i].y1);
            swap(v[i].x2,v[i].y2);
        }
        sort(all(v));
        for(int i=0;i<n;i++){
            swap(v[i].x1,v[i].y1);
            swap(v[i].x2,v[i].y2);
        }
        for(int i=1;i<n;i++){
            cout<<v[i-1].x2<<' '<<v[i-1].y2<<' '<<v[i].x1<<' '<<v[i].y1<<endl;
        }
        return 0;
    }
    sort(all(v),[&](line a,line b){
         if(a.y2*tmp1-a.x2*tmp2==b.y2*tmp1-b.x2*tmp2){
            return a.y2<b.y2;
         }
         return a.y2*tmp1-a.x2*tmp2<b.y2*tmp1-b.x2*tmp2;
    });
    for(int i=1;i<n;i++){
        cout<<v[i-1].x2<<' '<<v[i-1].y2<<' '<<v[i].x1<<' '<<v[i].y1<<endl;
    }


    return 0;
}

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