Submission #1589893


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

const int MAX = 1e5;
const int INF = 1e9;
int d[MAX];
vector<vector<int> > edge(MAX);

void dfs(int s, int g) {
  for (int i = 0; i < edge[s].size(); i++) {
    if (d[edge[s][i]] < INF) continue;
    d[edge[s][i]] = d[s] + 1;
    if (edge[s][i] == g) return;
    
    dfs(edge[s][i], g);
  }
}

int main() {
  int N;
  cin >> N;
  int x, y;
  for (int i = 0; i < N - 1; i++) {
    scanf("%d %d", &x, &y);
    x--; y--;
    edge[x].push_back(y);
    edge[y].push_back(x);
  }

  int Q;
  cin >> Q;
  int a, b;
  for (int i = 0; i < Q; i++) {
    cin >> a >> b;
    a--; b--;
    fill(d, d + MAX, INF);
    d[a] = 0;
    dfs(a, b);

    // 解答
    printf("%d\n", d[b] + 1);
  }

  return 0;
}

Submission Info

Submission Time
Task D - 閉路
User university
Language C++14 (GCC 5.4.1)
Score 30
Code Size 819 Byte
Status TLE
Exec Time 2104 ms
Memory 10752 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &x, &y);
                           ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 12
AC × 15
TLE × 12
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 2 ms 2944 KB
subtask0_sample02.txt AC 2 ms 2944 KB
subtask0_sample03.txt AC 2 ms 2944 KB
subtask1_01.txt AC 33 ms 10752 KB
subtask1_02.txt AC 32 ms 10240 KB
subtask1_03.txt AC 2 ms 2944 KB
subtask1_04.txt AC 2 ms 2944 KB
subtask1_05.txt AC 2 ms 2944 KB
subtask1_06.txt AC 2 ms 3072 KB
subtask1_07.txt AC 39 ms 6272 KB
subtask1_08.txt AC 40 ms 6144 KB
subtask1_09.txt AC 40 ms 6144 KB
subtask1_10.txt AC 37 ms 6144 KB
subtask1_11.txt AC 40 ms 6144 KB
subtask1_12.txt AC 40 ms 6144 KB
subtask2_01.txt TLE 2104 ms 10752 KB
subtask2_02.txt TLE 2104 ms 10752 KB
subtask2_03.txt TLE 2103 ms 3072 KB
subtask2_04.txt TLE 2103 ms 3072 KB
subtask2_05.txt TLE 2103 ms 3200 KB
subtask2_06.txt TLE 2103 ms 3200 KB
subtask2_07.txt TLE 2104 ms 6272 KB
subtask2_08.txt TLE 2104 ms 6144 KB
subtask2_09.txt TLE 2103 ms 8192 KB
subtask2_10.txt TLE 2104 ms 6144 KB
subtask2_11.txt TLE 2104 ms 6144 KB
subtask2_12.txt TLE 2104 ms 6144 KB