T - Game Prediction
Crawling in process...
Crawling failed
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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.
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?20) and n (1?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.
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 5 1 7 2 10 9 6 11 62 63 54 66 65 61 57 56 50 53 48 0 0
Sample Output
Case 1: 2 Case 2: 4
和田忌赛马一样的思想,让求他最少能赢得最大值,所以就是求别人赢他的最大值,用n减去别人赢他的最大值就是结果
#include<stdio.h> #include<algorithm> using namespace std; int a[100000],b[100011]; int main() { int n,m; int g=1; while(scanf("%d%d",&m,&n)!=-1) { if(n==0&&m==0) { break; } for(int i=0; i<n; i++) { scanf("%d",&a[i]); } printf("Case %d: ",g++); sort(a,a+n); int p=0; int j=n-1; int y=n; int k=n; for(int i=n*m; i>=1; i--)//m个人找到除他之外一组最大的n个卡片,和他比就行 { int l=0; for(int j=n-1; j>=0; j--) { if(i==a[j]) { l=1; } } if(l==0) { b[p++]=i; } if(p==n) { break; } } sort(b,b+n); int x1=0,y1=0; int s=1; int x2=n-1,y2=n-1; int sum=0; while(s++<=n) { if(b[x1]>a[y1]) { sum++; x1++; y1++; } else if(b[x1]<a[y1]) { x1++; y2--; } else//如果x1==y1 { if(b[x2]>a[y2]) { sum++; x2--; y2--; } else if(b[x1]<a[y2]) { x1++; y2--; } } } printf("%d\n",n-sum); } }