hdoj.5090 Game with Pearls【二分图匹配】 2015/08/14

最新推荐文章于 2016-01-03 22:24:29 发布

hdweilao

最新推荐文章于 2016-01-03 22:24:29 发布

阅读量285

点赞数

分类专栏： HDoj（杭电）

本文链接：https://blog.csdn.net/hdweilao/article/details/47658969

版权

HDoj（杭电）专栏收录该内容

290 篇文章 0 订阅

订阅专栏

Game with Pearls

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 1918 Accepted Submission(s): 674

Problem Description

Tom and Jerry are playing a game with tubes and pearls. The rule of the game is:

1) Tom and Jerry come up together with a number K.

2) Tom provides N tubes. Within each tube, there are several pearls. The number of pearls in each tube is at least 1 and at most N.

3) Jerry puts some more pearls into each tube. The number of pearls put into each tube has to be either 0 or a positive multiple of K. After that Jerry organizes these tubes in the order that the first tube has exact one pearl, the 2nd tube has exact 2 pearls, …, the Nth tube has exact N pearls.

4) If Jerry succeeds, he wins the game, otherwise Tom wins.

Write a program to determine who wins the game according to a given N, K and initial number of pearls in each tube. If Tom wins the game, output “Tom”, otherwise, output “Jerry”.

Input

The first line contains an integer M (M<=500), then M games follow. For each game, the first line contains 2 integers, N and K (1 <= N <= 100, 1 <= K <= N), and the second line contains N integers presenting the number of pearls in each tube.

Output

For each game, output a line containing either “Tom” or “Jerry”.

Sample Input

  
  
   
   2 
5 1 
1 2 3 4 5 
6 2 
1 2 3 4 5 5

Sample Output

  
  
   
   Jerry 
Tom

Source

2014上海全国邀请赛——题目重现（感谢上海大学提供题目）

注：二分图匹配匈牙利算法模板，判断匹配数是否等于n，等于，则Jerry win 否则，Tom win

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

#define maxn 110
int g[maxn][maxn],linker[maxn];
bool vis[maxn];
int t,m,n,k;

bool dfs(int u){
    int v;
    for( v = 1 ; v <= n ; ++v ){
        if( g[u][v] && !vis[v] ){
            vis[v] = true;
            if( linker[v] == -1 || dfs(linker[v]) ){
                linker[v] = u;
                return true;
            }
        }
    }
    return false;
}

int solve(){
    int ret = 0;
    int u;
    memset(linker,-1,sizeof(linker));
    for( u = 1 ; u <= n ; ++u ){
        memset(vis,0,sizeof(vis));
        if( dfs(u) ) ret++;
    }
    return ret;
}

int main(){
    cin>>t;
    while(t--){
        cin>>n>>k;
        memset(g,0,sizeof(g));
        for( int i = 1 ; i <= n ; ++i ){
            scanf("%d",&m);
            while( m <= n ){
                g[m][i] = 1;
                m += k;
            }
        }
        int ans = solve();
        if( ans == n )
            printf("Jerry\n");
        else printf("Tom\n");
    }
    return 0;
}