Submission #934880

#TimeUsernameProblemLanguageResultExecution timeMemory
934880Halym2007Roads (CEOI20_roads)C++11
0 / 100
2 ms600 KiB
#include <bits/stdc++.h> using namespace std; #define sz size() #define pb push_back #define ff first #define ss second int n, x_1, x_2, y_1, y_2; vector <pair <int, int>> v; int main () { cin >> n; for (int i = 1; i <= n; ++i) { cin >> x_1 >> y_1 >> x_2 >> y_2; assert (x_1 == x_2); v.pb ({x_1, min (y_1, y_2)}); } sort (v.begin(), v.end()); int git = (int)v.sz; git--; for (int i = 0; i < git; ++i) { cout << v[i].ff << " " << v[i].ss << " " << v[i + 1].ff << " " << v[i + 1].ss << "\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...