oj.uz

Submission #1099020

# Submission time Handle Problem Language Result Execution time Memory
1099020 2024-10-10T12:18:26 Z nikolashami Pipes (CEOI15_pipes) C++17
100 / 100
 701 ms 7112 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(time(0));

const int mxN=1e5+2;
vector<int>adj[mxN];
int ln[mxN],dp[mxN],vv[mxN];

int finde(int&x){
	return x==ln[x]?x:ln[x]=finde(ln[x]);
}

void merge(int u,int v){
	ln[finde(u)]=finde(v);
}

void dfs(int&u,int&p){
	vv[u]=1;
	for(int&v:adj[u]){
		if(!(v^p))
			continue;
		dfs(v,u);
		dp[u]^=dp[v];
	}
}

void res(int&u,int&p){
	vv[u]=1;
	for(int&v:adj[u]){
		if(!(v^p))
			continue;
		res(v,u);
		if(!dp[v])
			cout<<u<<' '<<v<<'\n';
	}
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n,m;
    cin>>n>>m;

    iota(ln,ln+n+1,0);

    for(int i=0,u,v;i<m;++i){
    	cin>>u>>v;
    	if(finde(u)==finde(v)){
    		int xx=rng();
    		dp[u]^=xx;
    		dp[v]^=xx;
    	}else{
    		merge(u,v);
    		adj[u].push_back(v);
    		adj[v].push_back(u);
    	}
    }

    fill(vv,vv+n+1,0);
    for(int fi=1,u,p;fi<=n;++fi){
    	if(vv[fi])
    		continue;
    	u=fi,p=0;
    	dfs(u,p);
    }

    fill(vv,vv+n+1,0);
    for(int fi=1,u,p;fi<=n;++fi){
    	if(vv[fi])
    		continue;
    	u=fi,p=0;
    	res(u,p);
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 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 2908 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 3164 KB Output is correct
2 Correct 112 ms 3160 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 3932 KB Output is correct
2 Correct 135 ms 3868 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 5804 KB Output is correct
2 Correct 211 ms 5968 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 6220 KB Output is correct
2 Correct 365 ms 6224 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 6964 KB Output is correct
2 Correct 480 ms 7112 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 593 ms 6956 KB Output is correct
2 Correct 567 ms 6996 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 701 ms 6632 KB Output is correct
2 Correct 659 ms 6908 KB Output is correct