# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
836112 | josanneo22 | Tourism (JOI23_tourism) | C++17 | 5050 ms | 10552 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define ar array
/*tourism
subtask 1&2: make root at l[i] then just find number of nodes passed through
*/
void solve(){
int n,m,q; cin>>n>>m>>q;
vector<vector<int>> g(n+1);
for(int i=0;i<n-1;i++){
int u,v; cin>>u>>v;
g[u].pb(v); g[v].pb(u);
}
vector<int> c(m+1),d(n+1);
function<void(int,int)> dfs=[&](int u,int f){
for(auto&v:g[u]){
if(v==f) continue;
dfs(v,u);
d[u]+=d[v];
}
};
for(int i=1;i<=m;i++) cin>>c[i];
auto reset=[&](int l,int r){
for(int i=1;i<=n;i++) d[i]=0;
for(int i=l;i<=r;i++) d[c[i]]=1;
};
auto ans=[&](int l,int r){
reset(l,r);
dfs(c[l],0);
int rs=0;
for(int i=1;i<=n;i++) if(d[i]>=1) rs++;
cout<<rs<<'\n';
};
while(q--){
int l,r; cin>>l>>r;
ans(l,r);
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
clock_t tStart = clock();
int local=0,multi=0,debug=1,tt=1;
if(local){
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
}
if(multi) cin>>tt;
for(int i=1;i<=tt;i++){
if(debug && multi && local) cout<<"样例 "<<i<<'\n';
solve();
}
fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |