제출 #934877

#제출 시각아이디문제언어결과실행 시간메모리
934877Halym2007Roads (CEOI20_roads)C++11
0 / 100
1 ms348 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 == y_2);
		v.pb ({x_1, min (y_1, y_2)});
	}
	sort (v.begin(), v.end());
	for (int i = 0; i < (int)v.sz - 1; ++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...