zoukankan      html  css  js  c++  java
  • VK Cup 2012 Qualification Round 1 B. Taxi

    B. Taxi
    time limit per test
    3 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    After the lessons n groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the i-th group consists of si friends (1 ≤ si ≤ 4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?

    Input

    The first line contains integer n (1 ≤ n ≤ 105) — the number of groups of schoolchildren. The second line contains a sequence of integers s1, s2, ..., sn (1 ≤ si ≤ 4). The integers are separated by a space, si is the number of children in the i-th group.

    Output

    Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.

    Sample test(s)
    Input
    5
    1 2 4 3 3
    Output
    4
    Input
    8
    2 3 4 4 2 1 3 1
    Output
    5
    Note

    In the first test we can sort the children into four cars like this:

    • the third group (consisting of four children),
    • the fourth group (consisting of three children),
    • the fifth group (consisting of three children),
    • the first and the second group (consisting of one and two children, correspondingly).

    There are other ways to sort the groups into four cars.

    水题,4个人的单独。

    3和1搭配,

    2和2搭配。

    3有多的话只能单独了。

    2可以加入1个的

    #include<stdio.h>
    int aa[5];



    int main()
    {



    int n;
    int t;
    while(scanf("%d",&n)!=EOF)
    {
    for(int i=0;i<5;i++)aa[i]=0;
    while(n--)
    {
    scanf("%d",&t);
    aa[t]++;
    }
    int res=0;
    res+=aa[4];
    if(aa[1]==aa[3])
    {
    res+=aa[1];
    aa[1]=0;
    aa[3]=0;
    if(aa[2]%2==0)
    {
    res+=aa[2]/2;
    }
    else
    {
    res=res+aa[2]/2+1;
    }
    }
    else if(aa[1]<aa[3])
    {
    res+=aa[1];
    aa[3]-=aa[1];
    aa[1]=0;

    res+=aa[3];

    if(aa[2]%2==0)
    {
    res+=aa[2]/2;
    }
    else
    {
    res=res+aa[2]/2+1;
    }
    }
    else
    {
    res+=aa[3];
    aa[1]-=aa[3];
    aa[3]=0;

    if(aa[2]%2==0)
    {
    res+=aa[2]/2;
    }
    else
    {
    res=res+aa[2]/2+1;
    aa[1]-=2;
    }

    if(aa[1]>=1)
    {
    if(aa[1]%4==0) res+=aa[1]/4;
    else
    res=res+aa[1]/4+1;
    }
    }



    printf("%d\n",res);
    }



    return 0;
    }
  • 相关阅读:
    java架构师学习路线-HTTP请求类型及说明
    java架构师学习路线-关闭HTTP的TRACE方法
    AC自动机模板
    loj 2721 [NOI2018] 屠龙勇士
    scrum介绍
    本地搭建nacos集群
    js对象
    函数声明与表达式、匿名函数与具名函数、立即执行函数
    第六章 SSH远程服务介绍
    第十二章 配置vlan
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2380624.html
Copyright © 2011-2022 走看看