# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174131 | Warinchai | Pastiri (COI20_pastiri) | C++20 | 275 ms | 38208 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<int>adj[500005];
int mn[500005];
int p[500005];
int sz[500005];
int cant[500005];
int fp(int u){
return p[u]==u?u:p[u]=fp(p[u]);
}
void un(int a,int b){
sz[fp(a)]+=sz[fp(b)];
p[fp(b)]=fp(a);
}
int inf=1e9;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,k;cin>>n>>k;
for(int i=0;i<n-1;i++){
int a,b;cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i=1;i<=n;i++)mn[i]=inf,p[i]=i;
queue<pair<int,pair<int,int>>>q;
for(int i=0;i<k;i++){
int x;cin>>x;
sz[x]++;
q.push({x,{x,0}});
# | 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... |