oj.uz

Submission #53897

# Submission time Handle Problem Language Result Execution time Memory
53897 2018-07-01T16:00:22 Z paulica Potemkin cycle (CEOI15_indcyc) C++14
90 / 100
 97 ms 6220 KB 
#include <bits/stdc++.h>
using namespace std;

#define _ << " _ " <<
#define TRACE(x) cout << #x << " = " << x << endl

#define fi first
#define se second
typedef pair<int, int> pii;

const int MaxN = 1010, MaxR = 1e5 + 10;
int n, r;

vector<pii> e[MaxN];
bool con[MaxN][MaxN];

pii edg[MaxR];
bool vis[MaxR], stk[MaxR];

//int pre[MaxR];
vector<int> path;

void dfs(int x, int y, int id) {
    vis[id] = true;
    stk[id] = true;
    path.push_back(y);

    for (pii z : e[y]) {
        if (!con[x][z.fi] && z.fi != x) {
            if (!vis[z.se]) {
                //pre[z.se] = id;
                dfs(y, z.fi, z.se);
            } else if (stk[z.se]) {
                vector<int> cyc;
              //  TRACE("Yay");

                int pos[MaxN];
                for (int i = 0; i < MaxN; i++) pos[i] = -1;
                for (int i = path.size() - 1; i >= 0; i--) {
                    if (pos[path[i]] != -1) {
                     //   TRACE(pos[path[i]] _ i);
//                        copy(path.begin() + pos[path[i]], path.begin() + i, cyc.begin());
                        //cyc = vector(path.begin() + pos[path[i]], path.begin() + i);
                        for (int j = pos[path[i]]; j > i; j--) cyc.push_back(path[j]);
                        break;
                    }
                    pos[path[i]] = i;
                }
                //for (int i : cyc) TRACE(i);
                //exit(0);
                for (int i = 0; i + 1 < cyc.size(); i++) 
                    assert(con[cyc[i]][cyc[i+1]]);
                assert(con[cyc[0]][cyc.back()]);
//                exit(0);
                
                int m = cyc.size();
                for (int len = 3; len < m; len++)
                    for (int i = 0; i < m; i++) {
                        if (con[cyc[i]][cyc[(i + len) % m]]) {
                            for (int j = (i + 1) % m; j != i; j = (j + 1) % m)
                                cout << cyc[j] << " ";
                            cout << cyc[i];

                            exit(0);                
                        }
                    }
            }
        }
    }

    stk[id] = false;
    path.pop_back();
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> r;
    
    for (int i = 0; i < r; i++) {
        int x, y;
        cin >> x >> y;
        
        e[x].push_back({y, i});
        e[y].push_back({x, i});

        con[x][y] = con[y][x] = true;

        edg[i] = {x, y};
    }

    for (int i = 0; i < r; i++) {
        if (!vis[i]) {
            path.push_back(edg[i].fi);
            dfs(edg[i].fi, edg[i].se, i);
            path.pop_back();
        }
    }

    cout << "no";

    return 0;
}

Compilation message

indcyc.cpp: In function 'void dfs(int, int, int)':
indcyc.cpp:51:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int i = 0; i + 1 < cyc.size(); i++) 
                                 ~~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 540 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 3 ms 724 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1132 KB Output is correct
2 Correct 5 ms 1132 KB Output is correct
3 Correct 4 ms 1260 KB Output is correct
4 Correct 5 ms 1644 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1644 KB Output is correct
2 Correct 3 ms 1644 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3180 KB Output is correct
2 Incorrect 10 ms 3180 KB Wrong adjacency
3 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3180 KB Output is correct
2 Correct 12 ms 3180 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3948 KB Output is correct
2 Correct 97 ms 3948 KB Output is correct
3 Correct 20 ms 3948 KB Output is correct
4 Correct 34 ms 6220 KB Output is correct