A. Team Olympiad

最新推荐文章于 2021-08-15 19:53:27 发布

我i是超人

最新推荐文章于 2021-08-15 19:53:27 发布

阅读量259

点赞数

本文链接：https://blog.csdn.net/tatan_/article/details/89667988

版权

在Berland首都的一所学校中，每位学生擅长编程、数学或体育之一。为参加科学十项全能奥林匹克竞赛，教师们需将学生组成每队三人的团队，每个团队必须包含一名程序员、一名数学家和一名运动员。此问题探讨如何最大化团队数量并给出具体组建方案。

摘要由CSDN通过智能技术生成

The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value ti:
ti = 1, if the i-th child is good at programming,
ti = 2, if the i-th child is good at maths,
ti = 3, if the i-th child is good at PE
Each child happens to be good at exactly one of these three subjects.
The Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.
What is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?
Input
The first line contains integer n (1 ≤ n ≤ 5000) — the number of children in the school. The second line contains n integers t1, t2, …, tn (1 ≤ ti ≤ 3), where ti describes the skill of the i-th child.
Output
In the first line output integer w — the largest possible number of teams. Then print w lines, containing three numbers in each line. Each triple represents the indexes of the children forming the team. You can print both the teams, and the numbers in the triplets in any order. The children are numbered from 1 to n in the order of their appearance in the input. Each child must participate in no more than one team. If there are several solutions, print any of them.
If no teams can be compiled, print the only line with value w equal to 0.
Examples
Input
7
1 3 1 3 2 1 2
Output
2
3 5 2
6 7 4
Input
4
2 1 1 2
Output
0

#include<stdio.h>
#include<math.h>
int cmp(const void*a,const void*b)
{
return *(int*)b-*(int*)a;
}
int main()
{
int i,j,k1=0,k2=0,k3=0,n,n1=0,n2=0,n3=0,judge=0;
int c[5001],a[5001],b[5001],d[5001];
scanf("%d",&n);
for(i=0;i<n;i++)
{
 scanf("%d",&c[i]);
 if(c[i]==1)
 {
  a[n1]=i+1;
  n1++;
 }
 else if(c[i]==2)
 {
  b[n2]=i+1;
  n2++;
 }
 else
 {
  d[n3]=i+1;
  n3++;
 }
 }
 if(n1>n2)
 {
  n1=n1^n2;
  n2=n1^n2;
  n1=n1^n2;
 }
 if(n1>n3)
 {
  n1=n1^n3;
  n3=n1^n3;
  n1=n1^n3;
 }
 if(n2>n3)
 {
  n2=n2^n3;
  n3=n2^n3;
  n2=n2^n3;
 }
 printf("%d\n",n1);
for(i=0;i<n1;i++)
{
 printf("%d %d %d\n",a[i],b[i],d[i]);
 
}
return 0;
}