제출 #492487

#제출 시각아이디문제언어결과실행 시간메모리
492487LittleCubeRoads (CEOI20_roads)C++14
0 / 100
2 ms332 KiB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N;
pii p[200005];
vector<pii> v;
signed main()
{
    cin >> N;
    for (int i = 1; i <= N; i++)
        cin >> p[2 * i - 1].F >> p[2 * i - 1].S >> p[2 * i].F >> p[2 * i].S;
    for (int i = 1; i <= N; i++)
        v.emplace_back(max(p[2 * i - 1], p[2 * i]));
    sort(v.begin(), v.end());
    for (int i = 1; i < N; i++)
        cout << v[i - 1].F << " " << v[i - 1].S << " " << v[i].F << " " << v[i].S << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...