# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
737750 | rominanafu | Tropical Garden (IOI11_garden) | C++11 | 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>
#define pii pair<int,int>
using namespace std;
pii sig[150005];
int caso, resp;
int cant_rutas(int ant, int act, int sum, int fin) {
if (act == fin && sum == caso)
return 1;
if (sum > caso)
return 0;
int r=0;
if (sig[act].first != ant || sig[act].second == -1)
r = cant_rutas(act, sig[act].first, sum+1, fin);
else
r = cant_rutas(act, sig[act].second, sum+1, fin);
return r;
}
void count_routes(int n, int m, int fin, int R[][2], int queries, int G[])
{
memset(sig, -1, sizeof(sig));
int a, b;
for(int i=0; i<m; i++) {
a = R[i][0];
b = R[i][1];
if (sig[a].first == -1) {
sig[a].first = b;
} else if (sig[a].second == -1) {
sig[a].second = b;
}
if (sig[b].first == -1) {
sig[b].first = a;
} else if (sig[b].second == -1) {
sig[b].second = a;
}
}
for(int i=0; i<queries; i++) {
caso = G[i];
resp = 0;
for(int i=0; i<n; i++) {
resp += cant_rutas(-1, i, 0);
}
answer(resp);
}
return 0;
}