ICPC济南J(构造+二分图)

题意:

如果点x和y有连边，当且仅当a[x] or a[y] = 2^60^ - 1 （两者是充分必要）
现在给你边的关系，问你每个点的值应该是多少？（给出一种情况即可）

思路:

比较容易想到的是,把整个图分成奇数层和偶数层,我们这里使用二分图染色分层,规定白色的点比黑色的点数少,此时白色点最多有50个.我们对白色点进行重新编号为1~cntwhite,假设点x的编号(白色点)为id[x],此时白色点第59位置为0,第id[x]位置为0,其余置为1.对于黑色的点,其相邻的点必定为白色,假设其所有白色相邻点的编号的并集为tmp,此时设计黑色的点59位为1,然后加上并集.

为什么这么构造是对的捏?首先黑色点和白色点的最高位是互补的,白色点永远不会跟白色点匹配,黑色点相邻编号的并集也不会占满所有位置的1,保证黑与白匹配.另外,编号为id[x]的白色的点由于第id[x]上有空缺,此时在id[x]位上有位置的仅有与其相邻的黑点和所有其他的白点,综上所述,白点只能与相邻的黑点匹配,反过来黑点也是只能与相邻的白点匹配.

代码:

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
#define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f 
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 2e6 + 10;
int n;
int h[N], v[N], to[N], tot, a[N], vis[N], id[N], cnt;
void add(int a, int b) {
	v[++tot] = b, to[tot] = h[a], h[a] = tot;
}
void dfs(int x, int clr) {
	vis[x] = clr;
	cnt += (clr == 1);
	for (int i = h[x], y; i; i = to[i]) 
		if (!vis[y = v[i]])
			dfs(y, 3 - clr);
}
signed main() {
	qio >> n;
	for (int i = 1; i <= n - 1; ++i) {
		int a, b;
		qio >> a >> b;
		add(a, b), add(b, a);
	}
	dfs(1, 1);
	int clr = (cnt >= n - cnt ? 2 : 1);
	cnt = 0;
	for (int i = 1; i <= n; ++i)
		if (vis[i] == clr) id[i] = ++cnt;
	for (int x = 1; x <= n; ++x) {
		if (vis[x] == 3 - clr) {
			a[x] = (1ll << 59);
			for (int i = h[x]; i; i = to[i])
				a[x] |= (1ll << id[v[i]]);
		}else a[x] = (1ll << 59) - 1 - (1ll << id[x]);
	}
//     qio << (a[1] | a[2]) << "\n" << (a[1] | a[3]) << "\n" << (a[2] | a[3])
//         << "\n" << ((1ll << 60) - 1) << "\n";
	for (int i = 1; i <= n; ++i) qio << a[i] << " ";
}