| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 623774 | Vladth11 | Roads (CEOI20_roads) | C++14 | 0 ms | 0 KiB |
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 C 1
#define P 0
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long double, pii> muchie;
const ll NMAX = 100001;
const ll VMAX = 101;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 447;
const ll base = 117;
const ll nr_of_bits = 18;
const ll inv2 = 500000004;
map <pii, pii> mp;
pii v[NMAX * 2];
struct ura{
pii a, b;
};
vector <ura> sol;
map <pii, bool> scutit;
double slope = 1;
bool mic(pii a, pii b){
pair <double, double> pa = {a.first * tg(slope), a.second * ctg(slope)};
pair <double, double> pb = {b.first * tg(slope), b.second * ctg(slope)};
return pa < pb;
}
bool cmp(pii a, pii b){
return (mic(a, b));
}
int main() {
//ifstream cin(".in");
//ofstream cout(".out");
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, i;
cin >> n;
for(i = 1; i <= n; i++){
pii a, b;
cin >> a.first >> a.second >> b.first >> b.second;
if(a.first != b.first)
slope = (double)((double)a.second - (double)b.second) / (double)((double)a.first - (double)b.first);
mp[a] = b;
mp[b] = a;
if(mic(a, b))
swap(a, b);
v[i] = a;
}
sort(v + 1, v + n + 1, cmp);
for(i = 1; i < n; i++){
sol.push_back({v[i], mp[v[i + 1]]});
}
for(auto x : sol){
cout << x.a.first << " " << x.a.second << " " << x.b.first << " " << x.b.second << "\n";
}
return 0;
}