#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);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Failed |
1 ms |
204 KB |
Condition failed: "Volt[i]" |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
9 ms |
1228 KB |
Output is correct |
5 |
Correct |
17 ms |
2124 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
13 ms |
1100 KB |
Output is correct |
5 |
Correct |
21 ms |
2020 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Failed |
1 ms |
332 KB |
Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])" |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
2 ms |
328 KB |
Output is correct |
4 |
Correct |
9 ms |
1100 KB |
Output is correct |
5 |
Correct |
18 ms |
2012 KB |
Output is correct |
6 |
Failed |
1 ms |
320 KB |
Condition failed: "Volt[i]" |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Failed |
1 ms |
204 KB |
Condition failed: "Volt[i]" |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Failed |
1 ms |
204 KB |
Condition failed: "Volt[i]" |
2 |
Halted |
0 ms |
0 KB |
- |