oj.uz

Submission #31525

# Submission time Handle Problem Language Result Execution time Memory
31525 2017-08-29T07:27:19 Z minkank Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 115340 KB 
#include <iostream>
#include <set>
#include <stack>
using namespace std;
 
const int N = 5e5 + 5;
int n, m, check[N];
set<int> s[N];
stack<int> st;
 
void dfs(int u) {
	while(s[u].size()) {
		int v = *s[u].begin();
		s[u].erase(v); s[v].erase(u);
		dfs(v);
	}
	if(check[u]) {
		while(st.top() != u) cout << st.top() << ' ', check[st.top()] = false, st.pop(); st.pop();
		cout << u << '\n';		
	}
	check[u] = 1; st.push(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].insert(v); s[v].insert(u);
	}
	dfs(1);
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:18:3: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   while(st.top() != u) cout << st.top() << ' ', check[st.top()] = false, st.pop(); st.pop();
   ^~~~~
postmen.cpp:18:84: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   while(st.top() != u) cout << st.top() << ' ', check[st.top()] = false, st.pop(); st.pop();
                                                                                    ^~
postmen.cpp: In function 'int main()':
postmen.cpp:25: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:28: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 19 ms 23808 KB Output is correct
2 Correct 22 ms 23808 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 23 ms 24320 KB Output is correct
5 Correct 21 ms 24028 KB Output is correct
6 Correct 21 ms 24576 KB Output is correct
7 Correct 40 ms 26464 KB Output is correct
8 Correct 20 ms 24192 KB Output is correct
9 Correct 198 ms 41340 KB Output is correct
10 Correct 24 ms 24296 KB Output is correct
11 Correct 25 ms 24192 KB Output is correct
12 Correct 190 ms 41516 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 23808 KB Output is correct
2 Correct 22 ms 23808 KB Output is correct
3 Correct 29 ms 23808 KB Output is correct
4 Correct 25 ms 24320 KB Output is correct
5 Correct 25 ms 23936 KB Output is correct
6 Correct 22 ms 24576 KB Output is correct
7 Correct 46 ms 26360 KB Output is correct
8 Correct 21 ms 24228 KB Output is correct
9 Correct 200 ms 41396 KB Output is correct
10 Correct 21 ms 24320 KB Output is correct
11 Correct 22 ms 24088 KB Output is correct
12 Correct 198 ms 41428 KB Output is correct
13 Correct 137 ms 42032 KB Output is correct
14 Correct 168 ms 41912 KB Output is correct
15 Correct 166 ms 41720 KB Output is correct
16 Correct 146 ms 42076 KB Output is correct
17 Correct 169 ms 41880 KB Output is correct
18 Correct 152 ms 36124 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 17 ms 23808 KB Output is correct
4 Correct 21 ms 24320 KB Output is correct
5 Correct 19 ms 24076 KB Output is correct
6 Correct 25 ms 24576 KB Output is correct
7 Correct 34 ms 26368 KB Output is correct
8 Correct 18 ms 24244 KB Output is correct
9 Correct 212 ms 41336 KB Output is correct
10 Correct 24 ms 24320 KB Output is correct
11 Correct 23 ms 24064 KB Output is correct
12 Correct 193 ms 41460 KB Output is correct
13 Correct 153 ms 42092 KB Output is correct
14 Correct 158 ms 41964 KB Output is correct
15 Correct 163 ms 41796 KB Output is correct
16 Correct 137 ms 42024 KB Output is correct
17 Correct 161 ms 41848 KB Output is correct
18 Correct 146 ms 36064 KB Output is correct
19 Execution timed out 631 ms 115340 KB Time limit exceeded
20 Halted 0 ms 0 KB -