首页 / HTML / CodeforcesRound#279(Div.2)-A.TeamOlympiad（贪心）_html/css_WEB-ITnose

CodeforcesRound#279(Div.2)-A.TeamOlympiad（贪心）_html/css_WEB-ITnose

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了CodeforcesRound#279(Div.2)-A.TeamOlympiad（贪心）_html/css_WEB-ITnose，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含3770字，纯文字阅读大概需要6分钟。

内容图文

Team Olympiad

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

    Sample test(s)

    input 

    71 3 1 3 2 1 2

    output 

    23 5 26 7 4

    input 

    42 1 1 2

    output





    题目大意：有一组数，分为三类1,2,3，现将其分队，每队三人必须1,2,3全部包含，问最多能分多少队，并输出如何各队成员的编号。


    解题思路：直接将三种数的编号分别放到三个数组中，能分的队数取决于最少的一类数的个数。直接对应输出即可。




    AC代码：

    #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")typedef long long LL;typedef double DB;typedef unsigned uint;typedef unsigned long long uLL;/** Constant List .. **/ //{const int MOD = int(1e9)+7;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f3f3f3f3f3f3fLL;const DB EPS = 1e-9;const DB OO = 1e20;const DB PI = acos(-1.0); //M_PI;const int maxn= 10000001;int a[maxn] , b[maxn] , c[maxn];int main(){#ifdef sxk    freopen("in.txt","r",stdin);#endif //sxk    int n;    while(~scanf("%d",&n))    {        memset(a , 0 , sizeof(a));        memset(b , 0 , sizeof(b));        memset(c , 0 , sizeof(c));        int k;        int s1 = 0 , s2 = 0 , s3 = 0;        for(int i = 1 ; i <= n; i ++)        {            scanf("%d",&k);            if(k == 1)                a[s1++] = i;            else if(k == 2)                b[s2++] = i;            else if(k == 3)                c[s3++] = i;        }        int minn1 = min(s1 , s2);        int minn = min(minn1 , s3);        printf("%d\n",minn);        for(int i = 0 ; i < minn ; i ++)        {            printf("%d %d ",a[i] , b[i]);            printf("%d\n",c[i]);        }    }}

    内容总结

    以上是互联网集市为您收集整理的CodeforcesRound#279(Div.2)-A.TeamOlympiad（贪心）_html/css_WEB-ITnose全部内容，希望文章能够帮你解决CodeforcesRound#279(Div.2)-A.TeamOlympiad（贪心）_html/css_WEB-ITnose所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

    内容备注

    版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

    内容手机端

    扫描二维码推送至手机访问。

    本文链接：https://qyyshop.com/info/399374.html

    来源：【匿名】