Submission #25990

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
25990	2017-06-25T15:48:22 Z	H_H	Senior Postmen (BOI14_postmen)	C++14	55 / 100	273 ms	22932 KB

postmen

#include <bits/stdc++.h>
using namespace std;

const int MAXN=100005;
bool vis[MAXN];
bool vs[MAXN];
set<int>adj[MAXN];
int n,m;

int cyc=-1;


void dfs(int x)
{
	vis[x]=true;


	while(!adj[x].empty())
	{
		int y=*adj[x].begin();
		adj[x].erase(adj[x].begin());
		adj[y].erase(adj[y].find(x));
		if(vis[y])
		{
			cout<<x;
			cyc=y;
			break;
		}
		dfs(y);
		if(cyc!=-1)
		{
			cout<<" "<<x;
			if(cyc==x)
			{
				cout<<endl;
				cyc=-1;
			}
			else break;
		}
	}

	vis[x]=false;
}
int main()
{
	cin>>n>>m;
	for(int i=0;i<m;i++)
	{
		int x,y;
		cin>>x>>y;
		adj[x].insert(y);
		adj[y].insert(x);
	}
	
	for(int i=1;i<=n;i++)dfs(i);	
	return 0;
}

Subtask #1

38.0 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4992 KB	Output is correct
2	Correct	8 ms	4992 KB	Output is correct
3	Correct	7 ms	4992 KB	Output is correct
4	Correct	12 ms	5248 KB	Output is correct
5	Correct	9 ms	5120 KB	Output is correct
6	Correct	20 ms	5504 KB	Output is correct
7	Correct	39 ms	6520 KB	Output is correct
8	Correct	9 ms	5376 KB	Output is correct
9	Correct	250 ms	14712 KB	Output is correct
10	Correct	13 ms	5376 KB	Output is correct
11	Correct	11 ms	5376 KB	Output is correct
12	Correct	241 ms	14816 KB	Output is correct

Subtask #2

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4992 KB	Output is correct
2	Correct	7 ms	4992 KB	Output is correct
3	Correct	8 ms	4992 KB	Output is correct
4	Correct	12 ms	5248 KB	Output is correct
5	Correct	9 ms	5120 KB	Output is correct
6	Correct	14 ms	5504 KB	Output is correct
7	Correct	32 ms	6528 KB	Output is correct
8	Correct	10 ms	5376 KB	Output is correct
9	Correct	259 ms	14712 KB	Output is correct
10	Correct	14 ms	5352 KB	Output is correct
11	Correct	11 ms	5376 KB	Output is correct
12	Correct	273 ms	15032 KB	Output is correct
13	Correct	214 ms	22904 KB	Output is correct
14	Correct	233 ms	19032 KB	Output is correct
15	Correct	229 ms	14968 KB	Output is correct
16	Correct	167 ms	22932 KB	Output is correct
17	Correct	255 ms	15036 KB	Output is correct
18	Correct	227 ms	17092 KB	Output is correct

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4992 KB	Output is correct
2	Correct	8 ms	4992 KB	Output is correct
3	Correct	9 ms	5044 KB	Output is correct
4	Correct	14 ms	5248 KB	Output is correct
5	Correct	9 ms	5120 KB	Output is correct
6	Correct	17 ms	5504 KB	Output is correct
7	Correct	38 ms	6528 KB	Output is correct
8	Correct	10 ms	5376 KB	Output is correct
9	Correct	252 ms	14820 KB	Output is correct
10	Correct	12 ms	5248 KB	Output is correct
11	Correct	14 ms	5376 KB	Output is correct
12	Correct	262 ms	14820 KB	Output is correct
13	Correct	176 ms	22900 KB	Output is correct
14	Correct	221 ms	19040 KB	Output is correct
15	Correct	249 ms	14968 KB	Output is correct
16	Correct	171 ms	22876 KB	Output is correct
17	Correct	253 ms	15124 KB	Output is correct
18	Correct	222 ms	17016 KB	Output is correct
19	Runtime error	16 ms	9960 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
20	Halted	0 ms	0 KB	-