# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003812 | vjudge1 | Pastiri (COI20_pastiri) | C++17 | 193 ms | 40272 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 sz(v) (int)v.size()
const int MAXN = 5*1e5+5;
vector<int> adj[MAXN], ans, v;
queue<int> q;
int dist[MAXN], marc[MAXN], qtd[MAXN];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,k; cin>>n>>k;
for(int i = 1; i < n; i++){
int a,b; cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i = 0; i < k; i++){
int x; cin>>x;
dist[x] = 1; qtd[x] = 1;
q.push(x); v.push_back(x);
}
while(!q.empty()){
int x = q.front(); q.pop();
int b = 1;
for(int viz : adj[x]){
if(dist[viz] == dist[x]+1){
b = 0;
qtd[viz] += qtd[x];
}
if(dist[viz] == 0){
dist[viz] = dist[x] + 1;
qtd[viz] = qtd[x];
b = 0;
q.push(viz);
}
}
if(b && qtd[x] > 1)ans.push_back(x);
}
for(int x : ans)q.push(x);
while(!q.empty()){
int x = q.front(); q.pop();
for(int viz : adj[x])
if(dist[viz] == dist[x]-1 && !marc[viz]){
marc[viz] = 1;
q.push(viz);
}
}
for(int x : v)
if(!marc[x])ans.push_back(x);
cout<<sz(ans)<<"\n";
sort(ans.begin(),ans.end());
for(int viz : ans)cout<<viz<<" "; cout<<"\n";
}
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... |