oj.uz

Submission #500321

# Submission time Handle Problem Language Result Execution time Memory
500321 2021-12-30T18:04:39 Z aryan12 Tropical Garden (IOI11_garden) C++17
49 / 100
 5000 ms 6080 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5 + 5;
vector<int> g[MAXN];
int ans = 0;

void dfs(int node, int par, int achieve_len, int len, int target) {
    if(achieve_len == len) {
        if(target == node) {
            ans++;
        }
        return;
    }
    for(int i = 0; i < g[node].size(); i++) {
        if(g[node][i] == par && g[node].size() != 1) {
            continue;
        }
        dfs(g[node][i], node, achieve_len, len + 1, target);
        break;
    }
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
    for(int i = 0; i < M; i++) {
        if(g[R[i][0]].size() >= 2 && g[R[i][1]].size() >= 2) {
            continue;
        }
        g[R[i][0]].push_back(R[i][1]);
        g[R[i][1]].push_back(R[i][0]);
    }
    for(int i = 0; i < N; i++) {
        dfs(i, -1, G[0], 0, P);
    }
    answer(ans);
}

Compilation message

garden.cpp: In function 'void dfs(int, int, int, int, int)':
garden.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i = 0; i < g[node].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4996 KB Output is correct
2 Correct 3 ms 5000 KB Output is correct
3 Correct 3 ms 5000 KB Output is correct
4 Correct 3 ms 5004 KB Output is correct
5 Correct 3 ms 5000 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 5004 KB Output is correct
9 Correct 5 ms 5068 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4996 KB Output is correct
2 Correct 3 ms 5000 KB Output is correct
3 Correct 3 ms 5000 KB Output is correct
4 Correct 3 ms 5004 KB Output is correct
5 Correct 3 ms 5000 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 5004 KB Output is correct
9 Correct 5 ms 5068 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Execution timed out 5046 ms 6080 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4996 KB Output is correct
2 Correct 3 ms 5000 KB Output is correct
3 Correct 3 ms 5000 KB Output is correct
4 Correct 3 ms 5004 KB Output is correct
5 Correct 3 ms 5000 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 5004 KB Output is correct
9 Correct 5 ms 5068 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Execution timed out 5046 ms 6080 KB Time limit exceeded
12 Halted 0 ms 0 KB -