Codeforces Round #819 (Div. 1 + Div. 2) D

题目：传送门

思路：首先不难发现，如果没有形成环的话，无论红蓝如何分配，都一定是最小的（根据计算连通块公式得，也有佬通过每连一条边减一个连通块得）。所以只需要保证最后无环即可。具体操作上，因为m最大等于n+2，即如果我们让红色单独先构成一个最小生成树，则剩下的蓝边，在不理想的情况下刚好能构成一个环，怎么消掉这个环呢，我们随便选一个蓝边给他置为红色，然后将这条边的一个端点的所有边全部置为蓝色（因为保证无重边和自环，所以一定不会再形成环），即可

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int inf = 1e9 + 9;
const ll INF = 1e18l;
/*
  priority_queue<int> big_heep;
  priority_queue<int,vector<int>,greater<int> > small_heep;
  struct cmp{//if return true,it means that the number in the left was smaller than the right one
  bool  operator ()  (int  a,int  b){
  }
  };
 */
struct edge {
	int x, y, id;
}e[500005];
int boss[200005];
int ans[200005];
int find(int x) {
	if (boss[x] == x) return x;
	else return boss[x] = find(boss[x]);
}

void work() {
	vector<edge> red;
	vector<edge> blue;
	set<int> s;
	int n, m, num = 0;
	cin >> n >> m;
	for (int i = 1;i <= m;i++) cin >> e[i].x >> e[i].y, e[i].id = i, ans[i] = 0;
	for (int i = 1;i <= n;i++) boss[i] = i;
	
	for (int i = 1;i <= m;i++) {
		int x = e[i].x, y = e[i].y;
		if (find(x) == find(y)) {
			s.insert(x);
			s.insert(y);
			blue.push_back(e[i]);
		}
		else {
			num++;
			boss[find(x)] = find(y);
			red.push_back(e[i]);
			ans[e[i].id] = 1;
		}
	}
	//int xx = s.size();
	if (m == n + 2 and s.size() == 3) {
		auto ed = blue.back();
		ans[ed.id] = 1;
		for (auto ee : red) {
			if (ee.x == ed.x or ee.y == ed.x) ans[ee.id] = 0;
		}
	}
	for (int i = 1;i <= m;i++) cout << ans[i];
	cout << "\n";
	return;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll t;
	cin >> t;
	while (t--) {
		
		work();
	}
	return 0;
}