This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//in the name of god//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _ ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define MP make_pair
const int maxn = 1e3 + 10;
const int mod = 1e9 + 7;
int main(){_
int n;
cin >> n;
vector<pair<int, pair<int, int> > > v(n);
for(int i = 0 ; i < n ; i ++){
int x, y, yy;
cin >> x >> y >> x >> yy;
if(y > yy)
swap(y, yy);
v[i].F = x;
v[i].S = MP(y, yy);
}
sort(all(v));
vector<pair<pair<int, int>, pair<int, int> > > ans;
for(int i = 1 ; i < n ; i ++)
ans.push_back(MP(MP(v[i].F, v[i].S.F), MP(v[i - 1].F, v[i - 1].S.S)));
for(auto i : ans)
cout << i.F.F << ' ' << i.F.S << ' ' << i.S.F << ' ' << i.S.S << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |