Submission #1694027
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,q[N],size;
vector<int> e[N];
bool vis[N];
void dfs(int x){
q[++size]=x;vis[x]=1;
int cnt=0;
for (int i=0;i<e[x].size();i++)
if (!vis[e[x][i]]&&!cnt) dfs(e[x][i]),cnt++;
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++){
int u,v;
scanf("%d%d",&u,&v);
e[u].push_back(v);
e[v].push_back(u);
}
dfs(1);
reverse(q+1,q+size+1);
size--;
dfs(1);
printf("%d\n",size);
for (int i=1;i<=size;i++) printf("%d ",q[i]);
return 0;
}
Submission Info
Submission Time
2017-10-19 23:01:09+0900
Task
B - Hamiltonish Path
User
FoolMike
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
547 Byte
Status
AC
Exec Time
53 ms
Memory
11008 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:15:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:18:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
500 / 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
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
31 ms
4864 KB
subtask_1_02.txt
AC
9 ms
3200 KB
subtask_1_03.txt
AC
28 ms
4864 KB
subtask_1_04.txt
AC
32 ms
4736 KB
subtask_1_05.txt
AC
32 ms
4736 KB
subtask_1_06.txt
AC
33 ms
4864 KB
subtask_1_07.txt
AC
34 ms
5888 KB
subtask_1_08.txt
AC
37 ms
5760 KB
subtask_1_09.txt
AC
53 ms
11008 KB
subtask_1_10.txt
AC
10 ms
3328 KB
subtask_1_11.txt
AC
12 ms
3328 KB
subtask_1_12.txt
AC
2 ms
2560 KB
subtask_1_13.txt
AC
2 ms
2560 KB