oj.uz

답안 #667562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667562 2022-12-01T17:39:21 Z mychecksedad Roads (CEOI20_roads) C++17
15 / 100
 17 ms 1236 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;

int n;
array<int, 5> p[N];

void solve(){
    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> p[i][0] >> p[i][1];
        cin >> p[i][2] >> p[i][3];
        if(p[i][1] < p[i][3]){
            swap(p[i][1], p[i][3]);
            swap(p[i][0], p[i][2]);
        }
        p[i][5] = i;
    }
    sort(p, p + n);
    for(int i = 0; i < n - 1; ++i){
        if(p[i][0] != p[i + 1][0])
            cout << p[i][0] << ' ' << p[i][1] << ' ' << p[i + 1][0] << ' ' << p[i + 1][1] << '\n';
        else{
            if(p[i][1] < p[i + 1][1])
                cout << p[i][0] << ' ' << p[i][1] << ' ' << p[i + 1][2] << ' ' << p[i + 1][3] << '\n';
            else
                cout << p[i][2] << ' ' << p[i][3] << ' ' << p[i + 1][0] << ' ' << p[i + 1][1] << '\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 function 'int main()':
roads.cpp:49:16: warning: unused variable 'aa' [-Wunused-variable]
   49 |     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
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 8 ms 824 KB Output is correct
5 Correct 15 ms 1236 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 724 KB Output is correct
5 Correct 17 ms 1224 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Failed 1 ms 340 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
9 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 Correct 2 ms 340 KB Output is correct
4 Correct 9 ms 724 KB Output is correct
5 Correct 16 ms 1236 KB Output is correct
6 Failed 1 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
7 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 1 ms 256 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -