oj.uz

Submission #541644

# Submission time Handle Problem Language Result Execution time Memory
541644 2022-03-24T00:19:23 Z rainliofficial Potemkin cycle (CEOI15_indcyc) C++17
70 / 100
 611 ms 59136 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define f first
#define s second

struct edge{
    int from, to;
};

const int MAXN = 1005, MAXR = 2e5+5;
edge allEdges[MAXR];
vector<int> edgeGraph[MAXR], cycle;
int connected[MAXN][MAXN];
bool vis[MAXN][MAXN], on_stack[MAXR], vis2[MAXR];
// int vis2[MAXR];
int n, r;

void dfs(int at, int pv){
    vis[at][pv] = true; 
    // connect all possible edges
    for (int i=0; i<n; i++){
        if (pv != n && i != at && i != pv && connected[at][i] && !connected[i][pv]){
            assert(connected[pv][at] != 0);
            edgeGraph[connected[pv][at]].push_back(connected[at][i]);
        }
    }
    for (int i=0; i<n; i++){
        if (connected[at][i] && !vis[i][at]){
            dfs(i, at);
        }
    }
}

bool dfs2(int n) {
	vis2[n] = on_stack[n] = true;
	for (int u : edgeGraph[n]) {
		if(on_stack[u]) {
			cycle.push_back(n); // start cycle
			on_stack[n] = on_stack[u] = false;
			return true;
		}else if(!vis2[u]) {
			if(dfs2(u)) { // continue cycle
				if(on_stack[n]) {
					cycle.push_back(n);
					on_stack[n] = false;
					return true;
				} else { // found u again
					cycle.push_back(n);
					return false;
				}
			}
			if(!cycle.empty()) // finished with cycle
				return false;
		}
	}
	on_stack[n] = false;
	return false;
}
int main(){
    cin.tie(0); ios_base::sync_with_stdio(0);
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    cin >> n >> r;
    for (int i=0; i<r; i++){
        int a, b;
        cin >> a >> b;
        a--; b--;
        allEdges[2*i+1] = {a, b};
        allEdges[2*i+2] = {b, a};
        connected[a][b] = 2*i+1;
        connected[b][a] = 2*i+2;
    }
    dfs(0, n);
    dfs2(1);
    if (cycle.empty()) dfs2(2);
    if (cycle.empty()){
        cout << "no" << "\n";
        return 0;
    }
    reverse(cycle.begin(), cycle.end());
    vector<int> ans;
    for (int i=0; i<sz(cycle)-1; i++){
        if (i == 0){
            cout << allEdges[cycle[i]].from+1 << " ";
        }
        cout << allEdges[cycle[i]].to+1 << " ";
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 5588 KB Wrong adjacency
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5844 KB Output is correct
2 Correct 5 ms 5972 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 7396 KB Output is correct
2 Correct 12 ms 7380 KB Output is correct
3 Correct 28 ms 9912 KB Output is correct
4 Correct 37 ms 9828 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8604 KB Output is correct
2 Correct 21 ms 8768 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 35844 KB Output is correct
2 Correct 180 ms 17480 KB Output is correct
3 Correct 568 ms 36380 KB Output is correct
4 Correct 178 ms 17144 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 291 ms 59136 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 342 ms 30160 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -