HDU 3729 I'm Telling the Truth(二分图最大匹配)

题意：一位老师想问N位同学他们大学入学考试的成绩. 每位同学只告诉老师他在全省的排名区间,比如[5006,5008]. 最终老师发现有一些人在说谎,比如区间[5006,5008]中有4个同学都说自己排名在这个范围内,那肯定是不可能的.现在老师要你找出最多有多少个同学没有说谎,且输出字典序最大的同学序号结果.

思路：二分图的左边点集和右边点集分别是什么? 左边点集是学生序号,右边点集是1到100000的排名.

           如果i学生排名在区间[5006,5008],那么应该左i与右5006,右5007,右5008 三个点连线.所以我们在该二分图表示右边点集的时候仍然用一个一个的排名点作为右边的点, 但是我们在写match函数遍历节点u所连接的右边的点的时候修改一下就可以了。

           最后结果要求输出字典序最大的解,所以我们二分匹配的时候需要从学生序号大到小这个顺序去找每个学生的匹配.

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn = 100;
const int maxm = 100000+10;
int ma[maxn];

struct Node
{
	int x,y;
}node[maxn];

struct Max_Match
{
	int n;
	bool vis[maxm];
	int left[maxm];

	void init(int n)
	{
		this->n=n;
		memset(left,-1,sizeof(left));
	}

	bool match(int u)
	{
		for (int i = node[u].x;i<=node[u].y;i++)
		{
			if (!vis[i])
			{
				vis[i]=true;
				if (left[i]==-1 || match(left[i]))
				{
					left[i]=u;
					ma[u]=i;
					return true;
				}
			}
		}
		return false;
	}

	int solve()
	{
		int ans = 0;
		for (int i = n;i>=1;i--)
        {
			memset(vis,0,sizeof(vis));
			if (match(i))
				ans++;
		}
		return ans;
	}
}MM;

int main()
{
	int T;
	scanf("%d",&T);
	while (T--)
	{
		int n;
		scanf("%d",&n);
		memset(ma,-1,sizeof(ma));
		MM.init(n);
		for (int i = 1;i<=n;i++)
		{
			scanf("%d%d",&node[i].x,&node[i].y);
		}
		int ans = MM.solve();
		printf("%d\n",ans);
		for (int i = 1;i<=n;i++)
		{
			if (ma[i] > 0)
			{
				ans--;
				if (ans)
					printf("%d ",i);
				else
					printf("%d\n",i);
			}
		}
	}
}

Description

After this year’s college-entrance exam, the teacher did a survey in his class on students’ score. There are n students in the class. The students didn’t want to tell their teacher their exact score; they only told their teacher their rank in the province (in the form of intervals). 

After asking all the students, the teacher found that some students didn’t tell the truth. For example, Student1 said he was between 5004th and 5005th, Student2 said he was between 5005th and 5006th, Student3 said he was between 5004th and 5006th, Student4 said he was between 5004th and 5006th, too. This situation is obviously impossible. So at least one told a lie. Because the teacher thinks most of his students are honest, he wants to know how many students told the truth at most. 

 

Input

There is an integer in the first line, represents the number of cases (at most 100 cases). In the first line of every case, an integer n (n <= 60) represents the number of students. In the next n lines of every case, there are 2 numbers in each line, X  _i and Y  _i (1 <= X  _i <= Y  _i <= 100000), means the i-th student’s rank is between X  _i and Y  _i, inclusive. 

 

Output

Output 2 lines for every case. Output a single number in the first line, which means the number of students who told the truth at most. In the second line, output the students who tell the truth, separated by a space. Please note that there are no spaces at the head or tail of each line. If there are more than one way, output the list with maximum lexicographic. (In the example above, 1 2 3;1 2 4;1 3 4;2 3 4 are all OK, and 2 3 4 with maximum lexicographic)

 

Sample Input

       
       

        
        2
4
5004 5005
5005 5006
5004 5006
5004 5006
7
4 5
2 3
1 2
2 2
4 4
2 3
3 4 
       
       

 

Sample Output

       
       

        
        3
2 3 4
5
1 3 5 6 7