#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+5;
static unordered_set<int> g[MAXN];
static unordered_set<int> comp[MAXN], leaves[MAXN];
static int cor[MAXN], prof[MAXN];
static queue<int> qu;
static int n, m;
static ll x;
static void inicia(int cur) {
cor[cur]=-1;
for(auto viz : g[cur]) {
if(cor[viz]) continue;
prof[viz]=prof[cur]+1;
inicia(viz);
}
}
static void predfs(int cur) {
comp[0].insert(cur);
cor[cur]=comp[0].size()-1;
int ok=0;
for(auto viz : g[cur]) {
if(abs(prof[cur]-prof[viz])!=1||cor[viz]!=-1) continue;
if(comp[0].size()<60) predfs(viz), ok++;
else if(cor[viz]==-1) qu.push(viz);
}
if(!ok||(cur==0&&ok==1)) leaves[0].insert(cur);
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
n=N; m=M; x=X; for(int i=0; i<m; i++) g[A[i]].insert(B[i]), g[B[i]].insert(A[i]);
inicia(0); predfs(0);
for(int i=1; i<n; i++) if(cor[i]!=-1) comp[i]=comp[0], leaves[i]=leaves[0];
while(qu.size()) {
int cur=qu.front(); qu.pop();
if(comp[cur].size()) continue;
for(auto viz : g[cur]) {
if(cor[viz]==-1) qu.push(viz);
else if(comp[cur].empty()) {
comp[cur]=comp[viz]; comp[cur].insert(cur);
leaves[cur]=leaves[viz]; leaves[cur].insert(cur);
int leaf; for(auto cara : leaves[viz]) if(cara!=viz) leaf=cara;
int nleaf, aux=0;
for(auto cara : comp[viz]) if(abs(prof[cara]-prof[leaf])==1&&g[leaf].find(cara)!=g[leaf].end()) nleaf=cara;
for(auto cara : comp[viz]) if(abs(prof[cara]-prof[nleaf])==1&&g[nleaf].find(cara)!=g[nleaf].end()) aux++;
if(aux==2) leaves[cur].insert(nleaf);
comp[cur].erase(leaf);
leaves[cur].erase(leaf);
leaves[cur].erase(viz);
cor[cur]=cor[leaf];
}
}
}
// for(auto cur : leaves[61]) printf("%d ", cur);
for(int i=0; i<n; i++) {
ll mask=0;
for(auto cara : comp[i]) mask|=(1LL<<cor[cara]);
if(mask!=(1LL<<60)-1) printf("erro!! %d >> %lld\n", i, mask);
}
for(int i = 0; i < N; i++) MessageBoard(i, (bool)(x&(1LL<<cor[i])));
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+5;
unordered_set<int> g[MAXN];
unordered_set<int> comp[MAXN], leaves[MAXN];
int cor[MAXN], prof[MAXN];
queue<int> qu;
int n, m;
ll x, respf, mask;
void inicia(int cur) {
cor[cur]=-1;
for(auto viz : g[cur]) {
if(cor[viz]) continue;
prof[viz]=prof[cur]+1;
inicia(viz);
}
}
void predfs(int cur) {
comp[0].insert(cur);
cor[cur]=comp[0].size()-1;
int ok=0;
for(auto viz : g[cur]) {
if(abs(prof[cur]-prof[viz])!=1||cor[viz]!=-1) continue;
if(comp[0].size()<60) predfs(viz), ok++;
else if(cor[viz]==-1) qu.push(viz);
}
if(!ok||(cur==0&&ok==1)) leaves[0].insert(cur);
}
void resolve(int cur, int p) {
// printf("resolve %d\n", cur);
comp[p].erase(cur);
for(auto viz : g[cur]) {
if(comp[p].find(viz)==comp[p].end()) continue;
if(Move(viz)) respf|=(1LL<<cor[viz]);
mask|=(1LL<<cor[viz]);
resolve(viz, p);
Move(cur);
}
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
n=N; m=M; for(int i=0; i<m; i++) g[A[i]].insert(B[i]), g[B[i]].insert(A[i]);
inicia(0); predfs(0);
for(int i=1; i<n; i++) if(cor[i]!=-1) comp[i]=comp[0], leaves[i]=leaves[0];
while(qu.size()) {
int cur=qu.front(); qu.pop();
if(comp[cur].size()) continue;
for(auto viz : g[cur]) {
if(cor[viz]==-1) qu.push(viz);
else if(comp[cur].empty()) {
comp[cur]=comp[viz]; comp[cur].insert(cur);
leaves[cur]=leaves[viz]; leaves[cur].insert(cur);
int leaf; for(auto cara : leaves[viz]) if(cara!=viz) leaf=cara;
int nleaf, aux=0;
for(auto cara : comp[viz]) if(abs(prof[cara]-prof[leaf])==1&&g[leaf].find(cara)!=g[leaf].end()) nleaf=cara;
for(auto cara : comp[viz]) if(abs(prof[cara]-prof[nleaf])==1&&g[nleaf].find(cara)!=g[nleaf].end()) aux++;
if(aux==2) leaves[cur].insert(nleaf);
comp[cur].erase(leaf);
leaves[cur].erase(leaf);
leaves[cur].erase(viz);
cor[cur]=cor[leaf];
}
}
}
// for(auto cur : comp[P]) printf("%d ", cur); cout << endl;
if(V) respf|=(1LL<<cor[P]);
mask|=(1LL<<cor[P]);
resolve(P, P);
// printf("mask= %lld // respf= %lld // %d <> %lld\n", mask, respf, comp[P].size(), *comp[P].begin());
return respf;
}
