Cod sursa(job #2773352)

Utilizator AndreibatmanAndrei Croitoriu Andreibatman Data 6 septembrie 2021 17:59:30
Problema Infasuratoare convexa Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
ifstream fin ("infasuratoare.in");
ofstream fout("infasuratoare.out");
struct ceva
{
    double x,y;
}v[100010],p,st[100010];
double cp(ceva a,ceva b,ceva c)
{
    return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
}
int cmp(ceva a,ceva b)
{
    return cp(a,b,{0,0})<0;
}
int n,i,poz,vf;
int main()
{
    p.x=p.y=INT_MAX;
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>v[i].x>>v[i].y;
        if(v[i].y<p.y)
        {
            poz=i;
            p=v[i];
        }
        else if(v[i].y==p.y && v[i].x<p.x)
        {
            p=v[i];
            poz=i;
        }
    }
    swap(v[1],v[poz]);
    sort(v+1,v+n+1,cmp);
    st[++vf]=v[1];
    st[++vf]=v[2];
    for(i=3;i<=n;i++)
    {
        while(vf>=1 && cp(st[vf-1],st[vf],v[i])>0)
            vf--;
        st[++vf]=v[i];
    }
    fout<<vf<<'\n';
    while(vf)
        fout<<fixed<<setprecision(12)<<st[vf].x<<" "<<st[vf--].y<<'\n';
    return 0;
}