oj.uz

Submission #103591

# Submission time Handle Problem Language Result Execution time Memory
103591 2019-03-31T19:14:34 Z luciocf Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 22820 KB 
#include <bits/stdc++.h>
#define gc getchar

using namespace std;

const int maxn = 5e5+10;

typedef pair<int, int> pii;

bool markEdge[maxn], mark[maxn];

vector<pii> grafo[maxn];

vector<int> stk;

void dfs(int u)
{
	if (mark[u])
	{
		while (true)
		{
			int v = stk.back();
			stk.pop_back();

			mark[v] = 0;

			if (v == u)
			{
				printf("%d\n", v);
				break;
			}

			printf("%d ", v);
		}
	}

	for (auto v: grafo[u])
	{
		if (!markEdge[v.second])
		{
			mark[u] = 1;
			stk.push_back(u);
			markEdge[v.second] = 1;

			dfs(v.first);
		}
	}
}

int main(void)
{
	int n, m;
	scanf("%d %d", &n, &m);

	for (int i = 1; i <= m; i++)
	{
		int u, v;
		scanf("%d %d", &u, &v);

		grafo[u].push_back({v, i});
		grafo[v].push_back({u, i});
	}

	dfs(1);
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:53: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:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 15 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12544 KB Output is correct
7 Correct 20 ms 13568 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 109 ms 20728 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 71 ms 21112 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 15 ms 12032 KB Output is correct
4 Correct 15 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 17 ms 12520 KB Output is correct
7 Correct 19 ms 13460 KB Output is correct
8 Correct 17 ms 12288 KB Output is correct
9 Correct 98 ms 20728 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 78 ms 21156 KB Output is correct
13 Correct 93 ms 22820 KB Output is correct
14 Correct 109 ms 18892 KB Output is correct
15 Execution timed out 1088 ms 21576 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 15 ms 12160 KB Output is correct
4 Correct 19 ms 12392 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 23 ms 13568 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 108 ms 20684 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 80 ms 21088 KB Output is correct
13 Correct 94 ms 22752 KB Output is correct
14 Correct 101 ms 18808 KB Output is correct
15 Execution timed out 1097 ms 21556 KB Time limit exceeded
16 Halted 0 ms 0 KB -