# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105202 | jadai007 | Tropical Garden (IOI11_garden) | C++17 | 0 ms | 0 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 "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 = 1; i <= n; ++i) dfs(i, k, P);
answer(ans);
}