oj.uz

답안 #667574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667574 2022-12-01T17:56:38 Z mychecksedad Roads (CEOI20_roads) C++17
0 / 100
 1 ms 340 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD1 (1000000000+7)
#define MOD (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;

struct Point{
    ll x, y;
    Point(){};
    Point(ll a, ll b){
        x = a, y = b;
    }
};

struct Line{
    Point l, r;
    Line(){};
    Line(Point l, Point r){
        l = l, r = r;
        if(l.y < r.y) swap(l, r);
    }
    void check(){
        if(l.y < r.y) swap(l, r);
    }
    bool operator<(Line &other) const{
        if(other.l.x != l.x){
            return other.l.x > l.x;
        }
        return other.l.y > l.y;
    }
    bool is(Line &other){

    }
};

int n;
Line p[N];
void solve(){
    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> p[i].l.x >> p[i].l.y;
        cin >> p[i].r.x >> p[i].r.y;
        p[i].check();
    }
    sort(p, p + n);
    for(int i = 0; i < n - 1; ++i){
        cout << p[i].l.x << ' ' << p[i].l.y << ' ' << p[i + 1].l.x << ' ' << p[i + 1].l.y << '\n';
    }
}




int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

roads.cpp: In member function 'bool Line::is(Line&)':
roads.cpp:43:5: warning: no return statement in function returning non-void [-Wreturn-type]
   43 |     }
      |     ^
roads.cpp: In function 'int main()':
roads.cpp:66:16: warning: unused variable 'aa' [-Wunused-variable]
   66 |     int T = 1, aa;
      |                ^~

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

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

Subtask #3
0 / 15.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -