// Esti <3
//\
šťastia pre nás :)
// you're already the best
// _
// ^ ^ //
// >(O_O)<___//
// \ __ __ \
// \\ \\ \\\\
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3","unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
using ll = long long;
#define int long long
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second
#define vii(a,n) vector<int> a(n); forn(i,n) cin>>a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e18;
const int mod = 1e9+7;//998244353;
// \
\
:smiling_face_with_3_hearts: :smiling_face_with_3_hearts: :smiling_face_with_3_hearts:
//vidime sa veľmi skoro, moje slnko
const int N = 30005;
int t[21][21][N];
void add(int i, int j, int k, int x) {
for(;k<N;k|=k+1) t[i][j][k]+=x;
}
int sum(int i, int j, int r) {
int q=0;
for(;r>=0;r=(r&(r+1))-1) q+=t[i][j][r];
return q;
}
int par[N], top[N], sz[N], d[N];
int ind[N], inv[N];
int nxt=0;
vector<int> adj[N];
void dfs(int u, int p) {
par[u]=p;
sz[u]=1;
for(auto&v:adj[u]) {
if (v==p) continue;
d[v]=d[u]+1;
dfs(v,u);
sz[u]+=sz[v];
}
}
void dfs(int u, int p, int t) {
ind[u]=nxt++;
inv[ind[u]]=u;
top[u]=t;
int mx=-1;
for(auto&v:adj[u]) {
if (v==p) continue;
if (mx==-1) mx=v;
if (sz[v] > sz[mx]) mx=v;
}
if (mx==-1) return;
dfs(mx,u,t);
for(auto&v:adj[u]) {
if (v==p || v==mx) continue;
dfs(v,u,v);
}
}
int go[N][15];
int jump(int u, int x) {
forn(j,15) if ((x>>j)&1) u=go[u][j];
return u;
}
int lca(int u, int v) {
if (d[u]<d[v]) swap(u,v);
u=jump(u,d[u]-d[v]);
if (u==v) return u;
for(int j=14; j>=0; --j) {
if (go[u][j] == go[v][j]) continue;
u=go[u][j], v=go[v][j];
}
return par[u];
}
int f[20];
int s[20];
int fs=0, ss=0;
void qadd(int u, int v, int z) {
int l = lca(u,v);
fs=0, ss=0;
while (u!=l) {
f[fs++]=u; u=par[u];
}
f[fs++]=u;
while (v!=l) {
s[ss++]=v; v=par[v];
}
for (int i=ss-1; i>=0; --i) f[fs++]=s[i];
int k=fs;
assert(k<=20);
forn(i,k) {
int u = f[i];
for (int j=i; j<k; ++j) add(k,j,ind[u],z);
add(k,20,ind[u],z);
}
}
ll qry(int u, int t) {
ll ans=0;
while (1) {
forn(i,20) {
int x = sum(i+1,t%(i+1),ind[u]) - sum(i+1,t%(i+1),ind[top[u]]-1);
ans+=x;
int y = sum(i+1,20,ind[u]) - sum(i+1,20,ind[top[u]]-1);
ans+=1ll*y*(t/(i+1));
}
if (top[u]==0) break;
u=par[top[u]];
}
return ans;
}
ll query(int u, int v, int t) {
if (t<0) return 0;
ll ans = 0;
int l = lca(u,v);
ans += qry(u,t);
ans += qry(v,t);
ans -= 2ll*qry(l,t);
forn(i,20) {
int x = sum(i+1,t%(i+1),ind[l]) - sum(i+1,t%(i+1),ind[l]-1);
ans+=x;
int y = sum(i+1,20,ind[l]) - sum(i+1,20,ind[l]-1);
ans+=1ll*y*(t/(i+1));
}
return ans;
}
void solve() {
int n; cin>>n;
forn(i,n-1) {
int u,v; cin>>u>>v; --u, --v;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(0,0);
dfs(0,0,0);
forn(i,n) go[i][0]=par[i];
for(int j=1; j<15; ++j) forn(i,n) go[i][j]=go[go[i][j-1]][j-1];
int k; cin>>k;
forn(i,k) {
int u,v; cin>>u>>v; --u, --v;
qadd(u,v,1);
}
int q; cin>>q;
forn(i,q) {
int t; cin>>t;
if (t==1) {
int u,v; cin>>u>>v; --u, --v;
qadd(u,v,1);
} else if (t==2) {
int u,v; cin>>u>>v; --u, --v;
qadd(u,v,-1);
} else {
int u,v,a,b; cin>>u>>v>>a>>b; --u, --v;
ll ans = query(u,v,b);
ans -= query(u,v,a-1);
assert(ans>=0);
cout<<ans<<'\n';
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while (t--) solve();
return 0;
}
Compilation message
traffickers.cpp:3:1: warning: multi-line comment [-Wcomment]
3 | //\
| ^
traffickers.cpp:9:1: warning: multi-line comment [-Wcomment]
9 | // \ __ __ \
| ^
traffickers.cpp:36:1: warning: multi-line comment [-Wcomment]
36 | // \
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
86872 KB |
Output is correct |
| 2 |
Correct |
13 ms |
90972 KB |
Output is correct |
| 3 |
Correct |
12 ms |
90712 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
51 ms |
93528 KB |
Output is correct |
| 2 |
Correct |
57 ms |
93276 KB |
Output is correct |
| 3 |
Correct |
46 ms |
93792 KB |
Output is correct |
| 4 |
Correct |
57 ms |
93672 KB |
Output is correct |
| 5 |
Correct |
67 ms |
93776 KB |
Output is correct |
| 6 |
Correct |
57 ms |
93656 KB |
Output is correct |
| 7 |
Correct |
60 ms |
93468 KB |
Output is correct |
| 8 |
Correct |
69 ms |
93532 KB |
Output is correct |
| 9 |
Correct |
42 ms |
93744 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
692 ms |
96504 KB |
Output is correct |
| 2 |
Correct |
583 ms |
96868 KB |
Output is correct |
| 3 |
Correct |
682 ms |
96684 KB |
Output is correct |
| 4 |
Correct |
772 ms |
96520 KB |
Output is correct |
| 5 |
Correct |
873 ms |
96084 KB |
Output is correct |
| 6 |
Correct |
569 ms |
96852 KB |
Output is correct |
| 7 |
Correct |
522 ms |
96860 KB |
Output is correct |
| 8 |
Correct |
467 ms |
96872 KB |
Output is correct |
