My Data Structure Study Note WEEK 2

WEEK2-2020/9/27

Problem A - ZOJ 1362 Game Prediction

Difficlty: 1 | Tag: Unknown

  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 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

---

My Solution

  The basic methodology is sort the cards array in descending order and respectively compare each card with the number reduced from the upper (n * m), which indicates whether you have the biggest pip.
  If you got the biggest pip, than ++score and move to the next. otherwise others’ pip outweigh yours and you would got a ‘debt’.

  Since the upper(n * m) is reduced by 1 each time, and that mean you need to be debt free if your pip is the biggest. Otherwise your card would be canceled out by a larger pip in this round.

My Coding

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool cmp(int a, int b)
{
   
   
    return a > b;
}

int main()
{
   
   
    ios::sync_with_stdio(false);
    int m = 0, n = 0, upper = 0, temp = 0, turn = 0, count = 0, debt = 0;
    vector<int> countVec;
    while(true)
    {
   
   
        count = 0;
        cin >> m >> n;
        upper = m * n;
        if(!upper)
            break;
        ++turn;
        vector<int> myCards;
        for(int it = 0; it < n; ++it)
        {
   
   
            cin >> temp;
            myCards.push_back(temp);
        }
        sort(myCards.begin(), myCards.end(), cmp);   //Sorted

        int k = 0;
        // Reduce from the top
        for(int i = upper; i > 0; --i)
        {
   
   
            if(k == n)    // break if cards run out
                break;
            if(myCards[k] != i)    // if myCards[k] != i, then add debt
                ++debt;
            else if(debt) // if equals but with debt, it needs to be paid off
            {
   
   
                --debt;    
                ++k;    // move to the next cause this card is canceled out.
            }
            else    // your pip is the greatest
            {
   
   
                ++count;
                ++k;
            }
        }
        countVec.push_back(count);
        // Pay attention to clear the vec and re-init the debt
        myCards.clear();
        debt = 0;
    }
    
    // Print the result
    for(int i = 0; i < countVec.size(); ++i)
    {
   
   
        cout << "Case " << i + 1 << ": " << countVec[i] << endl;
    }
}

Complxity Analysis

Time Complxity = $O(m\ast n+nlgn)$

---

Standard Solution

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
   
   
	return a<b;
}
int s[1010];
int a[100];
int main()
{
   
   
	int n,i,j,m,t,flag=0;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
   
   
		if(n==m && m==0)
			break;
		memset(s,0,sizeof(s));
		for(i=0;i<m;i++)
		{
   
   
			scanf("%d",&t);
			a