# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
534916 |
2022-03-09T06:48:37 Z |
vector |
Roads (CEOI20_roads) |
C++17 |
|
1 ms |
328 KB |
#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;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 |
1 |
Incorrect |
0 ms |
320 KB |
Expected EOF |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
328 KB |
Expected EOF |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Expected EOF |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Expected EOF |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Expected EOF |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
316 KB |
Expected EOF |
2 |
Halted |
0 ms |
0 KB |
- |