# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839169 | asdfgrace | 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 <bits/stdc++.h>
#include "garden.h"
using namespace std;
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
vector<vector<int>> edges(N);
for (int i = 0; i < M; ++i) {
edges[R[i][0]].push_back(R[i][1]);
edges[R[i][1]].push_back(R[i][0]);
}
for (int q = 0; q < Q; ++q) {
int ans = 0;
for (int i = 0; i < N; ++i) {
int cur = i, prev = i;
for (int it = 0; it < G[q]; ++it) {
if (prev != edges[cur][0] || (int) edges[cur].size() == 1) {
prev = cur;
cur = edges[cur][0];
} else {
prev = cur;
cur = edges[cur][1];
}
}
if (cur == P) {
++ans;
}
}
answer(ans);
}
}