oj.uz

답안 #963048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963048 2024-04-14T12:15:36 Z anton Roads (CEOI20_roads) C++17
0 / 100
 3 ms 476 KB 
#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;
        pts[i] = {a, b};
    }
    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.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 344 KB Condition failed: "!Cross(S[*pi], S[*pa])"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 3 ms 476 KB Condition failed: "!Cross(S[*pi], S[*pa])"
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 3 ms 348 KB Condition failed: "!Cross(S[*pi], S[*pa])"
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 3 ms 348 KB Condition failed: "!Cross(S[*pi], S[*pa])"
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 348 KB Condition failed: "!Cross(S[*pi], S[*pa])"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 348 KB Condition failed: "!Cross(S[*pi], S[*pa])"
2 Halted 0 ms 0 KB -