?
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged | |
---|---|---|---|---|---|---|---|---|---|
234767419 |
Practice: your_submissions_ |
263D - 19 | C++20 (GCC 11-64) | Accepted | 342 ms | 12092 KB | 2023-11-28 17:26:06 | 2023-11-28 17:26:06 |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, m, k, c, num, t[N]; vector<int> e[N]; void dfs(int u){ t[u] = ++c; int p = u; for(auto v : e[u]){ if(t[v] < t[p]) p = v; } if(!t[p]) dfs(p); else{ printf("%d\n", c - t[p] + 1); num = t[p]; } if(t[u] >= num) printf("%d ", u); } int main(){ scanf("%d%d%d", &n, &m, &k); while(m--){ int u, v; scanf("%d%d", &u, &v); e[u].emplace_back(v); e[v].emplace_back(u); } dfs(1); return 0; }
?
?
?
?