# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129754 | 2019-07-13T07:22:03 Z | SamAnd | Senior Postmen (BOI14_postmen) | C++17 | 500 ms | 94176 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair const int N = 500005; int n, m; set<int> a[N]; vector<int> v; void dfs(int x) { while (1) { if (a[x].empty()) break; int h = *a[x].begin(); a[x].erase(h); a[h].erase(x); dfs(h); } v.push_back(x); } bool c[N]; int main() { scanf("%d%d", &n, &m); for (int i = 0; i < m; ++i) { int x, y; scanf("%d%d", &x, &y); a[x].insert(y); a[y].insert(x); } dfs(1); stack<int> s; for (int i = 0; i < v.size(); ++i) { if (c[v[i]]) { printf("%d ", v[i]); while (s.top() != v[i]) { printf("%d ", s.top()); c[s.top()] = false; s.pop(); } printf("\n"); } else { s.push(v[i]); c[v[i]] = true; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 23808 KB | Output is correct |
2 | Correct | 22 ms | 23808 KB | Output is correct |
3 | Correct | 19 ms | 23808 KB | Output is correct |
4 | Correct | 25 ms | 24192 KB | Output is correct |
5 | Correct | 23 ms | 23936 KB | Output is correct |
6 | Correct | 21 ms | 24448 KB | Output is correct |
7 | Correct | 32 ms | 25984 KB | Output is correct |
8 | Correct | 21 ms | 24168 KB | Output is correct |
9 | Correct | 194 ms | 37828 KB | Output is correct |
10 | Correct | 20 ms | 24220 KB | Output is correct |
11 | Correct | 19 ms | 24168 KB | Output is correct |
12 | Correct | 201 ms | 37884 KB | Output is correct |
# | 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 | 17 ms | 23808 KB | Output is correct |
4 | Correct | 20 ms | 24192 KB | Output is correct |
5 | Correct | 18 ms | 23936 KB | Output is correct |
6 | Correct | 21 ms | 24448 KB | Output is correct |
7 | Correct | 40 ms | 25856 KB | Output is correct |
8 | Correct | 25 ms | 24064 KB | Output is correct |
9 | Correct | 185 ms | 37856 KB | Output is correct |
10 | Correct | 25 ms | 24284 KB | Output is correct |
11 | Correct | 22 ms | 24064 KB | Output is correct |
12 | Correct | 175 ms | 37860 KB | Output is correct |
13 | Correct | 122 ms | 37964 KB | Output is correct |
14 | Correct | 146 ms | 37880 KB | Output is correct |
15 | Correct | 158 ms | 37860 KB | Output is correct |
16 | Correct | 122 ms | 37880 KB | Output is correct |
17 | Correct | 166 ms | 37856 KB | Output is correct |
18 | Correct | 140 ms | 35568 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 23808 KB | Output is correct |
2 | Correct | 17 ms | 23808 KB | Output is correct |
3 | Correct | 17 ms | 23808 KB | Output is correct |
4 | Correct | 24 ms | 24192 KB | Output is correct |
5 | Correct | 24 ms | 23936 KB | Output is correct |
6 | Correct | 20 ms | 24448 KB | Output is correct |
7 | Correct | 33 ms | 25984 KB | Output is correct |
8 | Correct | 23 ms | 24064 KB | Output is correct |
9 | Correct | 186 ms | 37880 KB | Output is correct |
10 | Correct | 21 ms | 24192 KB | Output is correct |
11 | Correct | 20 ms | 24064 KB | Output is correct |
12 | Correct | 175 ms | 37880 KB | Output is correct |
13 | Correct | 130 ms | 37880 KB | Output is correct |
14 | Correct | 131 ms | 37856 KB | Output is correct |
15 | Correct | 146 ms | 37880 KB | Output is correct |
16 | Correct | 124 ms | 37856 KB | Output is correct |
17 | Correct | 156 ms | 37844 KB | Output is correct |
18 | Correct | 147 ms | 35528 KB | Output is correct |
19 | Execution timed out | 653 ms | 94176 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |