Triangle Partition

最新推荐文章于 2020-11-23 10:18:10 发布

咕咕评测姬

最新推荐文章于 2020-11-23 10:18:10 发布

阅读量138

点赞数

分类专栏：多校

本文链接：https://blog.csdn.net/doublekillyeye/article/details/81179625

版权

多校专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Problem Description

Chiaki has 3n points p1,p2,…,p3n . It is guaranteed that no three points are collinear.
Chiaki would like to construct n disjoint triangles where each vertex comes from the 3n points.

Input

There are multiple test cases. The first line of input contains an integer T , indicating the number of test cases. For each test case:
The first line contains an integer n (1≤n≤1000 ) -- the number of triangle to construct.
Each of the next 3n lines contains two integers xi and yi (−109≤xi,yi≤109 ).
It is guaranteed that the sum of all n does not exceed 10000 .

Output

For each test case, output n lines contain three integers ai,bi,ci (1≤ai,bi,ci≤3n ) each denoting the indices of points the i -th triangle use. If there are multiple solutions, you can output any of them.

Sample Input

1 1 1 2 2 3 3 5

Sample Output

1 2 3

Source

2018 Multi-University Training Contest 1

因为不可能三点共线，所以直接排序输出

#include <bits/stdc++.h>
using namespace std;
struct haha{
	int x,y;
	int s;
}we[300000];
bool cmp(haha a,haha b){
	if(a.x==b.x) return a.y<b.y;
	return a.x<b.x;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n;
		scanf("%d",&n);
		n=n*3;
		for(int i=0;i<n;i++){
			scanf("%d %d",&we[i].x,&we[i].y);
			we[i].s=i;
		}
		sort(we,we+n,cmp);
		for(int i=0;i<=n-3;i+=3){
			printf("%d %d %d\n",we[i].s+1,we[i+1].s+1,we[i+2].s+1);
		}
	}
}