結果

問題 No.363 門松サイクル
ユーザー heno239heno239
提出日時 2022-09-25 19:21:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 256 ms / 4,000 ms
コード長 8,615 bytes
コンパイル時間 2,567 ms
コンパイル使用メモリ 168,640 KB
実行使用メモリ 44,844 KB
最終ジャッジ日時 2023-08-24 01:46:47
合計ジャッジ時間 8,943 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
11,676 KB
testcase_01 AC 7 ms
11,656 KB
testcase_02 AC 9 ms
11,828 KB
testcase_03 AC 9 ms
11,868 KB
testcase_04 AC 9 ms
11,852 KB
testcase_05 AC 8 ms
11,920 KB
testcase_06 AC 8 ms
11,796 KB
testcase_07 AC 9 ms
11,800 KB
testcase_08 AC 9 ms
11,784 KB
testcase_09 AC 78 ms
22,764 KB
testcase_10 AC 81 ms
23,260 KB
testcase_11 AC 185 ms
38,448 KB
testcase_12 AC 192 ms
35,660 KB
testcase_13 AC 180 ms
32,160 KB
testcase_14 AC 149 ms
30,080 KB
testcase_15 AC 161 ms
36,600 KB
testcase_16 AC 124 ms
29,512 KB
testcase_17 AC 241 ms
44,772 KB
testcase_18 AC 232 ms
34,156 KB
testcase_19 AC 208 ms
35,064 KB
testcase_20 AC 234 ms
34,272 KB
testcase_21 AC 256 ms
41,988 KB
testcase_22 AC 187 ms
33,424 KB
testcase_23 AC 191 ms
37,392 KB
testcase_24 AC 8 ms
11,724 KB
testcase_25 AC 8 ms
11,728 KB
testcase_26 AC 195 ms
44,776 KB
testcase_27 AC 160 ms
44,844 KB
testcase_28 AC 256 ms
39,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//-----------------------------------------
struct lcagraph {
private:
	int n;
	vector<vector<int>> G;
	vector<vector<int>> parent;
	vector<int> depth;
	int root;
	int tmp;
public:
	lcagraph(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	lcagraph() {}
	void init(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		G[b].push_back(a);
	}
	void dfs(int id, int fr, int d) {
		parent[id][0] = fr;
		depth[id] = d;
		rep(j, G[id].size()) {
			int to = G[id][j];
			if (to == fr)continue;
			dfs(to, id, d + 1);
		}
	}
	void complete(int r = 0) {
		root = r;
		dfs(root, -1, 0);
		rep(j, tmp - 1)rep(i, n) {
			if (parent[i][j] < 0)parent[i][j + 1] = -1;
			else parent[i][j + 1] = parent[parent[i][j]][j];
		}
	}
	int lca(int u, int v) {
		if (depth[u] > depth[v])swap(u, v);
		for (int k = 0; k < tmp; k++) {
			if ((depth[v] - depth[u]) >> k & 1) {
				v = parent[v][k];
			}
		}
		if (u == v)return u;
		for (int k = tmp - 1; k >= 0; k--) {
			if (parent[u][k] != parent[v][k]) {
				u = parent[u][k];
				v = parent[v][k];
			}
		}
		return parent[u][0];
	}
	int dep(int x) {
		return depth[x];
	}
	int dist(int x, int y) {
		int l = lca(x, y);
		return depth[x] + depth[y] - 2 * depth[l];
	}
	//from a to b
	int proc_d(int a, int b, int d) {
		int l = lca(a, b);
		int res;
		if (dep(a) - dep(l) >= d) {
			res = a;
			rep(i, tmp) {
				if (d & (1 << i))res = parent[res][i];
			}
		}
		else {
			d = dep(a) + dep(b) - 2 * dep(l) - d;
			res = b;
			rep(i, tmp) {
				if (d & (1 << i))res = parent[res][i];
			}
		}
		return res;
	}
};

bool isok(vector<int> a) {
	if (a[0] == a[1] || a[0] == a[2] || a[1] == a[2])return false;
	if (a[1] > max(a[0], a[2]))return true;
	if (a[1] < min(a[0], a[2]))return true;
	return false;
}

void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<vector<int>> G(n);
	lcagraph lc(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
		lc.add_edge(a, b);
	}
	lc.complete();
	vector<int> pre(n);
	vector<int> par(n);
	function<void(int, int, int)> dfs = [&](int id, int fr, int ad) {
		par[id] = fr;
		if (par[id] >= 0 && par[par[id]] >= 0) {
			vector<int> c = { a[id],a[par[id]],a[par[par[id]]] };
			if (isok(c)) {
				ad++;
			}
			else {
				ad = 0;
			}
		}
		else {
			ad = 0;
		}
		pre[id] = ad;
		for (int to : G[id])if (to != fr) {
			dfs(to, id, ad);
		}
	};
	dfs(0, -1, 0);
	auto can = [&](int x, int y) {
		int l = lc.lca(x, y);
		int dx = lc.dep(x) - lc.dep(l);
		if (dx >= 2) {
			if (dx - 1 > pre[x])return false;
		}
		int dy = lc.dep(y) - lc.dep(l);
		if (dy >= 2) {
			if (dy - 1 > pre[y])return false;
		}
		if (l != x && l != y) {
			int cx = lc.proc_d(l, x, 1);
			int cy = lc.proc_d(l, y, 1);
			vector<int> cur = { a[cx],a[l],a[cy] };
			if (!isok(cur))return false;
		}
		int px = lc.proc_d(x, y, 1);
		vector<int> cur = { a[px],a[x],a[y] };
		if (!isok(cur))return false;
		int py = lc.proc_d(y, x, 1);
		cur = { a[x],a[y],a[py] };
		if (!isok(cur))return false;
		return true;
	};
	int q; cin >> q;
	rep(i, q) {
		int a, b; cin >> a >> b; a--; b--;
		if (can(a, b)) {
			cout << "YES\n";
		}
		else {
			cout << "NO\n";
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0