zoukankan      html  css  js  c++  java
  • HDU 2018 Multi-University Training Contest 1 Triangle Partition 【YY】

    传送门:http://acm.hdu.edu.cn/showproblem.php?pid=6300

    Triangle Partition

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)
    Total Submission(s): 2964    Accepted Submission(s): 1474
    Special Judge


    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 (1n1000) -- the number of triangle to construct.
    Each of the next 3n lines contains two integers xi and yi (109xi,yi109).
    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 (1ai,bi,ci3n) 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
     

    题意概括:

    给出 3*N 个点的坐标(保证点不共线);

    用这 3*N 个点构造出 N 个不相交的三角形;

    每一行输出一个三角形的坐标编号。

    解题思路:
    因为点都不共线,所以按横坐标排个序,三个三个点构造的三角形不相交。

    AC code:

     1 #include <queue>
     2 #include <cstdio>
     3 #include <vector>
     4 #include <cstring>
     5 #include <iostream>
     6 #include <algorithm>
     7 #define INF 0x3f3f3f3f
     8 #define LL long long
     9 using namespace std;
    10 const int MAXN = 3e3+10;
    11 
    12 struct data
    13 {
    14     int x, y;
    15     int no;
    16 }node[MAXN];
    17 
    18 bool cmp(data a, data b)
    19 {
    20     return a.x < b.x;
    21 }
    22 
    23 int main()
    24 {
    25     int N;
    26     int T_case;
    27     while(~scanf("%d", &T_case)){
    28         while(T_case--){
    29             scanf("%d", &N);
    30             int maxx = 3*N;
    31             for(int i = 0; i < maxx; i++){
    32                 scanf("%d %d", &node[i].x, &node[i].y);
    33                 node[i].no = i+1;
    34             }
    35             sort(node, node+maxx, cmp);
    36 
    37             for(int i = 0; i+2 < maxx; i+=3){
    38                 printf("%d %d %d
    ", node[i].no, node[i+1].no, node[i+2].no);
    39             }
    40         }
    41     }
    42     return 0;
    43 }
  • 相关阅读:
    django-rest-framework
    史上最全的状态码
    __new__、__init__、__call__三个特殊方法
    量化投资与Python之pandas
    MongoDB 3.0 Release Notes
    TokuMX写操作无法加锁的问题
    TokuMX唯一索引不支持dropDups选项
    接着写吧
    Windows下Python IDLE设置
    20145320周岐浩免考
  • 原文地址:https://www.cnblogs.com/ymzjj/p/10282636.html
Copyright © 2011-2022 走看看