weiwancheng

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;

const int maxn = 1005;
struct Node {
    int id, x, y;
}init[maxn], node[maxn], ans[maxn];


int n, top;
int G[maxn][maxn];
int cross(Node n1, Node n2, Node n3) {
    return (n2.x - n1.x) * ( n3.y - n1.y ) - (n3.x - n1.x) * (n2.y - n1.y);
}

bool cmp(Node p1, Node p2) {
    if(p1.x != p2.x) {
        return p1.x < p2.x;
    }
    return p1.y < p2.y;
}

void conext() {
    sort(node + 1 + 1, node + n + 1, cmp);
    top = 0;
    ans[top++] = node[1];
    for(int i = 2; i <= n; i++) {
        while(top > 1 && cross(ans[top - 2], ans[top - 1], node[i]) <= 0 && G[ans[top-1].id][i]) {
            top--;
        } 
        ans[top++] = node[i];
    }
    int k = top;
    for(int i = n - 1; i >= 2; i--) {
        while(top > k && cross(ans[top - 2], ans[top - 1], node[i]) >= 0 && G[ans[top-1].id][i]) {
            top --;
        }
        ans[top++] = node[i];
    }
    if(top > 1) top--;
}

int main() {
    int n;
    while(EOF != scanf("%d",&n) ) {
        for(int i = 1; i <= n; i++) {
            scanf("%d %d %d",&init[i].id, &init[i].x, &init[i].y);
        }
        memset(G, 0, sizeof(G));
        for(int i = 1; i <= n i++) {
            for(int j = 1; j <= 4; j++) {
                scanf("%d",&v);
                G[i][v] = G[v][i] = 1;
            }
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 0; j < n; j++) {
                int x = ( i + j ) % n;
                if(x == 0) x = n; 
                node[x] = init[j + 1];
            }
            conext();
            for(int i = 0; i < top; i++) {
                printf("%d ", ans[i].id);
            } puts("");
        }
    }
    return 0;
}