图论 ---- B. Graph Subset Problem (图中找k阶完全子图 or 找一个子集里面的点的度数都打过k)

题目链接

---

题目大意:

---

解题思路：

输出1的解法：

1. 就是我们每次都把$degree(a)<k$的点删除，如果最后还剩下点那就可以输出$1$

输出2的解法：

2. 就是我们每次都把$degree(a)<k-1$的删除，如果访问到了$degree=k-1$的点，把那个$k-1$个点$push$进$vector$,然后$k\ast k\ast logk$进行判断！！
3. 我们建图用$vector$进行建图，对每次点进行$sort$
4. 因为图的边数才$1e5$,那么完全图最大才$sqrt(1e5)$复杂度完全可以接受

---

AC code

#include <bits/stdc++.h>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define f first
#define s second
#define endl '\n'
using namespace std;
const int N = 2e6 + 10, mod = 1e9 + 9;
const int maxn = 500010;
const long double eps = 1e-5;
const int EPS = 500 * 500;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
template<typename T> void read(T &x) {
   x = 0;char ch = getchar();ll f = 1;
   while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
   while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
   read(first);
   read(args...);
}
vector<int> G[maxn], cilpue, res;
int d[maxn], vis[maxn];
int n, m, k;
inline bool check() {// 找解法2
	for(int i = 0; i < res.size(); ++ i)
	   for(int j = i + 1; j < res.size(); ++ j) {
		   int pos = lower_bound(G[res[i]].begin(),G[res[i]].end(),res[j]) - G[res[i]].begin();
		   if(pos == G[res[i]].size()) return 0;
		   if(G[res[i]][pos] != res[j]) return 0;
	   }
	return 1;
}

inline void init() {
	for(int i = 0; i <= n; ++ i) G[i].clear(), d[i] = 0, vis[i] = 0;
	res.clear(); 
	cilpue.clear();
}

int main() {
	IOS;
	int T;
	cin >> T;
	while(T --) {
		cin >> n >> m >> k;
		init();
		for(int i = 1; i <= m ;++ i) {
			int u, v;
			cin >> u >> v;
			G[u].push_back(v);
			G[v].push_back(u);
			d[u] ++;
			d[v] ++;
		}
		for(int i = 1; i <= n; ++ i) sort(G[i].begin(),G[i].end());// 对链接的点排序
		priority_queue<PII, vector<PII>, greater<PII> > q; // 用优先队列，重复插入不怕，毕竟会先访问到小的
		for(int i = 1; i <= n; ++ i) q.push({d[i],i});
		int is = 0;
		while(!q.empty()) {
			auto top = q.top();
		    if(top.first >= k) break;
			q.pop();
			if(vis[top.second]) continue;
			vis[top.second] = 1;
			bool flag = 0;
			if(d[top.second] == k - 1  && 1ll * k * (k - 1) <= 2ll * m) flag = 1, res.push_back(top.second); // 特判
			for(auto it : G[top.second]) {
				if(vis[it]) continue;
				if(flag) res.push_back(it);
				d[it] --;
				q.push({d[it],it});
			} 
			if(flag && check()) {
				is = 1;// 找到方法二就退出去了
				break;
			}
			res.clear();
		}
		if(!is) {
			for(int i = 1; i <= n; ++ i)
				if(!vis[i])
					cilpue.push_back(i);			
		}
		if(is) {
			cout << 2 << endl;
			for(auto it : res)
			  cout << it << " ";
			cout << endl;
		} else if(!cilpue.empty()) {
			cout << 1 << " " << cilpue.size() << endl;
			for(auto it : cilpue)
			   cout << it << " ";
			cout << endl;
		} else cout << "-1\n";
	} 
}