zoukankan      html  css  js  c++  java
  • codeforces 579B Finding Team Member

    B. Finding Team Member

     
     

    There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the values of the strengths are distinct.

    Every contestant hopes that he can find a teammate so that their team’s strength is as high as possible. That is, a contestant will form a team with highest strength possible by choosing a teammate from ones who are willing to be a teammate with him/her. More formally, two people A and B may form a team if each of them is the best possible teammate (among the contestants that remain unpaired) for the other one.

    Can you determine who will be each person’s teammate?

    Input

    There are 2n lines in the input.

    The first line contains an integer n (1 ≤ n ≤ 400) — the number of teams to be formed.

    The i-th line (i > 1) contains i - 1 numbers ai1, ai2, ... , ai(i - 1). Here aij (1 ≤ aij ≤ 106, all aij are distinct) denotes the strength of a team consisting of person i and person j (people are numbered starting from 1.)

    Output

    Output a line containing 2n numbers. The i-th number should represent the number of teammate of i-th person.

    Sample test(s)
    Input
    2
    6
    1 2
    3 4 5
    Output
    2 1 4 3
    Input
    3
    487060
    3831 161856
    845957 794650 976977
    83847 50566 691206 498447
    698377 156232 59015 382455 626960
    Output
    6 5 4 3 2 1
    Note

    In the first sample, contestant 1 and 2 will be teammates and so do contestant 3 and 4, so the teammate of contestant 1, 2, 3, 4 will be 2, 1, 4, 3 respectively.

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 using namespace std;
     5 struct team
     6 {
     7     int u,v,w;
     8 }a[805*805];
     9 bool vis[805];
    10 int ans[805];
    11 bool cmp(team a,team b)
    12 {
    13     return a.w<b.w;
    14 }
    15 int main()
    16 {
    17     int n;
    18     scanf("%d",&n);
    19     int id=0;
    20     for(int j=2;j<=2*n;j++)
    21         for(int k=1;k<=j-1;k++)
    22         {
    23             int tmp;
    24             scanf("%d",&tmp);
    25             a[id++]=(team){j,k,tmp};
    26         }
    27     sort(a,a+id,cmp);
    28     for(int i=id-1;i>=0;i--)
    29     {
    30         if(!vis[a[i].u]&&!vis[a[i].v])ans[a[i].u]=a[i].v,ans[a[i].v]=a[i].u,vis[a[i].u]=1,vis[a[i].v]=1;
    31         else continue;
    32     }
    33     for(int i=1;i<=2*n;i++)printf("%d ",ans[i]);
    34     return 0;
    35 }
  • 相关阅读:
    关于游戏的配乐说法
    初识构建之法
    战略-战术-攻略
    《SRE google 运维解密》读书笔记1---第一部分
    什么,又是流程有问题?
    Scaling Memcache At Facebook
    技术博客开篇之言
    redis的一次迁移
    原生js--什么是闭包?
    原生js--事件绑定、事件监听器及事件解绑
  • 原文地址:https://www.cnblogs.com/homura/p/4988053.html
Copyright © 2011-2022 走看看