CodeForces 961-A Tetris(模拟)

Problem Description

You are given a following process.

There is a platform with n columns. 1×1 squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a square will appear at the top of the highest square of this column.

When all of the n columns have at least one square in them, the bottom row is being removed. You will receive 1 point for this, and all the squares left will fall down one row.

You task is to calculate the amount of points you will receive.

Input 

The first line of input contain 2 integer numbers n and m (1≤n,m≤1000) — the length of the platform and the number of the squares.

The next line contain mm integer numbers c1,c2,…,cm (1≤ci≤n) — column in which i-th square will appear.

Output 

Print one integer — the amount of points you will receive.

Sample Input  

3 9
1 1 2 2 2 3 1 2 3

Sample Output  

2

 Note

In the sample case the answer will be equal to 2 because after the appearing of 6-th square will be removed one row (counts of the squares on the platform will look like [2 3 1], and after removing one row will be [1 2 0]).

After the appearing of 9-th square counts will be [2 3 1], and after removing one row it will look like [1 2 0].

So the answer will be equal to 2.

 

题意:

有点像俄罗斯方块,大意就是在n列的区域中,随机在给定的若干列依次出现m个小方块,每个小方块都会占据本列空闲位置的最下方,当每一列的最后一行都有小方块时,这一行就会被删掉,分数加一,然后上面的方块下落一行。

思路:

所以我们只需转化为求最小相同数的个数即可。

代码:

#include <iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    int j;
    for (int i = 1; i <= n; i++)
	a[i] = 0;
    for(int i=1;i<=m;i++)
    {
        cin>>j;
        a[j]++;
    }
    int minn=0;
    for(int i=1;i<=n;i++)
       minn=min(minn,a[i]);
    cout<<minn<<endl;
    return 0;
}

猜你喜欢

转载自blog.csdn.net/wcxyky/article/details/89810692