# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
103593 | 2019-03-31T19:15:50 Z | luciocf | 어르신 집배원 (BOI14_postmen) | C++14 | 500 ms | 13304 KB |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5+10; typedef pair<int, int> pii; bool markEdge[maxn], mark[maxn]; vector<pii> grafo[maxn]; stack<int> stk; void dfs(int u) { if (mark[u]) { while (true) { int v = stk.top(); stk.pop(); mark[v] = 0; if (v == u) { printf("%d\n", v); break; } printf("%d ", v); } } for (auto v: grafo[u]) { if (!markEdge[v.second]) { mark[u] = 1; stk.push(u); markEdge[v.second] = 1; dfs(v.first); } } } int main(void) { int n, m; scanf("%d %d", &n, &m); for (int i = 1; i <= m; i++) { int u, v; scanf("%d %d", &u, &v); grafo[u].push_back({v, i}); grafo[v].push_back({u, i}); } dfs(1); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 2688 KB | Output is correct |
2 | Correct | 7 ms | 2688 KB | Output is correct |
3 | Correct | 6 ms | 2688 KB | Output is correct |
4 | Correct | 12 ms | 2944 KB | Output is correct |
5 | Correct | 7 ms | 2816 KB | Output is correct |
6 | Correct | 10 ms | 3072 KB | Output is correct |
7 | Correct | 15 ms | 4096 KB | Output is correct |
8 | Correct | 9 ms | 2920 KB | Output is correct |
9 | Correct | 116 ms | 11436 KB | Output is correct |
10 | Correct | 7 ms | 2816 KB | Output is correct |
11 | Correct | 8 ms | 2944 KB | Output is correct |
12 | Correct | 68 ms | 11640 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 2688 KB | Output is correct |
2 | Correct | 6 ms | 2688 KB | Output is correct |
3 | Correct | 6 ms | 2688 KB | Output is correct |
4 | Correct | 12 ms | 2920 KB | Output is correct |
5 | Correct | 6 ms | 2816 KB | Output is correct |
6 | Correct | 8 ms | 3072 KB | Output is correct |
7 | Correct | 18 ms | 4072 KB | Output is correct |
8 | Correct | 7 ms | 2816 KB | Output is correct |
9 | Correct | 107 ms | 11288 KB | Output is correct |
10 | Correct | 7 ms | 2816 KB | Output is correct |
11 | Correct | 7 ms | 2944 KB | Output is correct |
12 | Correct | 98 ms | 11768 KB | Output is correct |
13 | Correct | 85 ms | 13304 KB | Output is correct |
14 | Correct | 85 ms | 9440 KB | Output is correct |
15 | Execution timed out | 1092 ms | 12224 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 2664 KB | Output is correct |
2 | Correct | 7 ms | 2688 KB | Output is correct |
3 | Correct | 7 ms | 2688 KB | Output is correct |
4 | Correct | 12 ms | 2944 KB | Output is correct |
5 | Correct | 6 ms | 2816 KB | Output is correct |
6 | Correct | 10 ms | 3072 KB | Output is correct |
7 | Correct | 16 ms | 4096 KB | Output is correct |
8 | Correct | 7 ms | 2816 KB | Output is correct |
9 | Correct | 108 ms | 11384 KB | Output is correct |
10 | Correct | 7 ms | 2816 KB | Output is correct |
11 | Correct | 10 ms | 2944 KB | Output is correct |
12 | Correct | 84 ms | 11640 KB | Output is correct |
13 | Correct | 99 ms | 13284 KB | Output is correct |
14 | Correct | 88 ms | 9440 KB | Output is correct |
15 | Execution timed out | 1083 ms | 12212 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |