fork download
copy 
  1. #include <iostream>
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. class DSU
  6. {
  7. 	public:
  8. 	vector<int> size;
  9. 	vector<int> parent;
  10.  
  11. 	DSU (int n)
  12. 	{
  13. 		size.resize(n+1);
  14. 		parent.resize(n+1);
  15. 		for(int i=0;i<n;i++)
  16. 		{
  17. 			parent[i]=i;
  18. 			size[i]=1;
  19. 		}
  20. 	}
  21.  
  22. 	int findParent(int x)
  23. 	{
  24. 		if(x==parent[x])
  25. 		return x;
  26. 		else
  27. 		{
  28. 			parent[x]= findParent(parent[x]);
  29. 			return parent[x];
  30. 		}
  31. 	}
  32. 	void unionBySize(int x,int y)
  33. 	{
  34. 		int parentX = parent[x];
  35. 		int parentY = parent[y];
  36. 		if(parentX==parentY)
  37. 		return;
  38. 		if(size[parentX]>size[parentY])
  39. 		{
  40. 			size[parentX]+= size[parentY];
  41. 			parent[parentY] = parentX;
  42. 		}
  43. 		else
  44. 		{
  45. 				size[parentY]+= size[parentX];
  46. 			parent[parentX] = parentY;
  47. 		}
  48. 	}
  49.  
  50.  
  51. };
  52.  
  53. int maxWeightInGraph(int thershold,vector<vector<int>> edges,int n)
  54. {
  55. 	sort(edges.begin(),edges.end(),[](const vector<int> & a,const vector<int> & b){return a[2]<b[2];});
  56. }
  57.  
  58. int main() {
  59. 	// your code goes here
  60. 	return 0;
  61. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/R83VKh
language:
C++ (gcc 8.3)
created:
10 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!