首页 > 代码库 > poj 1182 并查集

poj 1182 并查集

2024-11-21 06:24:02   203人阅读

  1. #include <stdio.h>
  3. int father[50050];
  5. void initializtion(int n)
  6. {
  7. 	for(int i=0; i<=n+1; i++)
  8. 		father[i] = i;
  9. }
  11. bool find(int a, int b)
  12. {
  13. 	//int flag = 0;
  14. 	if(a==b)	return 0;
  15. 	else
  16. 	{
  17. 		int temp = a;
  18. 		if(temp == a && father[temp] == b)
  19. 			return 0;
  20. 		while(father[temp] != temp)
  21. 		{
  22. 			temp = father[temp];
  23. 			if(temp == b)	return 1;
  24. 			if(temp == a)	return 1;
  25. 		}
  26. 		return 0;
  27. 	}
  28. }
  30. void update(int a, int b)
  31. {
  32. 	int i = a;
  33. 	if(i == a && father[i] == b)
  34. 			return ;
  35. 	while(father[i] != i)
  36. 	{
  37. 		i = father[i];
  38. 		
  39. 	}
  40. 	father[i] = b;
  41. }
  43. int main()
  44. {
  45. 	int N, K;
  46. 	while(scanf("%d%d", &N, &K)!=EOF)
  47. 	{
  48. 		initializtion(N);
  49. 		int mistake = 0;
  50. 		int a, b, c;
  51. 		for(int i=0; i<K; i++)
  52. 		{
  53. 			scanf("%d%d%d", &a, &b, &c);
  54. 			if(b>N || c>N)
  55. 			{mistake++;		continue;}
  57. 			if(a==1)
  58. 			{
  59. 				if(find(b, c) )		mistake ++;
  60. 			}
  62. 			if(a==2)
  63. 			{
  64. 				if(b==c)	mistake++;
  65. 				else
  66. 				{
  67. 					if(find(b, c) )	mistake++;
  68. 					else update(b, c);
  69. 				}
  70. 			}
  71. 		}
  72. 		printf("%d\n", mistake);
  73. 	}
  74. 	return 0;
  75. }



来自为知笔记(Wiz)


附件列表

     

    poj 1182 并查集


    联系
    我们