#include "werewolf.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int VAL = 500;
const int MAXN = 2e5+5;
#define pb push_back
#define fr first
#define sc second
bool vis1[MAXN], vis2[MAXN];
vector<int> edges[MAXN];
void dfs1(int x, int L) {
vis1[x] = 1;
for(int viz : edges[x])
if(viz >= L and !vis1[viz]) dfs1(viz, L);
}
void dfs2(int x, int R) {
vis2[x] = 1;
for(int viz : edges[x])
if(viz <= R and !vis2[viz]) dfs2(viz, R);
}
vector<int> check_validity(int n, vector<int> X, vector<int> Y,
vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
int q = (int)S.size();
for(int i = 0; i < (int)X.size(); i++) {
edges[X[i]].pb(Y[i]);
edges[Y[i]].pb(X[i]);
}
vector<int> ans(q);
for(int i = 0; i < q; i++) {
fill(vis1, vis1+n, 0);
fill(vis2, vis2+n, 0);
dfs1(S[i], L[i]);
dfs2(E[i], R[i]);
for(int j = 0; j < n; j++)
if(vis1[j] and vis2[j]) ans[i] = 1;
}
return ans;
}
