USACO: Fencing the Cows

Fencing the Cows
Hal Burch

Farmer John wishes to build a fence to contain his cows, but he's a bit short on cash right. Any fence he builds must contain all of the favorite grazing spots for his cows. Given the location of these spots, determine the length of the shortest fence which encloses them.

PROGRAM NAME: fc

INPUT FORMAT

The first line of the input file contains one integer, N. N (0 <= N <= 10,000) is the number of grazing spots that Farmer john wishes to enclose. The next N line consists of two real numbers, Xi and Yi, corresponding to the location of the grazing spots in the plane (-1,000,000 <= Xi,Yi <= 1,000,000). The numbers will be in decimal format.

SAMPLE INPUT (file fc.in)

4
4 8
4 12
5 9.3
7 8

OUTPUT FORMAT

The output should consists of one real number, the length of fence required. The output should be accurate to two decimal places.

SAMPLE OUTPUT (file fc.out)

12.00

最水的凸包啦，分析：由三角不等式可推出，使用凸包来包围所有的点，周长最小

刚好算法分析的课本上讲了个分治解凸包的算法，于是决定试一试，结果tmd各种纠结（特别是在合并两个凸包的时候），真是百思不得其解为神马复杂度同为O(nlogn)，却硬要这样解呢？

最后还是用回直接扫描，本来以为还要考虑精度问题，先试试提交再说，结果就过了，orz。。。

 

PS：要考虑一种特殊的情况我也没写进去：假设a、b、c三点的极坐标角相同，那些对它们进行排序的时候就应该按距离r升序或者降序排列。不过这道题的数据确实很难做到这一点——因为每个人选择观察者位置的时候都可能会有自己特殊的想法，所以这个漏洞就不怪USACO啦~

 

代码：

/* ID: geterns1 PROG: fc LANG: C++ */ #include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; const int _max = 10000; const double infi = 1000001.f; struct dLList{ double a, x, y; dLList *pre, *nxt; }; const dLList *ptr1, *ptr2; int compare(const void *ele1, const void *ele2){ ptr1 = (const dLList *)ele1; ptr2 = (const dLList *)ele2; if (ptr1->a < ptr2->a) return -1; else if (ptr1->a == ptr2->a) return 0; else return 1; } int size; dLList dLst[_max]; dLList *flag; void check_point(dLList *d){ //check by cross product if ((d->pre->x - d->x) * (d->nxt->y - d->y) - (d->nxt->x - d->x) * (d->pre->y - d->y) > 0){ //keep the flag if (flag == d) flag = d->pre; //remove d->pre->nxt = d->nxt; d->nxt->pre = d->pre; //go back check_point(d->pre); } } double graham_scan(){ //find the left most point and move it to the end int mIdx = 0; for (int i = 1; i < size; i ++){ if (dLst[i].x < dLst[mIdx].x) mIdx = i; } dLList tmp = dLst[mIdx]; dLst[mIdx] = dLst[size - 1]; dLst[size - 1] = tmp; //calculate the polar angles and sort them for (int i = 0; i < size - 1; i ++) dLst[i].a = atan2(dLst[i].y - dLst[size - 1].y, dLst[i].x - dLst[size - 1].x); qsort(dLst, size - 1, sizeof(dLList), compare); //link flag = dLst + size - 1; for (int i = 0; i < size - 1; i ++){ dLst[i].nxt = dLst + i + 1; dLst[i + 1].pre = dLst + i; } dLst->pre = flag; flag->nxt = dLst; //check each point for (int i = 0; i < size; i ++) check_point(dLst + i); //calculate the result dLList *dPtr = flag; double result = sqrt((flag->x - flag->pre->x) * (flag->x - flag->pre->x) + (flag->y - flag->pre->y) * (flag->y - flag->pre->y)); while (dPtr->nxt != flag){ result += sqrt((dPtr->nxt->x - dPtr->x) * (dPtr->nxt->x - dPtr->x) + (dPtr->nxt->y - dPtr->y) * (dPtr->nxt->y - dPtr->y)); dPtr = dPtr->nxt; } return result; } int main(){ freopen("fc.in", "r", stdin); freopen("fc.out", "w", stdout); scanf("%d/n", &size); for (int i = 0; i < size; i ++) scanf("%lf %lf/n", &dLst[i].x, &dLst[i].y); printf("%.2lf/n", graham_scan()); fclose(stdin); fclose(stdout); return 0; }