Submission #1796887
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename T> T inf; template <> constexpr int inf<int> = 1e9; template <> constexpr ll inf<ll> = 1e18; int main() { int N, M; cin >> N >> M; vector<vector<int>> g(N); for(int i = 0; i < N; ++i) { int a, b; cin >> a >> b; g[a - 1].push_back(b - 1); g[b - 1].push_back(a - 1); } vector<int> leaf; for(int i = 0; i < N; ++i) { if(g[i].size() == 1) { leaf.push_back(i); } } int s = leaf[0], t = leaf[1]; vector<int> d(N, inf<int>); d[s] = 0; vector<int> prev(N, -1); queue<int> que; que.push(s); while(!que.empty()) { int v = que.front(); que.pop(); for(auto to : g[v]) { if(d[to] != inf<int>) { continue; } d[to] = d[v] + 1; que.push(to); prev[to] = v; } } vector<int> res; int now = t; while(now != -1) { res.push_back(now); now = prev[now]; } for(int i = 0; i < (int)res.size(); ++i) { cout << res[i] + 1 << " \n"[i + 1 == res.size()]; } }
Submission Info
Submission Time | |
---|---|
Task | B - Hamiltonish Path |
User | Suibaka |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1254 Byte |
Status | RE |
Exec Time | 95 ms |
Memory | 7544 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | WA | 49 ms | 4224 KB |
subtask_1_02.txt | WA | 5 ms | 512 KB |
subtask_1_03.txt | WA | 53 ms | 4608 KB |
subtask_1_04.txt | WA | 38 ms | 3328 KB |
subtask_1_05.txt | WA | 36 ms | 3328 KB |
subtask_1_06.txt | WA | 38 ms | 3328 KB |
subtask_1_07.txt | WA | 78 ms | 6908 KB |
subtask_1_08.txt | WA | 75 ms | 6912 KB |
subtask_1_09.txt | WA | 88 ms | 7544 KB |
subtask_1_10.txt | WA | 1 ms | 256 KB |
subtask_1_11.txt | WA | 1 ms | 256 KB |
subtask_1_12.txt | RE | 95 ms | 256 KB |
subtask_1_13.txt | WA | 1 ms | 256 KB |