# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
103589 | 2019-03-31T19:13:18 Z | luciocf | 어르신 집배원 (BOI14_postmen) | C++17 | 500 ms | 22772 KB |
#include <bits/stdc++.h> #define gc getchar using namespace std; const int maxn = 5e5+10; typedef pair<int, int> pii; bool markEdge[maxn], mark[maxn]; vector<pii> grafo[maxn]; vector<int> stk; void dfs(int u) { if (mark[u]) { while (true) { int v = stk.back(); stk.pop_back(); 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_back(u); markEdge[v.second] = 1; dfs(v.first); } } } inline int scan(void) { int n = 0, x = gc(), s =1; for (;x<'0'||x>'9';x=gc()) if(x=='-') s=-1; for (;x>='0'&&x<='9';x=gc()) n = (n<<3) + (n<<1) + x-'0'; return n; } int main(void) { int n, m; n = scan(), m = scan(); for (int i = 1; i <= m; i++) { int u, v; u = scan(), v = scan(); grafo[u].push_back({v, i}); grafo[v].push_back({u, i}); } dfs(1); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12032 KB | Output is correct |
2 | Correct | 12 ms | 12032 KB | Output is correct |
3 | Correct | 11 ms | 12032 KB | Output is correct |
4 | Correct | 14 ms | 12292 KB | Output is correct |
5 | Correct | 15 ms | 12148 KB | Output is correct |
6 | Correct | 14 ms | 12544 KB | Output is correct |
7 | Correct | 18 ms | 13568 KB | Output is correct |
8 | Correct | 13 ms | 12288 KB | Output is correct |
9 | Correct | 89 ms | 20728 KB | Output is correct |
10 | Correct | 13 ms | 12160 KB | Output is correct |
11 | Correct | 13 ms | 12340 KB | Output is correct |
12 | Correct | 54 ms | 21192 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 13 ms | 12032 KB | Output is correct |
4 | Correct | 14 ms | 12288 KB | Output is correct |
5 | Correct | 15 ms | 12160 KB | Output is correct |
6 | Correct | 16 ms | 12416 KB | Output is correct |
7 | Correct | 17 ms | 13568 KB | Output is correct |
8 | Correct | 12 ms | 12288 KB | Output is correct |
9 | Correct | 105 ms | 20720 KB | Output is correct |
10 | Correct | 16 ms | 12288 KB | Output is correct |
11 | Correct | 14 ms | 12288 KB | Output is correct |
12 | Correct | 57 ms | 21112 KB | Output is correct |
13 | Correct | 67 ms | 22772 KB | Output is correct |
14 | Correct | 84 ms | 18808 KB | Output is correct |
15 | Execution timed out | 1067 ms | 21648 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 12032 KB | Output is correct |
2 | Correct | 14 ms | 12032 KB | Output is correct |
3 | Correct | 12 ms | 12032 KB | Output is correct |
4 | Correct | 14 ms | 12416 KB | Output is correct |
5 | Correct | 15 ms | 12160 KB | Output is correct |
6 | Correct | 17 ms | 12544 KB | Output is correct |
7 | Correct | 18 ms | 13568 KB | Output is correct |
8 | Correct | 14 ms | 12336 KB | Output is correct |
9 | Correct | 101 ms | 20824 KB | Output is correct |
10 | Correct | 13 ms | 12288 KB | Output is correct |
11 | Correct | 12 ms | 12288 KB | Output is correct |
12 | Correct | 56 ms | 21112 KB | Output is correct |
13 | Correct | 80 ms | 22760 KB | Output is correct |
14 | Correct | 78 ms | 18824 KB | Output is correct |
15 | Execution timed out | 1073 ms | 21560 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |