HDU1338 解题报告

Game Prediction

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1559    Accepted Submission(s): 881

Problem Description

Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two cards with the same pip. During a round, each player chooses one card to compare with others. The player whose card with the biggest pip wins the round, and then the next round begins. After N rounds, when all the cards of each player have been chosen, the player who has won the most rounds is the winner of the game.
Given your cards received at the beginning, write a program to tell the maximal number of rounds that you may at least win during the whole game.

 

Input

The input consists of several test cases. The first line of each case contains two integers m (2 <= m <= 20) and n (1 <= n <= 50), representing the number of players and the number of cards each player receives at the beginning of the game, respectively. This followed by a line with n positive integers, representing the pips of cards you received at the beginning. Then a blank line follows to separate the cases.

The input is terminated by a line with two zeros.

 

Output

For each test case, output a line consisting of the test case number followed by the number of rounds you will at least win during the game.

 

Sample Input

2 51 7 2 10 96 1162 63 54 66 65 61 57 56 50 53 480 0

 

Sample Output

Case 1: 2Case 2: 4

 

Source

Asia 2002, Beijing (Mainland China)

 

Recommend

Ignatius.L   |   We have carefully selected several similar problems for you:  1347 1327 1320 1335 1306 

解法：贪心

从自己手上拥有的最小的牌开始用

然后将其他人没用过的而且比这张大的牌中挑选出一张最小的用掉

然后重复上述过程，直到自己的牌用完或者是没有人的牌比自己的大为止

#include<algorithm>#include<iostream>using namespace std;const int maxm=22;const int maxn=55;const int maxmn=1210;bool num[maxmn];int my_num[maxn];int m,n;int Case=0;void solve();int main(){    while(cin>>m>>n)    {        if(m==0&&n==0) break;        fill(num,num+maxn*maxm,true);        for(int i=0;i<n;i++)        {            cin>>my_num[i];            num[my_num[i]]=false;        }        solve();    }    return 0;}void solve(){    sort(my_num,my_num+n);    Case++;    cout<<"Case "<<Case<<": ";    int win_count=n;    for(int i=0;i<n;i++) //一个一个用掉我的最小的    {        int mn=my_num[i];  //我现在手上最小的        for(int j=mn+1;j<=m*n;j++)               if(num[j])            {                num[j]=false;                win_count--;                break;            }        int t=0;        for(int j=1;j<=n*m&&t<m-2;j++)            if(num[j])            {                num[j]=true;                t++;            }    }    cout<<win_count<<endl;}