oj.uz

Submission #49491

# Submission time Handle Problem Language Result Execution time Memory
49491 2018-05-29T16:27:11 Z minkank Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 55624 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef pair<int, int> ii;
 
const int N = 5e5 + 5;
int n, m, st[N], p, ptr[N];
bool check[N], sax[N];
vector<int> s[N];
vector<ii> edge;
 
void dfs(int u) {
	while(ptr[u] >= 0) {
		int id = s[u][ptr[u]]; ptr[u]--;
		if(sax[id]) continue;
		sax[id] = true;
		int v; if(edge[id].first == u) v = edge[id].second; else v = edge[id].first;
		dfs(v);
	}
	if(check[u]) {
		while(st[p] != u) printf("%d ", st[p]), check[st[p]] = false, p--; p--;
		printf("%d\n", u);		
	}
	check[u] = 1; ++p; st[p] = u;
}
 
void get(int &x) {
	x = 0;
	char c = getchar();
	while(c > '9' || c < '0') c = getchar();
	while(c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
}
 
int main() {
	get(n); get(m);
	for(int i = 1; i <= m; ++i) {
		int u, v;
		get(u); get(v);
		s[u].push_back(edge.size()); s[v].push_back(edge.size());
		edge.push_back(ii(u, v));
	}
	for(int i = 1; i <= n; ++i) ptr[i] = s[i].size() - 1;
	dfs(1);
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:21:3: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   while(st[p] != u) printf("%d ", st[p]), check[st[p]] = false, p--; p--;
   ^~~~~
postmen.cpp:21:70: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   while(st[p] != u) printf("%d ", st[p]), check[st[p]] = false, p--; p--;
                                                                      ^

Subtask #1
38.0 / 38.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 12 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 16 ms 12416 KB Output is correct
7 Correct 16 ms 12968 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 45 ms 17516 KB Output is correct
10 Correct 13 ms 12212 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 50 ms 17772 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 13 ms 12160 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 21 ms 13032 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 42 ms 17440 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 50 ms 17644 KB Output is correct
13 Correct 84 ms 20712 KB Output is correct
14 Correct 80 ms 18024 KB Output is correct
15 Correct 90 ms 19536 KB Output is correct
16 Correct 103 ms 20716 KB Output is correct
17 Correct 92 ms 16488 KB Output is correct
18 Correct 92 ms 18664 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 12160 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 18 ms 12416 KB Output is correct
7 Correct 18 ms 12928 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 46 ms 17512 KB Output is correct
10 Correct 13 ms 12264 KB Output is correct
11 Correct 14 ms 12416 KB Output is correct
12 Correct 46 ms 17644 KB Output is correct
13 Correct 88 ms 20692 KB Output is correct
14 Correct 83 ms 18008 KB Output is correct
15 Correct 74 ms 19508 KB Output is correct
16 Correct 94 ms 20768 KB Output is correct
17 Correct 89 ms 16488 KB Output is correct
18 Correct 71 ms 18668 KB Output is correct
19 Execution timed out 534 ms 55624 KB Time limit exceeded
20 Halted 0 ms 0 KB -