oj.uz

Submission #25991

# Submission time Handle Problem Language Result Execution time Memory
25991 2017-06-25T15:49:48 Z H_H Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 113824 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=500005;
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 22 ms 23808 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 24 ms 24064 KB Output is correct
5 Correct 23 ms 23936 KB Output is correct
6 Correct 26 ms 24320 KB Output is correct
7 Correct 43 ms 25208 KB Output is correct
8 Correct 19 ms 24192 KB Output is correct
9 Correct 257 ms 33504 KB Output is correct
10 Correct 22 ms 24064 KB Output is correct
11 Correct 22 ms 24064 KB Output is correct
12 Correct 262 ms 33644 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 17 ms 23808 KB Output is correct
3 Correct 19 ms 23784 KB Output is correct
4 Correct 29 ms 24064 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 26 ms 24192 KB Output is correct
7 Correct 48 ms 25312 KB Output is correct
8 Correct 24 ms 24168 KB Output is correct
9 Correct 298 ms 33508 KB Output is correct
10 Correct 22 ms 24168 KB Output is correct
11 Correct 21 ms 24064 KB Output is correct
12 Correct 249 ms 33656 KB Output is correct
13 Correct 183 ms 41644 KB Output is correct
14 Correct 234 ms 37752 KB Output is correct
15 Correct 269 ms 33688 KB Output is correct
16 Correct 182 ms 41696 KB Output is correct
17 Correct 271 ms 33824 KB Output is correct
18 Correct 236 ms 35864 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 19 ms 23888 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 25 ms 24192 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 25 ms 24236 KB Output is correct
7 Correct 42 ms 25340 KB Output is correct
8 Correct 20 ms 24192 KB Output is correct
9 Correct 288 ms 33632 KB Output is correct
10 Correct 23 ms 24064 KB Output is correct
11 Correct 27 ms 24060 KB Output is correct
12 Correct 262 ms 33700 KB Output is correct
13 Correct 176 ms 41696 KB Output is correct
14 Correct 237 ms 37880 KB Output is correct
15 Correct 259 ms 33760 KB Output is correct
16 Correct 180 ms 41720 KB Output is correct
17 Correct 266 ms 33784 KB Output is correct
18 Correct 280 ms 35880 KB Output is correct
19 Execution timed out 943 ms 113824 KB Time limit exceeded
20 Halted 0 ms 0 KB -