oj.uz

Submission #25994

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

const int MAXN=500005;
bool vis[MAXN];
bool vs[MAXN];
vector<pair<int,int> >adj[MAXN];
int n,m;

int cyc=-1;

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

	while(!adj[x].empty())
	{
		int y=adj[x].back().first;
		int in=adj[x].back().second;
		if(vs[in])
		{
			adj[x].pop_back();
			continue;
		}
		adj[x].pop_back();
		vs[in]=true;
		if(vis[y])
		{
			printf("%d",x);
			cyc=y;
			break;
		}
		dfs(y);
		if(cyc!=-1)
		{
			printf(" %d",x);
			if(cyc==x)
			{
				printf("\n");
				cyc=-1;
			}
			else break;
		}
	}

	vis[x]=false;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		adj[x].push_back({y,i});
		adj[y].push_back({x,i});
	}
	
	for(int i=1;i<=n;i++)dfs(i);	
	return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
postmen.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 15 ms 12224 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 17 ms 12160 KB Output is correct
5 Correct 12 ms 12208 KB Output is correct
6 Correct 14 ms 12160 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 55 ms 14432 KB Output is correct
10 Correct 12 ms 12160 KB Output is correct
11 Correct 17 ms 12160 KB Output is correct
12 Correct 64 ms 14840 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 17 ms 12672 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 62 ms 14544 KB Output is correct
10 Correct 15 ms 12160 KB Output is correct
11 Correct 13 ms 12160 KB Output is correct
12 Correct 54 ms 14816 KB Output is correct
13 Correct 94 ms 20728 KB Output is correct
14 Correct 100 ms 15736 KB Output is correct
15 Correct 82 ms 15296 KB Output is correct
16 Correct 99 ms 20704 KB Output is correct
17 Correct 97 ms 15588 KB Output is correct
18 Correct 95 ms 16888 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 15 ms 12160 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 13 ms 12160 KB Output is correct
7 Correct 18 ms 12632 KB Output is correct
8 Correct 13 ms 12304 KB Output is correct
9 Correct 56 ms 14532 KB Output is correct
10 Correct 17 ms 12136 KB Output is correct
11 Correct 13 ms 12160 KB Output is correct
12 Correct 55 ms 14840 KB Output is correct
13 Correct 94 ms 20704 KB Output is correct
14 Correct 92 ms 15840 KB Output is correct
15 Correct 77 ms 15336 KB Output is correct
16 Correct 101 ms 20704 KB Output is correct
17 Correct 103 ms 15612 KB Output is correct
18 Correct 91 ms 16864 KB Output is correct
19 Execution timed out 564 ms 55520 KB Time limit exceeded
20 Halted 0 ms 0 KB -