Submission #1222186
Source Code Expand
//IIT Kanpur FacelessMen India
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define X first
#define Y second
#define REP(i,a) for(int i=0;i<a;++i)
#define REPP(i,a,b) for(int i=a;i<b;++i)
#define FILL(a,x) memset(a,x,sizeof(a))
#define foreach( gg,itit ) for( typeof(gg.begin()) itit=gg.begin();itit!=gg.end();itit++ )
#define mp make_pair
#define pb push_back
#define all(s) s.begin(),s.end()
#define present(c,x) ((c).find(x) != (c).end())
const double EPS = 1e-8;
const int mod = 1e9+7;
const int N = 1e6+10;
const ll INF = 1e18;
//#define DEBUG
ll power(ll x,ll y){
ll t=1;
while(y>0){
if(y%2) y-=1,t=t*x%mod;
else y/=2,x=x*x%mod;
}
return t;
}
#ifdef DEBUG
#define dprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#else
#define dprintf(fmt,...)
#endif
vector<int> G[N],a[2];
int u[N];
void dfs(int v,vector<int> &a){
u[v]=1;
a.pb(v);
int lo=0;
REP(i,G[v].size()) if(u[G[v][i]]==0&&lo==0) dfs(G[v][i],a),lo++;
}
int main(){
// freopen("product.in","r",stdin);
// freopen("product.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
REP(i,m){
int x,y; scanf("%d%d",&x,&y);
x--;y--;
G[x].pb(y); G[y].pb(x);
}
int p=0;
a[0].pb(0);
u[0]=1;
REP(i,G[0].size()) if(u[G[0][i]]==0&&p<2){
dfs(G[0][i],a[p]);
p++;
}
if(p==2){
reverse(all(a[1]));
REP(i,a[0].size()) a[1].pb(a[0][i]);
a[0]=a[1];
}
printf("%d\n",(int)a[0].size());
REP(i,a[0].size()) printf("%d ",a[0][i]+1);
printf("\n");
return 0;
}
Submission Info
Submission Time
2017-04-15 21:33:25+0900
Task
B - Hamiltonish Path
User
alecsyde
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
1687 Byte
Status
AC
Exec Time
60 ms
Memory
31992 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:51:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:53:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int x,y; scanf("%d%d",&x,&y);
^
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
12 ms
25600 KB
sample_02.txt
AC
13 ms
25600 KB
sample_03.txt
AC
13 ms
25600 KB
subtask_1_01.txt
AC
42 ms
27904 KB
subtask_1_02.txt
AC
19 ms
26112 KB
subtask_1_03.txt
AC
38 ms
28032 KB
subtask_1_04.txt
AC
42 ms
27904 KB
subtask_1_05.txt
AC
43 ms
27904 KB
subtask_1_06.txt
AC
44 ms
27904 KB
subtask_1_07.txt
AC
44 ms
28800 KB
subtask_1_08.txt
AC
44 ms
28800 KB
subtask_1_09.txt
AC
60 ms
31992 KB
subtask_1_10.txt
AC
20 ms
26240 KB
subtask_1_11.txt
AC
22 ms
26368 KB
subtask_1_12.txt
AC
12 ms
25600 KB
subtask_1_13.txt
AC
12 ms
25600 KB