codeforces 828A. Restaurant Tables（水题）

最新推荐文章于 2020-03-16 20:33:31 发布

原创最新推荐文章于 2020-03-16 20:33:31 发布 · 432 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

32 篇文章

订阅专栏

本文介绍了一个简单的算法，用于解决小餐厅中如何为顾客群体分配单人桌和双人桌的问题。该算法考虑了不同顾客群体的规模，并描述了在各种情况下如何分配桌子，以及无法服务的顾客数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：http://codeforces.com/problemset/problem/828/A点击打开链接

In a small restaurant there are a tables for one person and b tables for two persons.

It it known that n groups of people come today, each consisting of one or two people.

If a group consist of one person, it is seated at a vacant one-seater table. If there are none of them, it is seated at a vacant two-seater table. If there are none of them, it is seated at a two-seater table occupied by single person. If there are still none of them, the restaurant denies service to this group.

If a group consist of two people, it is seated at a vacant two-seater table. If there are none of them, the restaurant denies service to this group.

You are given a chronological order of groups coming. You are to determine the total number of people the restaurant denies service to.

Input

The first line contains three integers n, a and b (1 ≤ n ≤ 2·105, 1 ≤ a, b ≤ 2·105) — the number of groups coming to the restaurant, the number of one-seater and the number of two-seater tables.

The second line contains a sequence of integers t1, t2, ..., tn (1 ≤ ti ≤ 2) — the description of clients in chronological order. If ti is equal to one, then the i-th group consists of one person, otherwise the i-th group consists of two people.

Output

Print the total number of people the restaurant denies service to.

Note

In the first example the first group consists of one person, it is seated at a vacant one-seater table. The next group occupies a whole two-seater table. The third group consists of one person, it occupies one place at the remaining two-seater table. The fourth group consists of one person, he is seated at the remaining seat at the two-seater table. Thus, all clients are served.

In the second example the first group consists of one person, it is seated at the vacant one-seater table. The next group consists of one person, it occupies one place at the two-seater table. It's impossible to seat the next group of two people, so the restaurant denies service to them. The fourth group consists of one person, he is seated at the remaining seat at the two-seater table. Thus, the restaurant denies service to 2 clients.

水题注意当接待一个人时如果有剩余一个位子的两位桌和没有人的两位桌要选择没有人的没看清就这样wa了。。

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include<algorithm>
#include <math.h>
#include <string.h>
#include <limits.h>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <vector>
using namespace std;
int main()
{
    int a[3];
    a[1]=0;a[2]=0;a[0]=0;
    int n=0;int sum=0;
    scanf("%d%d%d",&n,&a[1],&a[2]);
    for(int i=0;i<n;i++)
    {
        int nn=0;
        scanf("%d",&nn);
        if(nn==2)
        {
            if(a[2]>0)
                a[2]--;
            else
            {
                sum+=2;
            }
        }
        else if(nn==1)
        {
            if(a[1]>0)
                a[1]--;
            else
            {
                if(a[2]>0)
                {
                    a[2]--;
                    a[0]++;
                }
                else if(a[0]>0)
                    {
                        a[0]--;
                    }
                else
                    sum++;
            }
        }
    }
    printf("%d",sum);

}