#include "garden.h" #include "gardenlib.h" #include <bits/stdc++.h> using namespace std; const int N=1005; vector < pair < int , int > > vec[N]; int dfs(int u , int p , int k) { if(!k) return u; int v,c; int mv=p,mc=0; for(auto x:vec[u]) { v=x.first; c=x.second; if(v==p) continue; if(c>mc) { mc=c; mv=v; } } return dfs(mv,u,k-1); } void count_routes(int n, int m, int P, int r[][2], int Q, int G[]) { int k=G[0]; for(int i=0;i<m;i++) { vec[r[i][0]].push_back({r[i][1],m-i}); vec[r[i][1]].push_back({r[i][0],m-i}); } int cnt=0; for(int i=0;i<n;i++) { if(dfs(i,-1,k)==P) cnt++; } answer(cnt); }