結果
| 問題 | No.3106 Toptree is but what is not. |
| ユーザー |
 heno239
|
| 提出日時 | 2023-03-31 22:40:50 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,613 bytes |
| コンパイル時間 | 2,465 ms |
| コンパイル使用メモリ | 168,832 KB |
| 実行使用メモリ | 73,508 KB |
| 最終ジャッジ日時 | 2024-09-23 01:29:48 |
| 合計ジャッジ時間 | 3,846 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:468:32: warning: 'las' may be used uninitialized [-Wmaybe-uninitialized]
468 | cout << las << "\n";
| ^~~~
main.cpp:449:13: note: 'las' was declared here
449 | int las;
| ^~~
ソースコード
#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;
//ll mod = 1;
//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>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
vector<T> res;
int ida = 0, idb = 0;
while (ida < a.size() || idb < b.size()) {
if (idb == b.size()) {
res.push_back(a[ida]); ida++;
}
else if (ida == a.size()) {
res.push_back(b[idb]); idb++;
}
else {
if (a[ida] < b[idb]) {
res.push_back(a[ida]); ida++;
}
else {
res.push_back(b[idb]); idb++;
}
}
}
return res;
}
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;
}
};
const int mn = 1 << 18;
int score[mn];
struct edge {
int to;
};
using Data = LP;
vector<edge> G[mn];
vector<int> ids[mn];
vector<Data> memo[mn];
vector<ll> costs[mn];
int root;
Data merge(Data a, Data b) {
Data res;
//
res.first = a.first + b.first;
res.second = a.second + b.second;
//
return res;
}
Data dfs(int id, int fr) {
Data res;
//
//initialize
res.first = 0;
res.second = score[id];
//
for (edge e : G[id]) {
if (e.to == fr)continue;
Data nex = dfs(e.to, id);
//
//update with edge
nex.first += nex.second;
//
res = merge(res, nex);
ids[id].push_back(e.to);
memo[id].push_back(nex);
}
//
//update for return
//
return res;
}
ll mi = INF;
vector<int> anss;
void invdfs(int id, int fr, Data pre) {
vector<Data> v;
for (Data d : memo[id])v.push_back(d);
if (fr >= 0)v.push_back(pre);
int len = v.size();
//
//calcurate id's ans
ll sum = 0;
for (auto d : v) {
sum += d.first;
}
if (sum < mi) {
mi = sum;
anss.clear(); anss.push_back(id);
}
else if(sum==mi){
anss.push_back(id);
}
//
vector<Data> le(len + 1);
vector<Data> ri(len + 1);
//
Data init_c = { 0,0 };
//
le[0] = init_c;
rep(i, len) {
le[i + 1] = merge(le[i], v[i]);
}
ri[len] = init_c;
per(i, len) {
ri[i] = merge(ri[i + 1], v[i]);
}
rep(i, ids[id].size()) {
int to = ids[id][i];
Data d = merge(le[i], ri[i + 1]);
d.second += score[id];
//
//update for return
d.first += d.second;
//
invdfs(to, id, d);
}
}
void yaru() {
dfs(root, -1);
invdfs(root, -1, {0,0});
}
void solve() {
int n; cin >> n;
//assert(n == 150000);
lcagraph lc(n);
rep(i, n - 1) {
int a, b; cin >> a >> b;
lc.add_edge(a, b);
G[a].push_back({ b });
G[b].push_back({ a });
}
lc.complete();
vector<int> a(n);
rep(i, n)cin >> a[i];
auto ca = a;
int q; cin >> q;
//assert(q == 150000);
int las;
rep(i, q) {
int a, b, k, d; cin >> a >> b >> k >> d;
if (i == 0) {
int l = min(a, b);
int r = max(a, b);
Rep(j, l, r) {
score[j] = ca[j] + k;
}
yaru();
int mi = mod;
for (int id : anss) {
int dist = lc.dist(d, id);
if (dist < mi) {
mi = dist;
las = id;
}
}
}
cout << las << "\n";
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(8);
//init_f();
//init();
//while(true)
//expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
}