Cod sursa(job #2349194)

Utilizator mihai50000Mihai-Cristian Popescu mihai50000 Data 20 februarie 2019 11:34:25
Problema Infasuratoare convexa Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include <bits/stdc++.h>

using namespace std;

ifstream in("infasuratoare.in");
ofstream out("infasuratoare.in");

const int DIM = 120007;

pair <double, double> v[DIM];
pair <double, double> stiva[DIM];

double cross_product(pair <double, double> A, pair <double, double> B, pair <double, double> C)
{
	return (B.first - A.first) * (C.second - A.second) - (B.second - A.second) * (C.first - A.first);
}

bool cmp(pair <double, double> A, pair <double, double> B)
{
	return cross_product(v[1], A, B) < 0;
}

int main()
{
	int n;
	in >> n;
	
	for(int i = 1; i <= n; i++)
	{
		in >> v[i].first >> v[i].second;
	}
	
	int pos = 1;
	
	for(int i = 2; i <= n; i++)
		if(v[i] < v[pos])
			pos = i;
	
	swap(v[1], v[pos]);
	
	sort(v + 2, v + 1 + n, cmp);
	
	stiva[1] = v[1];
	stiva[2] = v[2];
	
	int k = 2;
	
	for(int i = 3; i <= n; i++)
	{
		while(k >= 2 && cross_product(stiva[k - 1], stiva[k], v[i]) > 0)
			k--;
		
		stiva[++k] = v[i];
	}
	
	out << k << '\n';
	
	for(int i = k; i >= 1; i--)
	{
		out << fixed << setprecision(9) << stiva[i].first << ' ' << stiva[i].second << '\n';
	}
}