# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105204 | 2024-10-25T17:34:43 Z | jadai007 | Tropical Garden (IOI11_garden) | C++17 | 0 ms | 0 KB |
#include "garden.h" #include "gardenlib.h" #include <bits/stdc++.h> using namespace std; int ans = 0; vector<int> vc[200200] void dfs(int u, int k, int P){ if(u == P && k == 0) ans++; for(auto v:vc[u]) dfs(v, k - 1, P); } void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){ for(int i = 0; i < M; ++i) vc[R[i][0]].push_back(R[i][1]), vc[R[i][1]].push_back(R[i][0]); for(int i = 0; i < N; ++i) dfs(i, G[0], P); answer(ans); }