Submission #1691073


Source Code Expand

#include<iostream>
using namespace std;
int nxt[100001],head[100001],to[100001],cnt;
int a[100001],num,N=1;
int book[100001];
void add(int u,int v)
{
	cnt++;
	nxt[cnt]=head[u];
	head[u]=cnt;
	to[cnt]=v;
}
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=m;i++) 
	{
		int x,y;
		cin>>x>>y;
		add(x,y);
		add(y,x);
	} 
	for(int i=1;i<=n;i++)
	{
		if(head[i]!=0)
		{
			int y=i,x;
			num++;
			a[num]=y;
			book[y]=1;
			while(N==1)
			{
				N=0;
				for(int j=head[y];j!=0;j=nxt[j])
				{
					if(book[to[j]]==0)  { y=to[j];N=1;break;}
				}
				num++;
				a[num]=y;
				book[y]=1;
			}
			break;
		}
	}
	cout<<num-1<<endl;
	for(int i=1;i<=num-1;i++)  cout<<a[i]<<" ";
	return 0;
}

Submission Info

Submission Time
Task B - Hamiltonish Path
User justin_cao
Language C++14 (GCC 5.4.1)
Score 0
Code Size 729 Byte
Status RE
Exec Time 136 ms
Memory 1408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 9
WA × 1
RE × 9
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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt RE 136 ms 1280 KB
subtask_1_02.txt WA 17 ms 768 KB
subtask_1_03.txt RE 135 ms 1280 KB
subtask_1_04.txt RE 134 ms 1280 KB
subtask_1_05.txt RE 133 ms 1280 KB
subtask_1_06.txt RE 133 ms 1280 KB
subtask_1_07.txt RE 135 ms 1408 KB
subtask_1_08.txt RE 136 ms 1408 KB
subtask_1_09.txt RE 134 ms 1408 KB
subtask_1_10.txt AC 26 ms 1024 KB
subtask_1_11.txt RE 125 ms 1024 KB
subtask_1_12.txt AC 1 ms 256 KB
subtask_1_13.txt AC 1 ms 256 KB