fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-10-19 22:13:27
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2026-03-05 21:51:32
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name ""
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)2e5+10;
  54. int n,q;
  55.  
  56. namespace hungeazy {
  57.  
  58. 	struct DSU {
  59. 		int par[N],sz[N],color[N];
  60.  
  61. 		void init() {
  62. 			FOR(i,1,n) par[i] = i;
  63. 		}
  64.  
  65. 		ii acs(int u) 
  66. 		{
  67. 			if (par[u] == u) return {u,0};
  68. 			ii x = acs(par[u]);
  69. 			par[u] = x.fi;
  70. 			color[u] ^= x.se;
  71. 			return {par[u],color[u]};
  72. 		}
  73.  
  74. 		void join(int u, int v, int val)
  75. 		{
  76. 			ii x = acs(u), y = acs(v);
  77. 			if (x.fi != y.fi)
  78. 			{
  79. 				if (sz[x.fi] < sz[y.fi]) swap(x,y);
  80. 				par[y.fi] = x.fi;
  81. 				color[y.fi] = x.se^y.se^val;
  82. 				sz[x.fi] += sz[y.fi];
  83. 			}
  84. 		}
  85.  
  86. 		int get(int u, int v)
  87. 		{
  88. 			ii x = acs(u), y = acs(v);
  89. 			if (x.fi != y.fi) return -1;
  90. 			return x.se^y.se;
  91. 		}
  92. 	} dsu;
  93.  
  94. 	void solve(void)
  95. 	{
  96. 		dsu.init();
  97. 		while (q--)
  98. 		{
  99. 			int type,x,y;
  100. 			cin >> type >> x >> y;
  101. 			if (!type) dsu.join(x,y,0);
  102. 			else if (type == 1) dsu.join(x,y,1);
  103. 			else cout << dsu.get(x,y) << endl;
  104. 		}
  105. 	}
  106.  
  107. }
  108.  
  109. bool M2;
  110. signed main()
  111. {
  112.     fast;
  113.     if (fopen(name".inp","r"))
  114.     {
  115.     	freopen(name".inp","r",stdin);
  116.     	freopen(name".out","w",stdout);
  117.     }
  118.     cin >> n >> q;
  119.     hungeazy::solve();
  120.     time();
  121.     memory();
  122.     return 0;
  123. }
  124. // ██░ ██  █    ██  ███▄    █   ▄████
  125. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  126. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  127. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  128. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  129. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  130. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  131. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  132. // ░  ░  ░   ░              ░       ░
  133.  
Success #stdin #stdout #stderr 0.01s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:5.969ms.
4.57791 MB
https://ideone.com/srTOcG
language:
C++14 (gcc 8.3)
created:
1 day 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!