oj.uz

Submission #31533

# Submission time Handle Problem Language Result Execution time Memory
31533 2017-08-29T07:35:53 Z minkank Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 61392 KB 
#include <iostream>
#include <set>
#include <stack>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
 
const int N = 5e5 + 5;
int n, m, st[N], p;
bool check[N], sax[N];
vector<int> s[N];
vector<ii> edge;
 
void dfs(int u) {
	while(s[u].size()) {
		int id = s[u].back(); s[u].pop_back();
		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) cout << st[p] << ' ', check[st[p]] = false, p--; p--;
		cout << u << '\n';		
	}
	check[u] = 1; ++p; st[p] = u;
}
 
int main() {
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= m; ++i) {
		int u, v;
		scanf("%d %d", &u, &v);
		s[u].push_back(edge.size()); s[v].push_back(edge.size());
		edge.push_back(ii(u, v));
	}
	dfs(1);
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:24:3: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   while(st[p] != u) cout << st[p] << ' ', check[st[p]] = false, p--; p--;
   ^~~~~
postmen.cpp:24:70: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   while(st[p] != u) cout << st[p] << ' ', check[st[p]] = false, p--; p--;
                                                                      ^
postmen.cpp: In function 'int main()':
postmen.cpp:31: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:34: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 13 ms 12028 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 13 ms 12136 KB Output is correct
4 Correct 15 ms 12392 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 19 ms 13184 KB Output is correct
8 Correct 12 ms 12320 KB Output is correct
9 Correct 63 ms 19076 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 65 ms 19220 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12128 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 13 ms 12416 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 18 ms 13240 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 56 ms 19028 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 67 ms 19180 KB Output is correct
13 Correct 101 ms 21840 KB Output is correct
14 Correct 101 ms 18540 KB Output is correct
15 Correct 100 ms 20820 KB Output is correct
16 Correct 112 ms 21844 KB Output is correct
17 Correct 127 ms 16300 KB Output is correct
18 Correct 127 ms 19544 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 13 ms 12160 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 14 ms 12288 KB Output is correct
5 Correct 18 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 18 ms 13184 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 62 ms 19008 KB Output is correct
10 Correct 13 ms 12336 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 64 ms 19220 KB Output is correct
13 Correct 100 ms 22064 KB Output is correct
14 Correct 100 ms 18572 KB Output is correct
15 Correct 95 ms 20808 KB Output is correct
16 Correct 107 ms 21860 KB Output is correct
17 Correct 115 ms 16336 KB Output is correct
18 Correct 107 ms 19668 KB Output is correct
19 Execution timed out 634 ms 61392 KB Time limit exceeded
20 Halted 0 ms 0 KB -