| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 44770 | RayaBurong25_1 | Potemkin cycle (CEOI15_indcyc) | C++17 | 1083 ms | 1560 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 <stdio.h>
#include <vector>
std::vector<int> AdjList[1005];
std::vector<int> Path;
std::vector<int> Ans;
int Vis[1005];
void dfs(int r, int u, int pa)
{
    Vis[u] = 1;
    Path.push_back(u);
    int i, v, s = AdjList[u].size();
    int ok = Path.size() >= 4, toRoot = 0;
    for (i = 0; i < s; i++)
    {
        v = AdjList[u][i];
        if (Vis[v] && v != pa)
        {
            if (v == r && Path.size() >= 4)
            {
                toRoot = 1;
                // Ans = Path;
            }
            else
            {
                ok = 0;
                Path.pop_back();
                Vis[u] = 0;
                return;
            }
        }
    }
    if (ok && toRoot)
        Ans = Path;
    for (i = 0; i < s; i++)
    {
        v = AdjList[u][i];
        if (!Vis[v])
        {
            dfs(r, v, u);
        }
    }
    Path.pop_back();
    Vis[u] = 0;
}
int main()
{
    int N, R;
    scanf("%d %d", &N, &R);
    int i, u, v;
    for (i = 0; i < R; i++)
    {
        scanf("%d %d", &u, &v);
        AdjList[u].push_back(v);
        AdjList[v].push_back(u);
    }
    for (i = 1; i <= N; i++)
    {
        dfs(i, i, 0);
    }
    if (Ans.size() > 0)
    {
        for (i = 0; i < Ans.size(); i++)
            printf("%d ", Ans[i]);
    }
    else
        printf("no");
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
