oj.uz

Submission #527436

# Submission time Handle Problem Language Result Execution time Memory
527436 2022-02-17T12:23:50 Z maomao90 Potemkin cycle (CEOI15_indcyc) C++17
100 / 100
 349 ms 94020 KB 
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < k; i++)
#define RREP(i, j, k) for (int i = j; i >= k; i--)

template<class T>
inline bool mxto(T &a, T b) {return a < b ? a = b, 1 : 0;}
template<class T>
inline bool mnto(T &a, T b) {return a > b ? a = b, 1 : 0;}

typedef long long ll;
#define FI first
#define SE second
#define MP make_pair
typedef pair<int, int> ii;
#define pb push_back
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<ii> vii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

#define INF 1000000005
#define LINF 1000000000000000005ll
#define MAXN 1005
#define MAXR 200005

int n, r;
vi adj[MAXN], nadj[MAXR];
int grid[MAXN][MAXN];
ii eg[MAXR];
int vis[MAXR];
int p[MAXR];

bool done;
void dfs(int u) {
    vi togo;
    vis[u] = 2;
    for (int v : nadj[u]) {
        if (!vis[v]) {
            togo.pb(v);
        } else if (vis[v] == 2) {
            vi tans;
            tans.pb(v);
            while (u != v) {
                assert(u != -1);
                tans.pb(u);
                u = p[u];
            }
            vi ans;
            ans.pb(eg[tans[0]].SE);
            ans.pb(eg[tans[0]].FI);
            REP (i, 1, tans.size() - 1) {
                auto [a, b] = eg[tans[i]];
                assert(a != ans.back());
                assert(grid[ans.back()][a] != -1);
                ans.pb(a);
            }
            REP (i, 0, ans.size()) {
                assert(grid[ans[i]][ans[(i + 1) % ans.size()]] != -1);
            }
            assert(eg[tans.back()] == MP(ans[0], ans.back()));
            for (int i : ans) {
                cout << i << ' ';
            }
            cout << '\n';
            done = 1;
            return;
        }
    }
    for (int v : togo) {
        if (vis[v]) continue;
        p[v] = u;
        dfs(v);
        if (done) {
            return;
        }
    }
    vis[u] = 1;
}

int main() {
#ifdef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> r;
    memset(grid, -1, sizeof grid);
    REP (i, 0, r) {
        int a, b; cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
        grid[a][b] = i;
        grid[b][a] = i + r;
        eg[i] = MP(a, b);
        eg[i + r] = MP(b, a);
    }
    REP (i, 0, 2 * r) {
        auto [a, b] = eg[i];
        REP (j, 1, n + 1) {
            if (j == a) continue;
            if (grid[b][j] == -1) continue;
            if (grid[a][j] != -1) continue;
            nadj[i].pb(grid[b][j]);
            cerr << i << " --- " << grid[b][j] << '\n';
        }
    }
    REP (i, 0, 2 * r) {
        if (vis[i]) continue;
        p[i] = -1;
        dfs(i);
        if (done) {
            return 0;
        }
    }
    cout << "no\n";
}

/*
8 12
1 2
2 3
1 3
2 4
4 5
2 5
5 6
5 7
6 7
3 6
6 8
8 3
*/

Compilation message

indcyc.cpp: In function 'void dfs(int)':
indcyc.cpp:4:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define REP(i, j, k) for (int i = j; i < k; i++)
......
   56 |             REP (i, 1, tans.size() - 1) {
      |                  ~~~~~~~~~~~~~~~~~~~~~  
indcyc.cpp:56:13: note: in expansion of macro 'REP'
   56 |             REP (i, 1, tans.size() - 1) {
      |             ^~~
indcyc.cpp:4:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define REP(i, j, k) for (int i = j; i < k; i++)
......
   62 |             REP (i, 0, ans.size()) {
      |                  ~~~~~~~~~~~~~~~~       
indcyc.cpp:62:13: note: in expansion of macro 'REP'
   62 |             REP (i, 0, ans.size()) {
      |             ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8908 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8908 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9168 KB Output is correct
2 Correct 6 ms 9292 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 9332 KB Output is correct
2 Correct 10 ms 9292 KB Output is correct
3 Correct 16 ms 11316 KB Output is correct
4 Correct 17 ms 11336 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10576 KB Output is correct
2 Correct 11 ms 10672 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 25776 KB Output is correct
2 Correct 87 ms 12560 KB Output is correct
3 Correct 218 ms 25728 KB Output is correct
4 Correct 81 ms 12768 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 54016 KB Output is correct
2 Correct 112 ms 58180 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 11948 KB Output is correct
2 Correct 150 ms 12892 KB Output is correct
3 Correct 332 ms 93464 KB Output is correct
4 Correct 349 ms 94020 KB Output is correct