poj 1696 space ant

Space Ant

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2830		Accepted: 1815

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

 

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
const double pi = acos(-1.0);

struct node
{
    int x,y,num;
};
node a[52],stack1[52],cur;

double dis(node n1,node n2)
{
    return (double)sqrt( (n1.x-n2.x)*(n1.x-n2.x)*1.0 + (n1.y-n2.y)*(n1.y-n2.y)*1.0 );
}
double cross(node a,node n1,node n2)
{
    return (n1.x-a.x)*(n2.y-a.y) - (n1.y-a.y)*(n2.x-a.x);
}
bool cmp(node n1,node n2)
{
    double k = cross(cur,n1,n2);
    if( k>0) return true;
    else if( k==0 && dis(cur,n1)<dis(cur,n2))
        return true;
    else return false;
}
void  Graham(int n)
{
    int i,head;
    sort(a+1,a+n,cmp);
    for(i=1;i<n;i++)
        if( a[i].y<a[0].y || (a[i].y==a[0].y&&a[i].x<a[0].x))
        swap(a[0],a[i]);
    //a[n]=a[0];
    stack1[0]=a[0];head=0;
    for(i=1;i<n;i++)
    {
        cur=a[i-1];
        sort(a+i,a+n,cmp);
        stack1[++head]=a[i];
    }
    printf("%d",head+1);
    for(i=0;i<=head;i++)
        printf(" %d",stack1[i].num);
    printf("
");
}
int main()
{
    int T,n,i;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d%d%d",&a[i].num,&a[i].x,&a[i].y);
        Graham(n);
    }
    return 0;
}