oj.uz

Submission #703455

# Submission time Handle Problem Language Result Execution time Memory
703455 2023-02-27T12:32:50 Z Darren0724 Roads (CEOI20_roads) C++17
15 / 100
 41 ms 2120 KB 
#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].y2-v[i].y1)/tmp2*tmp1<<' '<<v[i].y1<<endl;
    }


    return 0;
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 212 KB Condition failed: "iA != P2I.end()"
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 19 ms 1224 KB Output is correct
5 Correct 41 ms 2120 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 21 ms 1156 KB Output is correct
5 Correct 40 ms 2048 KB Output is correct
6 Failed 1 ms 212 KB Condition failed: "iA != P2I.end()"
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 372 KB Output is correct
4 Correct 19 ms 1180 KB Output is correct
5 Correct 37 ms 2064 KB Output is correct
6 Failed 1 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 212 KB Condition failed: "iA != P2I.end()"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 324 KB Condition failed: "iA != P2I.end()"
2 Halted 0 ms 0 KB -