#include <bits/stdc++.h>
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
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;
scan(n); scan(m);
for (int i = 1; i <= m; i++)
{
int u, v;
scan(u); scan(v);
grafo[u].push_back({v, i});
grafo[v].push_back({u, i});
}
dfs(1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
2688 KB |
Output is correct |
2 |
Correct |
6 ms |
2688 KB |
Output is correct |
3 |
Correct |
8 ms |
2688 KB |
Output is correct |
4 |
Correct |
8 ms |
2944 KB |
Output is correct |
5 |
Correct |
7 ms |
2792 KB |
Output is correct |
6 |
Correct |
7 ms |
3072 KB |
Output is correct |
7 |
Correct |
12 ms |
4096 KB |
Output is correct |
8 |
Correct |
6 ms |
2816 KB |
Output is correct |
9 |
Correct |
86 ms |
11320 KB |
Output is correct |
10 |
Correct |
7 ms |
2816 KB |
Output is correct |
11 |
Correct |
7 ms |
2944 KB |
Output is correct |
12 |
Correct |
53 ms |
11692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
2688 KB |
Output is correct |
2 |
Correct |
6 ms |
2688 KB |
Output is correct |
3 |
Correct |
7 ms |
2688 KB |
Output is correct |
4 |
Correct |
11 ms |
2944 KB |
Output is correct |
5 |
Correct |
7 ms |
2816 KB |
Output is correct |
6 |
Correct |
7 ms |
3072 KB |
Output is correct |
7 |
Correct |
12 ms |
4096 KB |
Output is correct |
8 |
Correct |
8 ms |
2816 KB |
Output is correct |
9 |
Correct |
109 ms |
11384 KB |
Output is correct |
10 |
Correct |
7 ms |
2816 KB |
Output is correct |
11 |
Correct |
7 ms |
2944 KB |
Output is correct |
12 |
Correct |
51 ms |
11768 KB |
Output is correct |
13 |
Correct |
69 ms |
13304 KB |
Output is correct |
14 |
Correct |
63 ms |
9440 KB |
Output is correct |
15 |
Execution timed out |
1078 ms |
12156 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
2688 KB |
Output is correct |
2 |
Correct |
6 ms |
2720 KB |
Output is correct |
3 |
Correct |
6 ms |
2688 KB |
Output is correct |
4 |
Correct |
10 ms |
2944 KB |
Output is correct |
5 |
Correct |
7 ms |
2816 KB |
Output is correct |
6 |
Correct |
9 ms |
3072 KB |
Output is correct |
7 |
Correct |
13 ms |
4172 KB |
Output is correct |
8 |
Correct |
7 ms |
2816 KB |
Output is correct |
9 |
Correct |
82 ms |
11276 KB |
Output is correct |
10 |
Correct |
7 ms |
2868 KB |
Output is correct |
11 |
Correct |
7 ms |
2944 KB |
Output is correct |
12 |
Correct |
54 ms |
11640 KB |
Output is correct |
13 |
Correct |
66 ms |
13304 KB |
Output is correct |
14 |
Correct |
64 ms |
9464 KB |
Output is correct |
15 |
Execution timed out |
1061 ms |
12156 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |