CodeForces 1439B :Graph Subset Problem 思维

传送门

题意

分析

找团的话，团内每一个点的度数都是$k$，那么我只需要删掉度数小于$k$的点即可，因为要防止被删掉的点影响到其他的点，所以要用类似于拓扑排序的写法
合法点集的话，我们可以去枚举每一个度数为$k-1$的点加入答案，$check$两两之间是否联通即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
VI G[N];
int n,m,k;
int sz[N];
int st[N];

void init(){
	for(int i = 1;i <= n;i++) G[i].clear(),st[i] = 0;
}

bool check(int x,int y){
	return binary_search(all(G[x]),y);

}

int main() {
	int T;
	read(T);
	while(T--){
		read(n),read(m),read(k);
		init();
		for(int i = 1;i <= m;i++){
			int a,b;
			read(a),read(b);
			G[a].pb(b),G[b].pb(a);
		}
		queue<int> q;
		for(int i = 1;i <= n;i++){
			sort(all(G[i]));
			sz[i] = SZ(G[i]);
			if(sz[i] < k){
				q.push(i);
				st[i] = 1;
			}
		}
		VI ans;
		while(q.size()){
			int u = q.front();
			q.pop();
			st[u] = 2;
			if(sz[u] == k - 1 && (k - 1) * k / 2 <= m && !ans.size()){
				ans.pb(u);
				bool flag = 1;
				for(auto v:G[u]) if(st[v] <= 1) ans.pb(v);
				for(auto x:ans)
					for(auto y:ans){
						if(x == y) continue;
						if(!check(x,y)) flag = 0;
					}
				if(!flag) ans.clear();
			}
			for(auto v:G[u]){
				sz[v]--;
				if(sz[v] < k && !st[v]) st[v] = 1,q.push(v);
			}
		}
		VI res;
		for(int i = 1;i <= n;i++) if(!st[i]) res.pb(i);
		if(res.size()){
			printf("%d %d\n",1,(int)res.size());
			for(int v:res) printf("%d ",v);
			puts("");
		}
		else if(ans.size()){
			printf("%d\n",2);
			for(int v:ans) printf("%d ",v);
			puts("");
		}
		else puts("-1");
	}
	return 0;
}