Submission #924546

#	Time	Username	Problem	Language	Result	Execution time	Memory
924546		UmairAhmadMirza	Railway (BOI17_railway)	C++17	8 / 100	1097 ms	364184 KiB

railway

#include <bits/stdc++.h>
using namespace std;
int const N=10005;
int const M=2005;
vector<int> adj[N];
multiset<int> cnt[N];
int sz[M];
vector<int> ans;
int n,m,k;
map<pair<int,int>,int> mp;
void dfs(int node,int par){
  for(auto i:adj[node])
    if(i!=par){
      dfs(i,node);
      for(auto j:cnt[i])
        cnt[node].insert(j);
    }
  int p=0;
  for(int j=0;j<m;j++){
    int c=cnt[node].count(j);
    if(c<sz[j] && c>0)
      p++;
  }
  if(p>=k && par!=-1)
    ans.push_back(mp[{par,node}]);
}
int main(){
  cin>>n>>m>>k;
  for(int i=0;i<n-1;i++){
    int a,b;
    cin>>a>>b;
    mp[{a,b}]=i+1;
    mp[{b,a}]=i+1;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for(int i=0;i<m;i++){
    cin>>sz[i];
    for(int j=0;j<sz[i];j++){
      int a;
      cin>>a;
      cnt[a].insert(i);
    }
  }
  dfs(1,-1);
  cout<<ans.size()<<endl;
  sort(ans.begin(),ans.end());
  for(auto i:ans)
    cout<<i<<' ';
  cout<<endl;
  return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 7
• Subtask 4: 0 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25