#include "Encoder.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
namespace{
using vi = vector<int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())
const int mx = 250'000;
using ll = long long;
using vll = vector<ll>;
int N;
vi edge[mx];
vll code(mx, 0);
vll dfsind(mx, 0);
vll subtree(mx, 1);
int ct = -1;
void dfs(int u, int p)
{
// cerr << "dfs " << u << '\n';
dfsind[u] = ++ct;
for(int v : edge[u])
{
if(v == p) continue;
dfs(v, u);
subtree[u] += subtree[v];
}
}
}
void Encode(int N_, int A[], int B[])
{
N = N_;
for(int e = 0; e < N-1; e++)
{
edge[A[e]].push_back(B[e]);
edge[B[e]].push_back(A[e]);
}
// cerr << "done\n";
dfs(0, -1);
// cerr << "done2\n";
for(int i = 0; i < N; i++)
{
// cerr << i << " : " << dfsind[i] << ' ' << subtree[i] << ' ' << ((dfsind[i]<<18) | subtree[i]) << '\n';
Code(i, (dfsind[i] << 18) | subtree[i]);
}
}
#include "Device.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
namespace
{
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
#define sz(x) int(x.size())
}
void InitDevice()
{
;
}
int Answer(long long S, long long T)
{
ll s_ind = S>>18;
ll s_st = S & ((1<<18) - 1);
ll t_ind = T>>18;
ll t_st = T & ((1<<18) - 1);
// cerr << S << ' ' << T << " : " << s_ind << ' ' << s_st << " | " << t_ind << ' ' << t_st << "\n";
if(t_ind <= s_ind && s_ind + s_st <= t_ind + t_st)
return 0;
else if(s_ind <= t_ind && t_ind + t_st <= s_ind + s_st)
return 1;
else
return 2;
}
