oj.uz

Submission #31531

# Submission time Handle Problem Language Result Execution time Memory
31531 2017-08-29T07:32:11 Z minkank Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 100216 KB 
#include <iostream>
#include <set>
#include <stack>
using namespace std;
 
const int N = 5e5 + 5;
int n, m, st[N], p;
bool check[N];
set<int> s[N];
 
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[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].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[p] != u) cout << st[p] << ' ', check[st[p]] = false, p--; p--;
   ^~~~~
postmen.cpp:18: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: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 18 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 21 ms 24320 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 20 ms 24460 KB Output is correct
7 Correct 32 ms 25984 KB Output is correct
8 Correct 20 ms 24192 KB Output is correct
9 Correct 176 ms 38264 KB Output is correct
10 Correct 21 ms 24192 KB Output is correct
11 Correct 25 ms 24064 KB Output is correct
12 Correct 201 ms 38444 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 16 ms 23860 KB Output is correct
3 Correct 17 ms 23784 KB Output is correct
4 Correct 26 ms 24320 KB Output is correct
5 Correct 24 ms 23936 KB Output is correct
6 Correct 20 ms 24448 KB Output is correct
7 Correct 46 ms 25976 KB Output is correct
8 Correct 25 ms 24064 KB Output is correct
9 Correct 206 ms 38264 KB Output is correct
10 Correct 22 ms 24320 KB Output is correct
11 Correct 22 ms 24132 KB Output is correct
12 Correct 179 ms 38332 KB Output is correct
13 Correct 124 ms 39008 KB Output is correct
14 Correct 141 ms 38752 KB Output is correct
15 Correct 161 ms 38372 KB Output is correct
16 Correct 122 ms 39008 KB Output is correct
17 Correct 149 ms 38560 KB Output is correct
18 Correct 138 ms 35064 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 18 ms 23808 KB Output is correct
3 Correct 21 ms 23808 KB Output is correct
4 Correct 20 ms 24192 KB Output is correct
5 Correct 23 ms 23936 KB Output is correct
6 Correct 22 ms 24424 KB Output is correct
7 Correct 35 ms 25984 KB Output is correct
8 Correct 19 ms 24064 KB Output is correct
9 Correct 177 ms 38240 KB Output is correct
10 Correct 22 ms 24192 KB Output is correct
11 Correct 21 ms 24064 KB Output is correct
12 Correct 168 ms 38412 KB Output is correct
13 Correct 121 ms 38988 KB Output is correct
14 Correct 157 ms 38688 KB Output is correct
15 Correct 158 ms 38368 KB Output is correct
16 Correct 127 ms 39004 KB Output is correct
17 Correct 163 ms 38484 KB Output is correct
18 Correct 151 ms 35152 KB Output is correct
19 Execution timed out 629 ms 100216 KB Time limit exceeded
20 Halted 0 ms 0 KB -