poj1696 Space Ant【计算几何】

含极角序排序模板。

 

Space Ant

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5334		Accepted: 3312

Description

The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on the left side of its head and just three feet all on the right side of its body and suffers from three walking limitations: 

1. It can not turn right due to its special body structure. 
2. It leaves a red path while walking. 
3. It hates to pass over a previously red colored path, and never does that.

The pictures transmitted by the Discovery space ship depicts that plants in the Y1999 grow in special points on the planet. Analysis of several thousands of the pictures have resulted in discovering a magic coordinate system governing the grow points of the plants. In this coordinate system with x and y axes, no two plants share the same x or y. 
An M11 needs to eat exactly one plant in each day to stay alive. When it eats one plant, it remains there for the rest of the day with no move. Next day, it looks for another plant to go there and eat it. If it can not reach any other plant it dies by the end of the day. Notice that it can reach a plant in any distance. 
The problem is to find a path for an M11 to let it live longest. 
Input is a set of (x, y) coordinates of plants. Suppose A with the coordinates (xA, yA) is the plant with the least y-coordinate. M11 starts from point (0,yA) heading towards plant A. Notice that the solution path should not cross itself and all of the turns should be counter-clockwise. Also note that the solution may visit more than two plants located on a same straight line. 

Input

The first line of the input is M, the number of test cases to be solved (1 <= M <= 10). For each test case, the first line is N, the number of plants in that test case (1 <= N <= 50), followed by N lines for each plant data. Each plant data consists of three integers: the first number is the unique plant index (1..N), followed by two positive integers x and y representing the coordinates of the plant. Plants are sorted by the increasing order on their indices in the input file. Suppose that the values of coordinates are at most 100.

Output

Output should have one separate line for the solution of each test case. A solution is the number of plants on the solution path, followed by the indices of visiting plants in the path in the order of their visits.

Sample Input

2
10
1 4 5
2 9 8
3 5 9
4 1 7
5 3 2
6 6 3
7 10 10
8 8 1
9 2 4
10 7 6
14
1 6 11
2 11 9
3 8 7
4 12 8
5 9 20
6 3 2
7 1 6
8 2 13
9 15 1
10 14 17
11 13 19
12 5 18
13 7 3
14 10 16

Sample Output

10 8 7 3 4 9 5 6 2 1 10
14 9 10 11 5 12 8 7 6 13 4 14 1 3 2

Source

Tehran 1999

题意：

给定n个点，一只蚂蚁只能按逆时针方向走。问最多走多少点，已经走的顺序。

思路：

很显然每次选的都是极角序最小的。

所以每走一个点就按极角序排个序，选最近的。排序的时候前面走过的就不用走了。

第一次要swap，之后就不用了，因为一定程度已经有序了。每次正好选的都是下一个。

很多地方说的凸包，好吧我没想出来怎么就凸包了.....【太菜了】

#include <iostream>
#include <set>
#include <cmath>
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
//#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define inf 0x7f7f7f7f

int n, m, now;
const int maxn = 55;
struct node{
    int x, y, id;
}point[maxn];
int xmult(int x1, int y1, int x2, int y2, int x3, int y3)
{
    return (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1);
}

int distance(node p1, node p2)
{
    return (p2.x - p1.x) * (p2.x - p1.x) + (p2.y - p1.y) * (p2.y - p1.y);
}

void swap(node &a, node &b)
{
    node t = a;
    a = b;
    b = t;
}

bool cmp (const node& a, const node& b)
{
    int k = xmult(point[now].x, point[now].y, a.x, a.y, b.x, b.y);
    if(k > 0){
        return 1;
    }
    else if(k == 0){
        if( abs(point[now].x-a.x)<abs(point[now].x-b.x) )
            return 1;
        if( abs(point[now].y-a.y)<abs(point[now].y-b.y) )
            return 1;
    }
    return 0;
}

int order[maxn];
bool vis[maxn];
int main()
{
    scanf("%d", &m);
    while(m--){
        scanf("%d", &n);
        now = 1;
        memset(vis, 0, sizeof(vis));
        for(int i = 1; i <= n; i++){
            scanf("%d%d%d", &point[i].id, &point[i].x, &point[i].y);
            //point[i].id = i;
            if(point[i].y < point[now].y){
                swap(point[now], point[i]);
            }
        }

        int cnt = 1;
        order[cnt] = point[now].id;
        //vis[mid] = true;
        while(cnt < n){
            //node now = point[order[cnt]];
            //swap(point[order[cnt]], point[1]);
            //point[0] = point[order[cnt]];
            sort(point + now + 1, point + n + 1, cmp);
            order[++cnt] = point[++now].id;
        }

        printf("%d", n);
        for(int i = 1; i <= cnt; i++){
            printf(" %d", order[i]);
        }
        printf("
");
    }
    return 0;
}