#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e5+5;
vector<int>adj[mxn];
pair<int,int>edges[mxn];
int dep[mxn];
int in[mxn],out[mxn],timer;
int jump[20][mxn];
vector<int>st[mxn];
bool ex[mxn];
void dfs(int v,int pa){
dep[v]=dep[pa]+1;
jump[0][v]=pa;
st[v].pb(v);
in[v]=++timer;
for(auto u:adj[v]){
if(u==pa)continue;
dfs(u,v);
}
out[v]=timer;
}
void build(int n){
for(int i=1;i<20;i++){
for(int j=1;j<=n;j++){
jump[i][j]=jump[i-1][jump[i-1][j]];
}
}
}
struct BIT{
int bit[mxn];
void modify(int p,int v){
for(;p<mxn;p+=p&-p){
bit[p]+=v;
}
}
void modify(int l,int r,int v){
modify(l,v);
modify(r+1,-v);
}
int query(int p){
int res=0;
for(;p;p-=p&-p){
res+=bit[p];
}
return res;
}
int query(int l,int r){
return query(r)-query(l);
}
};
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,m,q;
cin>>n>>m>>q;
for(int i=1;i<n;i++){
int a,b;
cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
edges[i]={a,b};
}
vector<int>op(m);
for(auto &i:op){
cin>>i;
}
int root;
cin>>root;
dfs(root,root);
build(n);
BIT bt;
for(auto x:op){
auto [v,u]=edges[x];
if(dep[v]<dep[u]){
swap(v,u);
}
if(ex[x]==1){
bt.modify(in[v],out[v],-1);
ex[x]=0;
}
else{
bt.modify(in[v],out[v],1);
ex[x]=1;
int d=v;
for(int i=19;i>=0;i--){
int D=jump[i][d];
if(bt.query(in[D],in[d])>=(1<<i)){
d=D;
}
}
if(sz(st[v])>sz(st[d]))swap(st[v],st[d]);
st[d].insert(st[d].end(),all(st[v]));
st[v].clear();
}
}
cout<<sz(st[root])<<'\n';
}
/*
input:
*/
Compilation message
synchronization.cpp: In function 'void setIO(std::string)':
synchronization.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
synchronization.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
13148 KB |
Output is correct |
| 2 |
Correct |
2 ms |
13148 KB |
Output is correct |
| 3 |
Correct |
2 ms |
13148 KB |
Output is correct |
| 4 |
Correct |
3 ms |
13148 KB |
Output is correct |
| 5 |
Correct |
3 ms |
13148 KB |
Output is correct |
| 6 |
Correct |
3 ms |
13404 KB |
Output is correct |
| 7 |
Correct |
14 ms |
14172 KB |
Output is correct |
| 8 |
Correct |
13 ms |
14268 KB |
Output is correct |
| 9 |
Correct |
14 ms |
14172 KB |
Output is correct |
| 10 |
Incorrect |
193 ms |
23380 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
75 ms |
25536 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
13148 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
230 ms |
27524 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
13148 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
