oj.uz

Submission #52989

# Submission time Handle Problem Language Result Execution time Memory
52989 2018-06-27T13:23:47 Z Bruteforceman Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 53640 KB 
#include <bits/stdc++.h>
using namespace std;
#define prev dfsdf
vector <int> g[500010];
int l[500010], r[500010];
bool del[500010];
int tour[1000010];
bool occ[500010];
int cur;

void dfs(int x) {
	while (!g[x].empty()){
		int i = g[x].back();
		g[x].pop_back();
		if(del[i]) continue;
		del[i] = true;
		int y = l[i] ^ r[i] ^ x;
		dfs(y);
	}
	if(occ[x] == false) {
		occ[x] = true;
		tour[++cur] = x; 
	} else {
		while(tour[cur] != x) {
			int y = tour[cur--];
			occ[y] = false;
			printf("%d ", y);
		}
		printf("%d\n", x);
	}
}
int main (int argc, char const* argv[])
{
	int n, m;
	scanf("%d %d", &n, &m);
	for(int i = 0; i < m; i++) {
		int p, q;
		scanf("%d %d", &p, &q);
		l[i] = p;
		r[i] = q;
		g[p].push_back(i);
		g[q].push_back(i);
	}
	dfs(1);
	return 0;
}

Compilation message

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

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 21 ms 12160 KB Output is correct
6 Correct 16 ms 12392 KB Output is correct
7 Correct 19 ms 12928 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 55 ms 17456 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 67 ms 17732 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 13 ms 12136 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 14 ms 12208 KB Output is correct
6 Correct 17 ms 12288 KB Output is correct
7 Correct 19 ms 12928 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 62 ms 17436 KB Output is correct
10 Correct 17 ms 12228 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 72 ms 17644 KB Output is correct
13 Correct 130 ms 20344 KB Output is correct
14 Correct 105 ms 17824 KB Output is correct
15 Correct 110 ms 18968 KB Output is correct
16 Correct 109 ms 20316 KB Output is correct
17 Correct 102 ms 16120 KB Output is correct
18 Correct 118 ms 18424 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 18 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 24 ms 12928 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 82 ms 17512 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 67 ms 17744 KB Output is correct
13 Correct 94 ms 20292 KB Output is correct
14 Correct 98 ms 17760 KB Output is correct
15 Correct 99 ms 19000 KB Output is correct
16 Correct 100 ms 20376 KB Output is correct
17 Correct 103 ms 16276 KB Output is correct
18 Correct 124 ms 18452 KB Output is correct
19 Execution timed out 669 ms 53640 KB Time limit exceeded
20 Halted 0 ms 0 KB -