oj.uz

Submission #103592

# Submission time Handle Problem Language Result Execution time Memory
103592 2019-03-31T19:15:08 Z luciocf Senior Postmen (BOI14_postmen) C++17
38 / 100
 500 ms 13428 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+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:52: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:57: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 7 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 10 ms 2944 KB Output is correct
5 Correct 6 ms 2816 KB Output is correct
6 Correct 10 ms 3072 KB Output is correct
7 Correct 15 ms 4096 KB Output is correct
8 Correct 8 ms 2944 KB Output is correct
9 Correct 106 ms 11360 KB Output is correct
10 Correct 7 ms 2816 KB Output is correct
11 Correct 7 ms 2920 KB Output is correct
12 Correct 73 ms 11640 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 9 ms 2944 KB Output is correct
5 Correct 6 ms 2816 KB Output is correct
6 Correct 11 ms 3072 KB Output is correct
7 Correct 14 ms 4096 KB Output is correct
8 Correct 10 ms 2868 KB Output is correct
9 Correct 115 ms 11336 KB Output is correct
10 Correct 9 ms 2816 KB Output is correct
11 Correct 9 ms 2944 KB Output is correct
12 Correct 69 ms 11636 KB Output is correct
13 Correct 93 ms 13428 KB Output is correct
14 Correct 84 ms 9464 KB Output is correct
15 Execution timed out 1095 ms 12156 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 7 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 12 ms 2944 KB Output is correct
5 Correct 7 ms 2816 KB Output is correct
6 Correct 10 ms 3072 KB Output is correct
7 Correct 15 ms 4096 KB Output is correct
8 Correct 7 ms 2944 KB Output is correct
9 Correct 96 ms 11384 KB Output is correct
10 Correct 8 ms 2816 KB Output is correct
11 Correct 8 ms 2928 KB Output is correct
12 Correct 78 ms 11640 KB Output is correct
13 Correct 83 ms 13356 KB Output is correct
14 Correct 77 ms 9440 KB Output is correct
15 Execution timed out 1097 ms 12244 KB Time limit exceeded
16 Halted 0 ms 0 KB -