Submission #132168

#	Time	Username	Problem	Language	Result	Execution time	Memory
132168		mlyean00	Tropical Garden (IOI11_garden)	C++14	49 / 100	5047 ms	1788 KiB

garden

#include "garden.h"
#include "gardenlib.h"

#include <bits/stdc++.h>

using namespace std;
using adj_list = vector<vector<int>>;

adj_list g;

int dfs(int u, int p, int left) {
    if (left == 0) return u;
    if (g[u][0] == p && g[u].size() > 1)
        return dfs(g[u][1], u, left - 1);
    else
        return dfs(g[u][0], u, left - 1);
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
    g = adj_list(N);
    for (int i = 0; i < M; ++i) {
        g[R[i][0]].push_back(R[i][1]);
        g[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) {
            if (dfs(i, i, G[q]) == P) ++ans;
        }
        answer(ans);
    }
}

• Subtask 1: 49 / 49
• Subtask 2: 0 / 20
• Subtask 3: 0 / 31