#include <bits/stdc++.h>
#define gc getchar_unlocked
inline void scan(int &x){
register int c = gc();
x = 0;
for(;(c<48 || c>57);c = gc());
for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
}
using namespace std;
const int maxn = 5e5+10;
typedef pair<int, int> pii;
int stk[maxn], tt;
bool markEdge[maxn], mark[maxn];
vector<pii> grafo[maxn];
void dfs(int u)
{
if (mark[u])
{
while (true)
{
int v = stk[tt--];
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[++tt] = 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);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
12032 KB |
Output is correct |
2 |
Correct |
12 ms |
12032 KB |
Output is correct |
3 |
Correct |
12 ms |
12032 KB |
Output is correct |
4 |
Correct |
17 ms |
12288 KB |
Output is correct |
5 |
Correct |
14 ms |
12160 KB |
Output is correct |
6 |
Correct |
14 ms |
12416 KB |
Output is correct |
7 |
Correct |
25 ms |
13312 KB |
Output is correct |
8 |
Correct |
12 ms |
12288 KB |
Output is correct |
9 |
Correct |
81 ms |
19168 KB |
Output is correct |
10 |
Correct |
15 ms |
12288 KB |
Output is correct |
11 |
Correct |
12 ms |
12288 KB |
Output is correct |
12 |
Correct |
48 ms |
19576 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
12100 KB |
Output is correct |
2 |
Correct |
12 ms |
12136 KB |
Output is correct |
3 |
Correct |
12 ms |
12160 KB |
Output is correct |
4 |
Correct |
14 ms |
12288 KB |
Output is correct |
5 |
Correct |
13 ms |
12160 KB |
Output is correct |
6 |
Correct |
12 ms |
12416 KB |
Output is correct |
7 |
Correct |
16 ms |
13312 KB |
Output is correct |
8 |
Correct |
13 ms |
12288 KB |
Output is correct |
9 |
Correct |
97 ms |
19192 KB |
Output is correct |
10 |
Correct |
12 ms |
12288 KB |
Output is correct |
11 |
Correct |
12 ms |
12288 KB |
Output is correct |
12 |
Correct |
50 ms |
19576 KB |
Output is correct |
13 |
Correct |
73 ms |
21088 KB |
Output is correct |
14 |
Correct |
61 ms |
18032 KB |
Output is correct |
15 |
Execution timed out |
1067 ms |
20032 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
12160 KB |
Output is correct |
2 |
Correct |
11 ms |
12160 KB |
Output is correct |
3 |
Correct |
14 ms |
12136 KB |
Output is correct |
4 |
Correct |
14 ms |
12288 KB |
Output is correct |
5 |
Correct |
15 ms |
12160 KB |
Output is correct |
6 |
Correct |
13 ms |
12416 KB |
Output is correct |
7 |
Correct |
17 ms |
13252 KB |
Output is correct |
8 |
Correct |
14 ms |
12288 KB |
Output is correct |
9 |
Correct |
93 ms |
19128 KB |
Output is correct |
10 |
Correct |
17 ms |
12160 KB |
Output is correct |
11 |
Correct |
12 ms |
12288 KB |
Output is correct |
12 |
Correct |
47 ms |
19576 KB |
Output is correct |
13 |
Correct |
59 ms |
21136 KB |
Output is correct |
14 |
Correct |
72 ms |
18040 KB |
Output is correct |
15 |
Execution timed out |
1077 ms |
20064 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |