# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
543920 | 2022-03-31T15:32:34 Z | Olympia | 어르신 집배원 (BOI14_postmen) | C++17 | 500 ms | 16800 KB |
#include <vector> #include <algorithm> #include <iostream> #include <set> #include <cmath> #include <map> #include <random> #include <cassert> #include <ctime> #include <stack> #include <cstdlib> #include <queue> #include <cstdio> #include <limits.h> using namespace std; vector<pair<int,int>> adj[(int)5e5]; bool hasVisited[(int)5e5]; bool okay[(int)5e5]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int N, M; scanf("%d%d", &N, &M); for (int i = 0; i < M; i++) { int u, v; scanf("%d%d", &u, &v); u--, v--; adj[u].emplace_back(v, i), adj[v].emplace_back(u, i); } for (int i = 0; i < M; i++) { okay[i] = true; } stack<pair<int,int>> nodes; for (int i = 0; i < N; i++) { nodes.push({i, -1}); while (!nodes.empty()) { int cur = nodes.top().first; int prev = nodes.top().second; okay[prev] = false; hasVisited[cur] = true; bool upd = false; for (pair<int,int> &pr: adj[cur]) { int j = pr.first; if (pr.second == prev || !okay[pr.second]) { continue; } okay[pr.second] = false; if (hasVisited[j]) { while (!nodes.empty() && nodes.top().first != j) { hasVisited[nodes.top().first] = false; printf("%d ", nodes.top().first + 1); nodes.pop(); } printf("%d\n", j + 1); } else { nodes.emplace(j, pr.second); } upd = true; break; } if (!upd) { nodes.pop(); } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 11988 KB | Output is correct |
2 | Correct | 6 ms | 11988 KB | Output is correct |
3 | Correct | 6 ms | 11988 KB | Output is correct |
4 | Correct | 8 ms | 12172 KB | Output is correct |
5 | Correct | 6 ms | 12116 KB | Output is correct |
6 | Correct | 8 ms | 12236 KB | Output is correct |
7 | Correct | 12 ms | 12568 KB | Output is correct |
8 | Correct | 7 ms | 12116 KB | Output is correct |
9 | Correct | 59 ms | 14484 KB | Output is correct |
10 | Correct | 8 ms | 12116 KB | Output is correct |
11 | Correct | 9 ms | 12116 KB | Output is correct |
12 | Correct | 47 ms | 14780 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 11988 KB | Output is correct |
2 | Correct | 6 ms | 11988 KB | Output is correct |
3 | Correct | 7 ms | 11988 KB | Output is correct |
4 | Correct | 8 ms | 12116 KB | Output is correct |
5 | Correct | 7 ms | 12116 KB | Output is correct |
6 | Correct | 8 ms | 12188 KB | Output is correct |
7 | Correct | 12 ms | 12528 KB | Output is correct |
8 | Correct | 7 ms | 12116 KB | Output is correct |
9 | Correct | 58 ms | 14456 KB | Output is correct |
10 | Correct | 8 ms | 12116 KB | Output is correct |
11 | Correct | 8 ms | 12116 KB | Output is correct |
12 | Correct | 45 ms | 14796 KB | Output is correct |
13 | Correct | 60 ms | 16716 KB | Output is correct |
14 | Correct | 57 ms | 15596 KB | Output is correct |
15 | Execution timed out | 818 ms | 15236 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 11964 KB | Output is correct |
2 | Correct | 6 ms | 11988 KB | Output is correct |
3 | Correct | 6 ms | 11988 KB | Output is correct |
4 | Correct | 8 ms | 12116 KB | Output is correct |
5 | Correct | 7 ms | 12116 KB | Output is correct |
6 | Correct | 8 ms | 12116 KB | Output is correct |
7 | Correct | 13 ms | 12628 KB | Output is correct |
8 | Correct | 7 ms | 12116 KB | Output is correct |
9 | Correct | 60 ms | 14516 KB | Output is correct |
10 | Correct | 8 ms | 12176 KB | Output is correct |
11 | Correct | 7 ms | 12116 KB | Output is correct |
12 | Correct | 44 ms | 14792 KB | Output is correct |
13 | Correct | 67 ms | 16800 KB | Output is correct |
14 | Correct | 51 ms | 15564 KB | Output is correct |
15 | Execution timed out | 829 ms | 15312 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |