#include "werewolf.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i, l, r) for (auto i = l; i < r; i++)
#define fo(i, n) fore (i, 0, n)
#define forex(i, r, l) for (auto i = r-1; i >= l; i--)
#define ffo(i, n) forex (i, n, 0)
bool cmin(ll &a, ll b) { if (b < a) { a=b; return 1; } return 0; }
bool cmax(ll &a, ll b) { if (b > a) { a=b; return 1; } return 0; }
const ll INF = 1e18;
vector<vll> graph;
void dfs (ll u, ll l, ll r, vll &vis) {
vis[u] = 1;
for (ll v: graph[u]) {
if (vis[v] || v < l || r < v) continue;
dfs(v, l, r, vis);
}
}
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 = S.size(), m = X.size();
graph = vector<vll>(n);
fo (i, m) {
graph[X[i]].pb(Y[i]);
graph[Y[i]].pb(X[i]);
}
vector<int> ans(Q, 0);
fo (qi, Q) {
vll vs(n, 0), ve(n, 0);
dfs (S[qi], L[qi], n-1, vs);
dfs (E[qi], 0, R[qi], ve);
fo (i, n) if (vs[i] && ve[i]) ans[qi] = 1;
}
return ans;
}
