oj.uz

Submission #1034760

# Submission time Handle Problem Language Result Execution time Memory
1034760 2024-07-25T17:33:03 Z vjudge1 Pipes (CEOI15_pipes) C++17
40 / 100
 208 ms 23120 KB 
    #include <iostream>
    #include <vector>
    using namespace std;
     
    const int N = 7e4+2;
    struct dsu {
    	int e[N];
    	int find(int &x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
    	bool join(int a, int b) {
    		a = find(a), b = find(b);
    		if (a == b) return false;
    		if (e[a] > e[b]) swap(a, b);
    		e[a] += e[b]; e[b] = a;
    		return true;
    	}
    } d1, d2;
    vector<int> g[N];
    int timer=0;
    void dfs(int &at, int &par) {
    	d1.e[at]=d2.e[at]=++timer;
    	for(int &to:g[at]) {
    		if(to == par) {
    			par+=N;
    			continue;
    		}
    		if(d2.e[to]) {
    			d1.e[at]=min(d1.e[at], d2.e[to]);		
    		} else {
    			dfs(to, at);
    			d1.e[at]=min(d1.e[at], d1.e[to]);
    		}
    	}
    	if(par>N)par-=N;
    	if(d1.e[at] == d2.e[at] and at!=par) {
    		cout << at << " " << par << "\n";
    	}
    }
    int main() {
    	cin.tie(0)->sync_with_stdio(0);
    	cin.exceptions(cin.failbit);
    	int n, m;
    	cin >> n >> m;
    	int u, v;
    	for(int i = 1;i<N;i++)d1.e[i]=d2.e[i]=-1;
    	for(int i = 0;i<m;i++) {
    		cin >> u >> v;
    		if(d1.join(u, v) || d2.join(u, v)) {
    			g[u].push_back(v);
    			g[v].push_back(u);
    		}
    	}
    	for(int i = 1;i<N;i++)d1.e[i]=d2.e[i]=0;
    	for(int i= 1;i<=n;i++) {
    		if(!d1.e[i]) {
    			dfs(i, i);
    		}
    	}
    }

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2900 KB Output is correct
2 Correct 53 ms 2776 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 3272 KB Output is correct
2 Correct 106 ms 2904 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 4296 KB Output is correct
2 Runtime error 140 ms 17652 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 8020 KB Output is correct
2 Runtime error 196 ms 23120 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 4956 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 4956 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 4956 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 4952 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -