Cod sursa(job #3217379)

Utilizator Silviu643Dumitrescu Silviu Florian Silviu643 Data 22 martie 2024 17:00:02
Problema Infasuratoare convexa Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.96 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");
struct bologneze{
double x,y;
}a[120005];
int n;
double det(bologneze a, bologneze b, bologneze c)
{
    return a.x*b.y+a.y*c.x+b.x*c.y-c.x*b.y-b.x*a.y-c.y*a.x;
}
bool fcmp(bologneze n,bologneze m)
{
    return det(a[1],n,m)>0;
}
int main()
{
    fin>>n;
    fin>>a[1].x>>a[1].y;
    double mnx=a[1].x;
    int mni=1;
    for(int i=2;i<=n;i++)
        {fin>>a[i].x>>a[i].y;
            if(a[i].x<mnx)
                mnx=a[i].x,mni=i;
            else if(a[i].x==mnx) if(a[i].y<a[mni].y) mni=i;
        }
    swap(a[mni],a[1]);
    sort(a+2,a+n+1,fcmp);
    int k=2;
    a[n+1]=a[1];
    for(int i=3;i<=n+1;i++)
    {
        while(k>=2 && det(a[k-1],a[k],a[i])<0) k--;
        a[++k]=a[i];
    }
    fout<<k-1<<'\n';
    for(int i=2;i<=k;i++)
        fout<<fixed<<setprecision(6)<<a[i].x<<' '<<a[i].y<<'\n';
    return 0;
}