This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define SIZE 100010
using namespace std;
typedef long long ll;
ll N;
pair<ll,ll>p[SIZE];
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>N;
for(int i=0;i<N;i++){
cin>>p[i<<1].first>>p[i<<1].second;
cin>>p[i<<1|1].first>>p[i<<1|1].second;
}
sort(p,p+2*N);
for(int i=1;i<2*N-2;i+=2)printf("%lld %lld %lld %lld\n",p[i].first,p[i].second,p[i+1].first,p[i+1].second);
}
# | 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... |