# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98422 | Kastanda | Senior Postmen (BOI14_postmen) | C++11 | 645 ms | 54684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m, cyc, from[N], to[N], M[N], S[N];
int cnt = 0;
vector < int > Adj[N];
void DFS(int v)
{
cnt ++;
assert(cnt <= m + n);
S[v] = 1;
while (Adj[v].size())
{
int id = Adj[v].back();
Adj[v].pop_back();
if (M[id]) continue;
M[id] = 1;
int u = from[id] ^ to[id] ^ v;
if (S[u])
{
cyc = u; S[v] = 0;
printf("%d", v);
return ;
}
DFS(u);
if (cyc)
printf(" %d", v);
if (cyc != v)
{
S[v] = 0;
return ;
}
else
cyc = 0, printf("\n");
}
S[v] = 0;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++)
{
scanf("%d%d", &from[i], &to[i]);
Adj[from[i]].push_back(i);
Adj[to[i]].push_back(i);
}
for (int i = 1; i <= n; i++)
if (Adj[i].size())
DFS(i);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |