Submission #492491

#TimeUsernameProblemLanguageResultExecution timeMemory
492491LittleCubeRoads (CEOI20_roads)C++14
15 / 100
40 ms1968 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<int> 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; assert(p[2 * i - 1].F == p[2 * i].F); } for (int i = 1; i <= N; i++) v.emplace_back(i); sort(v.begin(), v.end(), [&](int i1, int i2) { return max(p[2 * i1 - 1], p[2 * i1]) < max(p[2 * i2 - 1], p[2 * i2]); }); for (int i = 1; i < N; i++) cout << max(p[2 * v[i - 1] - 1], p[2 * v[i - 1]]).F << " " << max(p[2 * v[i - 1] - 1], p[2 * v[i - 1]]).S << " " << min(p[2 * v[i] - 1], p[2 * v[i]]).F << " " << min(p[2 * v[i] - 1], p[2 * 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...