Submission #1371939
Source Code Expand
#include<bits/stdc++.h>
int n, m, u, v;
std::vector<int> G[100005];
std::deque<int> q;
bool vis[100005];
int find(bool f){
int v = f ? q.front(): q.back();
for(auto u : G[v])
if(!vis[u]){
vis[u] = true;
return u;
}
return 0;
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 0;i < m; ++i){
scanf("%d%d", &u, &v);
G[u].push_back(v);
G[v].push_back(u);
}
q.push_front(1); q.push_front(G[1][0]);
vis[1] = vis[G[1][0]] = true;
while(true) {
int a, b;
a = find(true);
b = find(false);
if(a + b) {
if(a) q.push_front(a);
if(b) q.push_back(b);
}else break;
}
printf("%d\n", (int) q.size());
for(int i = q.size() - 1;i >= 0; --i)
printf("%d ",q[i]);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Hamiltonish Path |
User |
dataisland |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
792 Byte |
Status |
AC |
Exec Time |
48 ms |
Memory |
6784 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:20:26: 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 |
3072 KB |
subtask_1_03.txt |
AC |
29 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 |
34 ms |
4736 KB |
subtask_1_07.txt |
AC |
35 ms |
5888 KB |
subtask_1_08.txt |
AC |
34 ms |
5760 KB |
subtask_1_09.txt |
AC |
48 ms |
6784 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 |