Pagini recente » Monitorul de evaluare | Cod sursa (job #2596989) | Cod sursa (job #1369984) | Autentificare | Cod sursa (job #2756064)
#include <fstream>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
ifstream cin("infasuratoare.in");
ofstream cout("infasuratoare.out");
#define DIM 120005
const double eps = 1.0e-14;
struct nanu {
double x, y;
} v[DIM], pct;
int st[DIM], n, i, vf;
static inline double det(nanu a, nanu b, nanu c) {
return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}
static inline int ccw(nanu a, nanu b, nanu c){
double k = det(a, b, c);
if(fabs(k) < eps)
return 0;
if(k >= eps)
return 1;
return -1;
}
static inline bool cmp(nanu a, nanu b){
return ccw(pct, a, b) > 0 ;
}
int main() {
cin >> n;
cin >> v[1].x >> v[1].y;
for(i = 2; i <= n; i++){
cin >> v[i].x >> v[i].y;
if(v[i].y - v[1].y <= -eps || (fabs(v[i].y - v[1].y) < eps && v[i].x - v[1].x <= -eps))
swap(v[1], v[i]);
}
pct = v[1];
sort(v + 2, v + n + 1, cmp);
st[++vf] = 1;
st[++vf] = 2;
v[n + 1] = v[1];
i = 3;
while(i <= n + 1)
if(ccw(v[st[vf - 1]], v[st[vf]], v[i]) > 0){
st[++vf] = i;
i++;
}
else vf--;
cout << vf - 1 << '\n';
for(i = 1; i < vf; i++)
cout << fixed << setprecision(6) << v[st[i]].x << " " << v[st[i]].y << '\n';
return 0;
}