oj.uz

답안 #774630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774630 2023-07-06T00:30:20 Z canadavid1 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
49 / 100
 5000 ms 1968 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
struct Node
{
    vector<Node*> n;
};
Node *P;
vector<Node> nodes;
int traverse(Node *t, Node *p, int c)
{
    if(c==0) return t==P;
    if(t->n[0]==p && t->n.size()>1) return traverse(t->n[1],t,c-1);
    return traverse(t->n[0],t,c-1);
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
  // setup graph
  nodes.resize(N);
  for(int i = 0; i < M; i++)
  {
    nodes[R[i][0]].n.push_back(&nodes[R[i][1]]);
    nodes[R[i][1]].n.push_back(&nodes[R[i][0]]);
  }
  ::P = &nodes[P];
  for(int i = 0; i < Q; i++)
  {
    int c = 0;
    for(int j = 0; j < N; j++) c += traverse(&nodes[j],nullptr,G[i]);
    answer(c);
  }
}

Subtask #1
49.0 / 49.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Execution timed out 5070 ms 1968 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Execution timed out 5070 ms 1968 KB Time limit exceeded
12 Halted 0 ms 0 KB -