UVA-Guardian of Decency——二分图最大匹配

你的名字 2022-05-24 04:45 144阅读 0赞

Description

Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid that some of them might become couples. While you can never exclude this possibility, he has made some rules that he thinks indicates a low probability two persons will become a couple:

*  Their height differs by more than 40 cm.
 *  They are of the same sex.
 *  Their preferred music style is different.
 *  Their favourite sport is the same (they are likely to be fans of different teams and that would result in fighting).

So, for any two persons that he brings on the excursion, they must satisfy at least one of the requirements above. Help him find the maximum number of persons he can take, given their vital information.

Input

The first line of the input consists of an integer T ≤ 100 giving the number of test cases. The first line of each test case consists of an integer N ≤ 500 giving the number of pupils. Next there will be one line for each pupil consisting of four space-separated data items:

*  an integer h giving the height in cm;
 *  a character 'F' for female or 'M' for male;
 *  a string describing the preferred music style;
 *  a string with the name of the favourite sport.

No string in the input will contain more than 100 characters, nor will any string contain any whitespace.

Output

For each test case in the input there should be one line with an integer giving the maximum number of eligible pupils.

Sample Input  
2  
4  
35 M classicism programming  
0 M baroque skiing  
43 M baroque chess  
30 F baroque soccer  
8  
27 M romance programming  
194 F baroque programming  
67 M baroque ping-pong  
51 M classicism programming  
80 M classicism Paintball  
35 M baroque ping-pong  
39 F romance ping-pong  
110 M romance Paintball

Sample Output  
3  
7

Source

Northwestern Europe 2005

<table style="max-width:100%;border-spacing:0px;width:1650px;margin-bottom:20px;background-color:transparent;"> 
 <thead> 
  <tr> 
   <th style="padding:4px;line-height:20px;vertical-align:bottom;border-top-width:0px;">&nbsp;</th> 
   <th style="padding:4px;line-height:20px;vertical-align:bottom;border-top-width:0px;">测试输入<span><a href="http://online.bit.edu.cn/moodle/help.php?component=programming&amp;identifier=input&amp;lang=zh_cn" title="关于“测试输入”的帮助" style="color:rgb(67,142,185);" rel="nofollow"><img src="http://online.bit.edu.cn/moodle/theme/image.php/lambda/core/1510491239/help" alt="关于“测试输入”的帮助" style="vertical-align:text-bottom;border:0px;height:16px;padding-left:3px;width:16px;"></a></span></th> 
   <th style="padding:4px;line-height:20px;vertical-align:bottom;border-top-width:0px;">期待的输出<span><a href="http://online.bit.edu.cn/moodle/help.php?component=programming&amp;identifier=expectedoutput&amp;lang=zh_cn" title="关于“期待的输出”的帮助" style="color:rgb(67,142,185);" rel="nofollow"><img src="http://online.bit.edu.cn/moodle/theme/image.php/lambda/core/1510491239/help" alt="关于“期待的输出”的帮助" style="vertical-align:text-bottom;border:0px;height:16px;padding-left:3px;width:16px;"></a></span></th> 
   <th style="padding:4px;line-height:20px;vertical-align:bottom;border-top-width:0px;">时间限制<span><a href="http://online.bit.edu.cn/moodle/help.php?component=programming&amp;identifier=timelimit&amp;lang=zh_cn" title="关于“时间限制”的帮助" style="color:rgb(67,142,185);" rel="nofollow"><img src="http://online.bit.edu.cn/moodle/theme/image.php/lambda/core/1510491239/help" alt="关于“时间限制”的帮助" style="vertical-align:text-bottom;border:0px;height:16px;padding-left:3px;width:16px;"></a></span></th> 
   <th style="padding:4px;line-height:20px;vertical-align:bottom;border-top-width:0px;">内存限制<span><a href="http://online.bit.edu.cn/moodle/help.php?component=programming&amp;identifier=memlimit&amp;lang=zh_cn" title="关于“内存限制”的帮助" style="color:rgb(67,142,185);" rel="nofollow"><img src="http://online.bit.edu.cn/moodle/theme/image.php/lambda/core/1510491239/help" alt="关于“内存限制”的帮助" style="vertical-align:text-bottom;border:0px;height:16px;padding-left:3px;width:16px;"></a></span></th> 
   <th style="padding:4px;line-height:20px;vertical-align:bottom;border-top-width:0px;">额外进程<span><a href="http://online.bit.edu.cn/moodle/help.php?component=programming&amp;identifier=nproc&amp;lang=zh_cn" title="关于“{$a} 个额外进程”的帮助" style="color:rgb(67,142,185);" rel="nofollow"><img src="http://online.bit.edu.cn/moodle/theme/image.php/lambda/core/1510491239/help" alt="关于“{$a} 个额外进程”的帮助" style="vertical-align:text-bottom;border:0px;height:16px;padding-left:3px;width:16px;"></a></span></th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td style="padding:4px;line-height:20px;vertical-align:middle;background-color:rgb(249,249,249);">测试用例 1</td> 
   <td style="padding:4px;line-height:20px;vertical-align:middle;background-color:rgb(249,249,249);"><a href="http://online.bit.edu.cn/moodle/mod/programming/testcase/download_io.php?id=71173&amp;test=91045&amp;type=in&amp;download=0" style="color:rgb(67,142,185);font-size:9pt;" rel="nofollow">以文本方式显示</a> 
    <div style="vertical-align:top;padding:0px 5px 0px 0px;width:10em;height:10em;"> 
     <ol style="margin-bottom:0px;margin-left:2.5em;"> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">2↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">4↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">35&nbsp;M&nbsp;classicism&nbsp;programming↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">0&nbsp;M&nbsp;baroque&nbsp;skiing↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">43&nbsp;M&nbsp;baroque&nbsp;chess↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">30&nbsp;F&nbsp;baroque&nbsp;soccer↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">8↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">27&nbsp;M&nbsp;romance&nbsp;programming↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">194&nbsp;F&nbsp;baroque&nbsp;programming↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">67&nbsp;M&nbsp;baroque&nbsp;ping-pong↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">51&nbsp;M&nbsp;classicism&nbsp;programming↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">80&nbsp;M&nbsp;classicism&nbsp;Paintball↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">35&nbsp;M&nbsp;baroque&nbsp;ping-pong↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">39&nbsp;F&nbsp;romance&nbsp;ping-pong↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">110&nbsp;M&nbsp;romance&nbsp;Paintball↵</span></li> 
     </ol> 
    </div></td> 
   <td style="padding:4px;line-height:20px;vertical-align:middle;background-color:rgb(249,249,249);"><a href="http://online.bit.edu.cn/moodle/mod/programming/testcase/download_io.php?id=71173&amp;test=91045&amp;type=out&amp;download=0" style="color:rgb(67,142,185);font-size:9pt;" rel="nofollow">以文本方式显示</a> 
    <div style="vertical-align:top;padding:0px 5px 0px 0px;width:10em;height:10em;"> 
     <ol style="margin-bottom:0px;margin-left:2.5em;"> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">3↵</span></li> 
      <li style="font-family:Consolas, 'Courier New', Courier, mono, serif;margin:0px;padding:0px;"><span style="margin:0px;padding:0px;white-space:nowrap;background-color:rgb(211,211,211);">7↵</span></li> 
     </ol> 
    </div></td> 
   <td style="padding:4px;line-height:20px;vertical-align:middle;background-color:rgb(249,249,249);">3秒</td> 
   <td style="padding:4px;line-height:20px;vertical-align:middle;background-color:rgb(249,249,249);">64M</td> 
   <td style="padding:4px;line-height:20px;vertical-align:middle;background-color:rgb(249,249,249);">0</td> 
  </tr> 
 </tbody> 
</table>

#include<iostream>
    #include<algorithm>
    #include<string>
    #include<math.h>
    #include<string.h>
    using namespace std;
    #define Maxn 505
    
    struct node
    {
    	int age;
    	char sex;
    	string music;
    	string sports;
    }student[Maxn];
    
    int T;
    int n;
    bool vis[Maxn];
    bool map[Maxn][Maxn];
    int match[Maxn];
    int dfs(int left)
    {
    	int j;
    	for (j = 0; j < n; j++)
    	{
    		if (!vis[j] && map[left][j])
    		{
    			vis[j] = 1;
    			if (match[j] == -1 || dfs(match[j]))
    			{
    				match[j] = left;
    				return 1;
    			}
    		}
    	}
    	return 0;
    }
    
    int main()
    {
    	//freopen("1.txt", "r", stdin);
    	cin >> T;
    	while (T--)
    	{
    		memset(match, -1, sizeof(match));
    		memset(map,0,sizeof(map));
    		int ans = 0;
    		cin >> n;
    		for (int i = 0; i < n; i++)
    			cin >> student[i].age >> student[i].sex >> student[i].music >> student[i].sports;
    
    		for (int i = 0; i < n;i++)
    		for (int j = 0; j < n; j++)
    		{
    			if (abs(student[i].age - student[j].age)>40) continue;
    			if (student[i].sex == student[j].sex) continue;
    			if (student[i].music != student[j].music) continue;
    			if (student[i].sports == student[j].sports) continue;
    			map[i][j] = 1;
    		}
    		
    		
    
    		for (int i = 0; i < n; i++)
    		{
    			memset(vis, 0, sizeof(vis));
    			if (dfs(i)) ans++;
    		}
    		cout << n - ans / 2<< endl;
    	}
    	return 0;
    }