zoukankan      html  css  js  c++  java
  • 2018HDU多校训练一 C -Triangle Partition

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

    Input

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

    Output

    For each test case, output nn lines contain three integers ai,bi,ciai,bi,ci (1≤ai,bi,ci≤3n1≤ai,bi,ci≤3n) each denoting the indices of points the ii-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
    #include <bits/stdc++.h>
    using namespace std;
    #define mp make_pair
    typedef long long ll;
    typedef pair<int,int> PII;
    const int N=101000;
    int T,n,x,y;
    pair<PII,int> p[N];
    int main() 
    {
    	scanf("%d",&T);
    	while(T--)
    	{
    		scanf("%d",&n);
    		for(int i=0;i<3*n;i++) 
    		{
    			scanf("%d%d",&x,&y);
    			p[i]=mp(mp(x,y),i);
    		}
    		sort(p,p+3*n);
    		for(int i=0;i<n;i++) 
    			printf("%d %d %d
    ",p[3*i].second+1,p[3*i+1].second+1,p[3*i+2].second+1);
    	}
    	return 0;
    }
    
  • 相关阅读:
    plsql调试存储过程卡住的原因以及处理
    JavaWeb三大组件(Servlet、Filter、Listener)的区别
    单点登录原理
    Oracle 导表异常处理方案 (解决空表导出出错问题)
    在Oracle中删除用户时提示:ORACLE无法删除当前连接用户
    VisualSvn的权限管理
    MySql常用命令总结
    Oracle 常用SQL
    参数
    java
  • 原文地址:https://www.cnblogs.com/csushl/p/9386492.html
Copyright © 2011-2022 走看看