제출 #412947

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412947		Pbezz	Roads (CEOI20_roads)	C++14	15 / 100	23 ms	2116 KiB

roads

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define ll long long
#define pb push_back
#define mp make_pair
typedef pair<ll,ll> pii;
 
typedef tree<pii ,null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
 
const ll MAXN = 301;
const ll MOD = 1e9+7;
const ll INF = 1e6+10;


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	ll n,i,x1,x2,y1,y2;
	cin>>n;

	vector< pair<pii, pii> >v(n);
	for(i=0;i<n;i++){

	cin>>x1>>y1>>x2>>y2;
	if(y2<y1)swap(y2,y1);

	v[i]={ {x1,y1}, {x2,y2} };
	}//x1=x2 e y2>y1

	sort(v.begin(),v.end());

	for(i=0;i<n-1;i++){

	cout<<v[i].second.first<<" "<<v[i].second.second<<" ";
	cout<<v[i+1].first.first<<" "<<v[i+1].first.second<<'\n';


}








return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 15 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 40