Cod sursa(job #1643201)

Utilizator catalin_99bbarbu catalin catalin_99b Data 9 martie 2016 18:04:14
Problema Infasuratoare convexa Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
#include <bits/stdc++.h>
#define nmax 120001
using namespace std;
ifstream f("infasuratoare.in");
ofstream g("infasuratoare.out");
struct punct
    {
        double x, y;
    }v[nmax],w[nmax];
bool trig(punct a,punct b)
{
    return a.y*b.x<=a.x*b.y;

}

bool cmp(punct a, punct b)
{
    if (a.x>b.x)
        return true;
        else
        if (a.x==b.x)
            return (a.y<b.y);
            else
                return false;
}
int det (punct a, punct b, punct c)
{
    return (a.x*b.y+b.x*c.y+a.y*c.x-b.y*c.x-a.x*c.y-a.y*b.x)<0;
}
int n, st[nmax], k, viz[nmax];
int main()
{
    int i, mod=1;
    f>>n;
    for (i=1; i<=n; i++)
        {
            f>>v[i].x;
            f>>v[i].y;
        }
    sort (v+1, v+n+1, cmp);
    st[++k]=1;
    st[++k]=2;
    viz[2]=1;
    for (i=3; i>0; i+=mod)
        if (!viz[i])
    {
        while (k>1 && det(v[st[k-1]], v[st[k]], v[i]))
            viz[st[k--]]=0;
        st[++k]=i;
        viz[i]=1;
        if (i==n)
            mod=-1;
    }
    g<<k-1<<'\n';

    for (i=1; i<k; i++)
        w[i]=v[st[i]];
    sort(w+1,w+k,trig);

    for (i=1; i<k; i++)
        {
            g<<fixed<<setprecision(6)<<w[i].x<<" ";
            g<<fixed<<setprecision(6)<<w[i].y<<'\n';
        }
    f.close();
    g.close();
}