Submission #592483

#	Time	Username	Problem	Language	Result	Execution time	Memory
592483		BT21tata	Tropical Garden (IOI11_garden)	C++17	49 / 100	5009 ms	4692 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>g[150005];
map<int,int>mp;
int ans;

void dfs(int v, int par, int cnt, int P)
{
    if(!cnt)
    {
        if(v==P) ans++;
        return;
    }
    if(g[v].size()==1 or g[v][0]!=par)
        dfs(g[v][0], v, cnt-1, P);
    else dfs(g[v][1], v, cnt-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++)
    {
        g[r[i][0]].push_back(r[i][1]);
        g[r[i][1]].push_back(r[i][0]);
    }

    for(int i=0; i<q; i++)
    {
        ans=0;
        for(int j=0; j<n; j++)
        {
            dfs(j, -1, G[i], P);
        }
        answer(ans);
    }
}

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