Submission #1498989
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
//#define DEBUG_MODE
#ifdef DEBUG_MODE
#define dump(x) cout << #x << " : " << x << endl
#define LINE cout << "line : " << __LINE__ << endl
#define dumpV(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << endl
#define STOP assert(false)
#else
#define dump(x) ;
#define LINE ;
#define dumpV(v);
#define STOP ;
#endif
#define mp make_pair
namespace std{
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.fi<<", "<<a.se<<')';
return out;
}
}
const int MAX_N = 1e5+10;
vi es[MAX_N];
bool used[MAX_N];
int main(){
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--; b--;
es[a].pb(b);
es[b].pb(a);
}
deque<int> d;
d.push_front(0);
d.push_back(*es[0].begin());
rep(i, 2) used[d[i]] = true;
LINE;
while(1) {
dump(mp(d.front(), d.back()));
bool update = false;
for(auto& to : es[d.front()]) {
if(!used[to]) {
update = true;
d.push_front(to);
used[to] = true;
break;
}
}
for(auto& to : es[d.back()]) {
if(!used[to]) {
update = true;
d.push_back(to);
used[to] = true;
break;
}
}
if(!update) break;
}
cout << d.size() << endl;
rep(i, d.size()) {
cout << d[i]+1;
if(i + 1 != d.size()) cout <<" ";
else cout << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Hamiltonish Path |
User |
T1610 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1945 Byte |
Status |
AC |
Exec Time |
87 ms |
Memory |
6784 KB |
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 |
66 ms |
4864 KB |
subtask_1_02.txt |
AC |
17 ms |
3072 KB |
subtask_1_03.txt |
AC |
60 ms |
4864 KB |
subtask_1_04.txt |
AC |
70 ms |
4736 KB |
subtask_1_05.txt |
AC |
70 ms |
4736 KB |
subtask_1_06.txt |
AC |
70 ms |
4736 KB |
subtask_1_07.txt |
AC |
77 ms |
5888 KB |
subtask_1_08.txt |
AC |
73 ms |
5760 KB |
subtask_1_09.txt |
AC |
87 ms |
6784 KB |
subtask_1_10.txt |
AC |
22 ms |
3328 KB |
subtask_1_11.txt |
AC |
27 ms |
3328 KB |
subtask_1_12.txt |
AC |
2 ms |
2560 KB |
subtask_1_13.txt |
AC |
2 ms |
2560 KB |