Pagini recente » Cod sursa (job #2539428) | Cod sursa (job #901110) | Cod sursa (job #755105) | Cod sursa (job #2570747) | Cod sursa (job #2451626)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");
const int NMAX = 120005;
const long long INF = (1<<29);
struct punct
{
long double x,y;
};
punct v[NMAX],pct[NMAX],pct2[NMAX],rasp[NMAX];
long double panta(punct a,punct b,punct c)
{
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
bool cmp2(punct a,punct b)
{
return panta(rasp[1],a,b)>=0;
}
bool cmp1(punct a,punct b)
{
if(a.y==b.y) return a.x>b.x;
return a.y<b.y;
}
bool cmp(punct a,punct b)
{
if(a.x==b.x) return a.y<b.y;
return a.x>b.x;
}
int main()
{
long long n;
fin >> n;
for(long long i=1;i<=n;i++) fin >> v[i].x >> v[i].y;
sort(v+1,v+n+1,cmp);
pct[1]=v[1];
pct[2]=v[2];
long long sz=2;
for(long long i=3;i<=n;i++)
{
while(sz>=2 and panta(pct[sz-1],pct[sz],v[i])<0)
sz--;
pct[++sz]=v[i];
}
int aux=sz;
sz=2;
pct2[1]=v[1];
pct2[2]=v[2];
for(long long i=3;i<=n;i++)
{
while(sz>=2 and panta(pct2[sz-1],pct2[sz],v[i])>0)
sz--;
pct2[++sz]=v[i];
}
for(long long i=1;i<=aux;i++)
rasp[i]=pct[i];
for(long long i=1;i<=sz;i++)
rasp[i+aux]=pct2[i];
sort(rasp+1,rasp+aux+sz+1,cmp1);
sort(rasp+2,rasp+aux+sz+1,cmp2);
int afis=0;
for(int i=1;i<=aux+sz;i++)
{
if(!(rasp[i].x==rasp[i-1].x and rasp[i].y==rasp[i-1].y))
afis++;
}
fout << afis << '\n';
for(int i=1;i<=aux+sz;i++)
{
if(!(rasp[i].x==rasp[i-1].x and rasp[i].y==rasp[i-1].y))
fout << fixed << setprecision(13) << rasp[i].x << ' ' << rasp[i].y << '\n';
}
return 0;
}