codeforces 1198C Matching vs Independent Set

http://codeforces.com/problemset/problem/1198/C
You are given a graph with 3⋅n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.

A set of edges is called a matching if no two edges share an endpoint.

A set of vertices is called an independent set if no two vertices are connected with an edge.

Input
The first line contains a single integer T≥1 — the number of graphs you need to process. The description of T graphs follows.

The first line of description of a single graph contains two integers n and m, where 3⋅n is the number of vertices, and m is the number of edges in the graph (1≤n≤105, 0≤m≤5⋅105).

Each of the next m lines contains two integers vi and ui (1≤vi,ui≤3⋅n), meaning that there is an edge between vertices vi and ui.

It is guaranteed that there are no self-loops and no multiple edges in the graph.

It is guaranteed that the sum of all n over all graphs in a single test does not exceed 105, and the sum of all m over all graphs in a single test does not exceed 5⋅105.

Output
Print your answer for each of the T graphs. Output your answer for a single graph in the following format.

If you found a matching of size n, on the first line print “Matching” (without quotes), and on the second line print n integers — the indices of the edges in the matching. The edges are numbered from 1 to m in the input order.

If you found an independent set of size n, on the first line print “IndSet” (without quotes), and on the second line print n integers — the indices of the vertices in the independent set.

If there is no matching and no independent set of the specified size, print “Impossible” (without quotes).

You can print edges and vertices in any order.

If there are several solutions, print any. In particular, if there are both a matching of size n, and an independent set of size n, then you should print exactly one of such matchings or exactly one of such independent sets.

Example
Input
4
1 2
1 3
1 2
1 2
1 3
1 2
2 5
1 2
3 1
1 4
5 1
1 6
2 15
1 2
1 3
1 4
1 5
1 6
2 3
2 4
2 5
2 6
3 4
3 5
3 6
4 5
4 6
5 6
Output
Matching
2
IndSet
1
IndSet
2 4
Matching
1 15
Note
The first two graphs are same, and there are both a matching of size 1 and an independent set of size 1. Any of these matchings and independent sets is a correct answer.

The third graph does not have a matching of size 2, however, there is an independent set of size 2. Moreover, there is an independent set of size 5: 2 3 4 5 6. However such answer is not correct, because you are asked to find an independent set (or matching) of size exactly n.

The fourth graph does not have an independent set of size 2, but there is a matching of size 2.
题目大意：给$3\ast n$个点和$m$条边，找到一个包含$n$条边的匹配或者找到一个包含$n$个点的独立集。

思路：随意找一个匹配，若该匹配的边数>=$n$，那么输出这个匹配的前$n$条边的下标即可。否则必定存在一个独立集，很容易证明，设匹配的边数为$cnt$，此时若无法再向该匹配中加边则说明剩下的点要么没有边与之连通，要么与之连通的点已经在匹配内了，因此剩下的点之间必定是没有边连通的，而$cnt<=n$，故$3\ast n-2\ast cnt>=n$，所以我们必定能找到一个包含$n$个点的独立集。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define pr pair<int,int>
using namespace std;
typedef long long ll;

const int maxn=1e5+5;

int edge[maxn*3];
bool vis[maxn*3];
int n,m;

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(vis,0,sizeof(int)*(3*n+1));
		int len=0,u,v;
		scanf("%d %d",&n,&m);
		for(int i=1;i<=m;i++)
		{
			scanf("%d%d",&u,&v);
			if(!vis[u]&&!vis[v])
				vis[u]=vis[v]=1,edge[len++]=i;
		}
		if(len>=n)
		{
			printf("Matching\n");
			len=n;
			for(int i=0;i<len;i++)
				printf("%d ",edge[i]);
			printf("\n");
		}
		else
		{
			printf("IndSet\n");
			int cnt=0;
			int tmp=n*3;
			for(int i=1;i<=tmp;i++)
			{
				if(!vis[i])
					++cnt,printf("%d ",i);
				if(cnt>=n)
					break;
			}
			printf("\n");
		}
	}
	return 0;
}