oj.uz

Submission #877645

# Submission time Handle Problem Language Result Execution time Memory
877645 2023-11-23T11:54:01 Z huutuan Pastiri (COI20_pastiri) C++14
8 / 100
 628 ms 118744 KB 
#include<bits/stdc++.h>
#define taskname "sheep"

using namespace std;

const int N=5e5+1;
int n, k, a[N], dep[N], par[N], dist[N], del[N], vis[N];
set<int> g[N];

void bfs(){
   memset(dist, -1, sizeof dist);
   queue<int> q;
   for (int i=1; i<=n; ++i) if (a[i]) q.push(i), dist[i]=0;
   while (q.size()){
      int u=q.front(); q.pop();
      for (int v:g[u]) if (dist[v]==-1){
         dist[v]=dist[u]+1;
         q.push(v);
      }
   }
}

void dfs(int u, int p){
   par[u]=p;
   for (int v:g[u]) if (v!=p){
      dep[v]=dep[u]+1;
      dfs(v, u);
   }
}

void bfs(int root){
   queue<int> q;
   vector<int> vv;
   q.push(root); vis[root]=0;
   vv.push_back(root);
   while (q.size()){
      int u=q.front(); q.pop();
      if (vis[u]==dist[root]) continue;
      for (int v:g[u]) if (vis[v]==-1){
         vis[v]=vis[u]+1;
         q.push(v);
         vv.push_back(v);
      }
   }
   for (int i:vv){
      del[i]=1;
      if (dep[i]>dep[root]){
         for (int j:g[i]) g[j].erase(i);
         g[i].clear();
      }
      vis[i]=-1;
   }
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   // freopen(taskname".inp", "r", stdin);
   // freopen(taskname".out", "w", stdout);
   cin >> n >> k;
   for (int i=1; i<n; ++i){
      int u, v; cin >> u >> v;
      g[u].insert(v);
      g[v].insert(u);
   }
   for (int i=1; i<=k; ++i){
      int x; cin >> x;
      a[x]=1;
   }
   bfs();
   dfs(1, 0);
   memset(vis, -1, sizeof vis);
   vector<int> vv;
   for (int i=1; i<=n; ++i) if (a[i]) vv.push_back(i);
   sort(vv.begin(), vv.end(), [&](int x, int y){
      return dep[x]<dep[y];
   });
   vector<int> ans;
   while (vv.size()){
      int u=vv.back(); vv.pop_back();
      int v=u;
      while (dist[par[v]]==dep[u]-dep[par[v]]) v=par[v];
      ans.push_back(v);
      bfs(v);
      while (vv.size() && del[vv.back()]) vv.pop_back();
   }
   cout << ans.size() << '\n';
   for (int i:ans) cout << i << ' ';
   return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 114432 KB Output is correct
2 Correct 197 ms 113744 KB Output is correct
3 Correct 200 ms 113812 KB Output is correct
4 Correct 264 ms 118744 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 33884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 33624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 628 ms 83552 KB Output isn't correct
2 Halted 0 ms 0 KB -