Submission #1868443


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

vector<int> G[100010];
vector<int> ans;
bool used[100010];

void dfs(int u, vector<int> &a) {
  a.push_back(u);
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i];
    if (used[v]) continue;
    used[v] = true;
    dfs(v, a);
    return;
  }
}

int main(void) {
  int n, m;
  cin >> n >> m;

  int a, b;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  used[a] = used[b] = true;

  dfs(a, ans);
  reverse(ans.begin(), ans.end());
  dfs(b, ans);

  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  cout << endl;

  return 0;
}

Submission Info

Submission Time
Task B - Hamiltonish Path
User legosuke
Language C++14 (GCC 5.4.1)
Score 500
Code Size 733 Byte
Status AC
Exec Time 105 ms
Memory 9336 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 19
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 AC 2 ms 2560 KB
sample_02.txt AC 2 ms 2560 KB
sample_03.txt AC 2 ms 2560 KB
subtask_1_01.txt AC 79 ms 4864 KB
subtask_1_02.txt AC 20 ms 3072 KB
subtask_1_03.txt AC 72 ms 4864 KB
subtask_1_04.txt AC 86 ms 4736 KB
subtask_1_05.txt AC 84 ms 4736 KB
subtask_1_06.txt AC 86 ms 4736 KB
subtask_1_07.txt AC 90 ms 5888 KB
subtask_1_08.txt AC 90 ms 5760 KB
subtask_1_09.txt AC 105 ms 9336 KB
subtask_1_10.txt AC 27 ms 3328 KB
subtask_1_11.txt AC 32 ms 3328 KB
subtask_1_12.txt AC 2 ms 2560 KB
subtask_1_13.txt AC 2 ms 2560 KB