oj.uz

Submission #1105205

# Submission time Handle Problem Language Result Execution time Memory
1105205 2024-10-25T17:35:02 Z jadai007 Tropical Garden (IOI11_garden) C++17
0 / 100
 215 ms 262144 KB 
#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 = 0; i < N; ++i) dfs(i, G[0], P);
    answer(ans);
}

Subtask #1
0 / 49.0

# Verdict Execution time Memory Grader output
1 Runtime error 215 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 215 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 215 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -