oj.uz

답안 #849342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849342 2023-09-14T14:00:33 Z Mr_Ph 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
49 / 100
 5000 ms 4188 KB 
#include "garden.h"
#include "gardenlib.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>adj;
bool valid=false;
void dfs(int node,int prv,int k,int p)
{
    if(k==0)
    {
        valid=(node==p);
        return;
    }
    if(adj[node].size()==1)
        dfs(adj[node][0],node,k-1,p);
    else
    {
        if(prv==adj[node][0])
            dfs(adj[node][1],node,k-1,p);
        else
            dfs(adj[node][0],node,k-1,p);
    }
}
void count_routes(int n, int m, int p, int r[][2], int q, int g[])
{
    adj.resize(n+1);
    for(int i=0; i<m; i++)
    {
        adj[r[i][0]].push_back(r[i][1]);
        adj[r[i][1]].push_back(r[i][0]);
    }
    int ans=0;
    for(int i=0;i<n;i++)
    {
        valid=false;
        dfs(i,-1,g[0],p);
        ans+=valid;
    }
    answer(ans);
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Execution timed out 5063 ms 4188 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Execution timed out 5063 ms 4188 KB Time limit exceeded
12 Halted 0 ms 0 KB -