hdoj5090Game with Pearls【二分图最大匹配】

最新推荐文章于 2019-03-28 18:34:42 发布

飘摇的尘土

最新推荐文章于 2019-03-28 18:34:42 发布

阅读量480

点赞数

分类专栏：二分图文章标签： hdoj5090Game with Pe

本文链接：https://blog.csdn.net/R1986799047/article/details/50452843

版权

二分图专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Game with Pearls

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2102 Accepted Submission(s): 754

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

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cmath>
#include<queue>
using namespace std;
const int maxn=1010;
int n,m;
int p[maxn];
int num[maxn];
int pre[maxn];
bool vis[maxn];
bool find(int k){
	for(int i=1;i<=n;++i){
		if(!vis[i]&&(pre[i]>=num[k])&&(pre[i]-num[k])%m==0){
			vis[i]=true;
			if(p[i]==0||find(p[i])){
				p[i]=k;
				return true;
			}
		}
	}
	return false;
}
int main()
{
	int i,j,k,t;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		for(i=1;i<=n;++i){
			scanf("%d",&num[i]);
			pre[i]=i;
		}
		int ans=0;
		memset(p,0,sizeof(p));
		for(i=1;i<=n;++i){
		
			memset(vis,false,sizeof(vis));
			if(find(i))ans++;
		}
		if(ans==n){
			printf("Jerry\n");
		}
		else {
			printf("Tom\n");
		}
	}
	return 0;
}