// #pragma GCC optimize("O3") // #pragma GCC optimization("Ofast,unroll-loops") // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include <bits/stdc++.h> using namespace std; #define int long long #define ll long long #define FOR(i, l, r) for (int i = (l); i <= (r); i++) #define FOD(i, r, l) for (int i = (r); i >= (l); i--) #define fi first #define se second #define pii pair<int, int> const ll mod = 1e9 + 7; const int MAXN = 1e5 + 5; const ll oo = 1e18 + 7; const int base = 10; int n, m, q; vector<int> adj[MAXN]; struct canh{ int u, v; }cc[MAXN]; int h[MAXN]; int up[MAXN][20]; int in[MAXN], out[MAXN], cnt; void dfs(int u, int p){ in[u]=out[u]=++cnt; for(auto v:adj[u]){ if(v==p) continue; h[v]=h[u]+1; up[v][0]=u; FOR(i, 1, 19){ up[v][i]=up[up[v][i-1]][i-1]; } dfs(v, u); out[u]=max(out[u], out[v]); } } int bit[MAXN]; void add(int i, int val){ // cout << i << ' '; while(i<=n){ bit[i]+=val; i+=(i&(-i)); } } void update(int l, int r, int val){ add(l, val); add(r+1, -val); } int get(int i){ int sum=0; while(i>0){ sum+=bit[i]; i-=(i&(-i)); } return sum; } int find(int u){ int vl=get(in[u]); // cout << vl << ' '; FOD(i, 19, 0){ if(up[u][i] && get(in[up[u][i]])==vl){ u=up[u][i]; } } // cout << u << ' '; return u; } int sum[MAXN], last[MAXN]; void join(int id){ int u=cc[id].u, v=cc[id].v; u=find(u); update(in[v], out[v], -1); sum[u]+=sum[v]-last[id]; } void del(int id){ int u=cc[id].u, v=cc[id].v; u=find(u); update(in[v], out[v], 1); sum[v]=last[id]=sum[u]; } int t[MAXN]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); // freopen("test.txt", "r", stdin); // freopen("o2.out", "w", stdout); if(fopen(".inp", "r")){ freopen(".inp", "r", stdin); freopen(".out", "w", stdout); } cin >> n >> m >> q; FOR(i, 1, n-1){ int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); cc[i]={u, v}; } dfs(1, 0); FOR(i, 1, n-1){ int u=cc[i].u, v=cc[i].v; if(h[u]>h[v]){ swap(cc[i].u, cc[i].v); } } FOR(u, 1, n){ sum[u]=1; update(in[u], out[u], 1); } while(m--){ int id; cin >> id; t[id]^=1; if(t[id]){ join(id); } else{ del(id); } } while(q--){ int u; cin >> u; cout << sum[find(u)] << '\n'; } return 0; }

synchronization.cpp: In function 'int main()':
synchronization.cpp:102:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
synchronization.cpp:103:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~