oj.uz

Submission #96862

# Submission time Handle Problem Language Result Execution time Memory
96862 2019-02-12T14:09:10 Z Retro3014 Pipes (CEOI15_pipes) C++17
90 / 100
 5000 ms 15092 KB 
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;
#define MAX_N 100000
#define LN 17
typedef long long ll;
typedef pair<int, int> pii;

int N, M;
vector<pii > gp[MAX_N+1];
int num[MAX_N+1];
int p[MAX_N+1][LN];
int up[MAX_N+1];
int lv[MAX_N+1];
bool vst[MAX_N+1];


int find_g(int x){
	for(int i=LN-1; i>=0; i--){
		if(p[x][i]!=0){
			x = p[x][i];
		}
	}
	return x;
}

pii edge[MAX_N+1];
bool chk[MAX_N+1];
int sz = 0;

int lca(int x, int y){
	for(int i=LN-1; i>=0; i--){
		//cout<<i<<' '<<x<<' '<<y<<endl;
		if(lv[p[x][i]]>=lv[y]){
			x = p[x][i];
		}
		if(lv[p[y][i]]>=lv[x]){
			y = p[y][i];
		}
	}
	for(int i=LN-1; i>=0; i--){
		if(p[x][i]!=p[y][i]){
			x = p[x][i]; y = p[y][i];
		}
	}
	if(x!=y)	x = p[x][0];
	return x;
}

void dfs(int x){
	for(int i=0; i<gp[x].size(); i++){
		if(gp[x][i].first==p[x][0])	continue;
		dfs(gp[x][i].first);
		if(up[gp[x][i].first]<=lv[x])	chk[gp[x][i].second] = false;
		up[x] = min(up[x], up[gp[x][i].first]);
	}
}

void init_graph(int x){
	up[x] = lv[x];
	for(int i=1; i<LN; i++)	p[x][i] = p[p[x][i-1]][i-1];
	for(int i=0; i<gp[x].size(); i++){
		if(gp[x][i].first==p[x][0])	continue;
		lv[gp[x][i].first] = lv[x]+1;
		p[gp[x][i].first][0] = x;
		init_graph(gp[x][i].first);
	}
}



int main(){
	scanf("%d%d", &N, &M);
	for(int i=1; i<=N; i++)	num[i] = 1;
	int a, b, k, tmp, t;
	int A, B;
	for(int i=1; i<=N; i++){
		lv[i] = up[i] = 1;
	}
	while(M--){
		scanf("%d%d", &a, &b);
		A = a; B = b;
		for(int i=LN-1; i>=0; i--){
			if(p[A][i]!=0)	A = p[A][i];
			if(p[B][i]!=0)	B = p[B][i];
		}
		if(A==B){
			//cout<<'*'<<a<<' '<<b<<endl;
			A = a; B = b;
			for(int i=LN-1; i>=0; i--){
				if(lv[p[A][i]]>=lv[B]){
					A = p[A][i];
				}
				if(lv[p[B][i]]>=lv[A]){
					B = p[B][i];
				}
			}
			for(int i=LN-1; i>=0; i--){
				if(p[A][i]!=p[B][i]){
					A = p[A][i]; B = p[B][i];
				}
			}
			if(A!=B)	A = p[B][0];
			k = A;
			//cout<<k<<endl;
			up[a] = min(up[a], lv[k]);
			up[b] = min(up[b], lv[k]);
		}else{
			if(num[A]>=num[B]){
				tmp = a; a = b; b = tmp;
				tmp = A; A = B; B = tmp;
			}
			t = num[A];
			dfs(A);
			for(int i=1; i<LN; i++){
				p[a][i] = 0;
			}p[a][0] = b;
			lv[a] = lv[b]+1;
			//printf("%d %d\n", a, b);
			gp[a].push_back({b, sz});
			gp[b].push_back({a, sz});
			init_graph(a);
			edge[sz] = {a, b};
			chk[sz] = true;
			sz++;
			num[B] += t;
		}
	}
	for(int i=1; i<=N; i++){
		int k = find_g(i);
		if(!vst[k]){
			vst[k] = true;
			dfs(k);
		}
	}
	for(int i=0; i<sz; i++){
		if(chk[i]){
			printf("%d %d\n", edge[i].first, edge[i].second);
		}
	}
	return 0;
}

Compilation message

pipes.cpp: In function 'void dfs(int)':
pipes.cpp:54:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<gp[x].size(); i++){
               ~^~~~~~~~~~~~~
pipes.cpp: In function 'void init_graph(int)':
pipes.cpp:65:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<gp[x].size(); i++){
               ~^~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 3072 KB Output is correct
2 Correct 249 ms 3192 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 3916 KB Output is correct
2 Correct 593 ms 3892 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 839 ms 5648 KB Output is correct
2 Correct 786 ms 6400 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1635 ms 11420 KB Output is correct
2 Correct 1628 ms 11432 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2290 ms 12620 KB Output is correct
2 Correct 2027 ms 12308 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3536 ms 14904 KB Output is correct
2 Correct 3540 ms 15092 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4409 ms 14896 KB Output is correct
2 Correct 4371 ms 15056 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5032 ms 14204 KB Time limit exceeded
2 Halted 0 ms 0 KB -