#include "Joi.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
mt19937_64 rng(1891894948594);
int bitas[11000];
vector<int>adj[11000];
set<int>aplankyta;
int t = 0;
set<pair<int, int>>EE;
void dfs(int v, int p = -2)
{
if (aplankyta.count(v))
return;
EE.insert({v, p});
EE.insert({p, v});
aplankyta.insert(v);
t++;
t %= 60;
bitas[v] = t;
for (int x : adj[v])
{
dfs(x, v);
}
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
vector<int>PP(N);
iota(PP.begin(), PP.end(), 0);
shuffle(PP.begin(), PP.end(), rng);
for (int i = 0; i < M; i++)
{
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
for (int i = 0; i < N; i++)
shuffle(adj[i].begin(), adj[i].end(), rng);
dfs(rng() % N);
for (int i = 0; i < N; i++)
{
int s = 0;
if ((X & (1ll << bitas[i])) > 0)
s = 1;
MessageBoard(i, s);
}
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
mt19937_64 rng(1891894948594);
int bitas[11000];
vector<int>adj[11000];
set<int>aplankyta;
int t = 0;
set<pair<int, int>>EE;
vector<int>order;
void dfs(int v, int p = -2)
{
if (aplankyta.count(v))
return;
order.push_back(v);
EE.insert({v, p});
EE.insert({p, v});
aplankyta.insert(v);
t++;
t %= 60;
bitas[v] = t;
bool ok = false;
for (int x : adj[v])
{
if (aplankyta.count(x))
continue;
dfs(x, v);
order.push_back(v);
ok = true;
}
if (ok == false)
order.push_back(v);
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
vector<int>PP(N);
iota(PP.begin(), PP.end(), 0);
shuffle(PP.begin(), PP.end(), rng);
for (int i = 0; i < M; i++)
{
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
for (int i = 0; i < N; i++)
shuffle(adj[i].begin(), adj[i].end(), rng);
dfs(rng() % N);
ll X = 0;
vector<int>stak = {P};
set<int>bitai;
set<int>aplankyti;
int ii = find(order.begin(), order.end(), P) - order.begin();
int c = -1;
if (rng() % 2 == 0)
c = 1;
while (true)
{
X |= V * (1ll << bitas[P]);
bitai.insert(bitas[P]);
aplankyti.insert(P);
if (bitai.size() == 60)
break;
while (order[ii] == P)
{
ii = (ii + c + order.size()) % order.size();
}
int v1 = order[ii];
V = Move(v1);
P = v1;
}
return X;
}
