Submission #1585993
Source Code Expand
#include <bits/stdc++.h> using namespace std; int n, x, y, a, b, q, d[100001]; vector<int> g[100001]; bool used[100001]; void dfs (int v, int distance) { int si = g[v].size(), ret = 0; used[v] = true; d[v] = distance; for (int i = 0; i < si; ++i) { if (!used[g[v][i]]) { dfs(g[v][i], distance + 1); } } used[v] = false; return; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n - 1; ++i) { cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } cin >> q; for (int i = 0; i < q; ++i) { cin >> a >> b; a--, b--; dfs(a, 0); cout << d[b] + 1 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 閉路 |
User | otyaduke_117 |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 741 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 11008 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
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 | 2560 KB |
subtask0_sample02.txt | AC | 2 ms | 2560 KB |
subtask0_sample03.txt | AC | 2 ms | 2560 KB |
subtask1_01.txt | AC | 30 ms | 10880 KB |
subtask1_02.txt | AC | 30 ms | 10880 KB |
subtask1_03.txt | AC | 2 ms | 2560 KB |
subtask1_04.txt | AC | 2 ms | 2560 KB |
subtask1_05.txt | AC | 2 ms | 2688 KB |
subtask1_06.txt | AC | 2 ms | 2688 KB |
subtask1_07.txt | AC | 38 ms | 6272 KB |
subtask1_08.txt | AC | 38 ms | 6272 KB |
subtask1_09.txt | AC | 38 ms | 6272 KB |
subtask1_10.txt | AC | 38 ms | 6272 KB |
subtask1_11.txt | AC | 38 ms | 6272 KB |
subtask1_12.txt | AC | 38 ms | 6272 KB |
subtask2_01.txt | TLE | 2104 ms | 11008 KB |
subtask2_02.txt | TLE | 2104 ms | 10880 KB |
subtask2_03.txt | AC | 169 ms | 2816 KB |
subtask2_04.txt | AC | 229 ms | 2816 KB |
subtask2_05.txt | AC | 1070 ms | 2944 KB |
subtask2_06.txt | AC | 1152 ms | 3072 KB |
subtask2_07.txt | TLE | 2104 ms | 6272 KB |
subtask2_08.txt | TLE | 2104 ms | 6272 KB |
subtask2_09.txt | TLE | 2104 ms | 6272 KB |
subtask2_10.txt | TLE | 2104 ms | 6272 KB |
subtask2_11.txt | TLE | 2104 ms | 6272 KB |
subtask2_12.txt | TLE | 2104 ms | 6272 KB |