fork download 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-10-22 08:51:09
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-10-22 11:03:28
  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)1e5+10;
  54. int n,m,len[N],cnt[N],q;
  55. vi vec[N],pos[N];
  56.  
  57. namespace hungeazy {
  58.  
  59. 	const int S = 350;
  60. 	int id[N],sum[400][400];
  61. 	/*
  62. 		gọi cnt[x] là số tập chứa thằng x
  63. 		nếu cnt[x] <= S -> duyệt + cnp trong O(S.log)
  64. 		nếu cnt[x] > S -> ko có căn thằng x 
  65. 		      xét các tập có vec[i] > S -> ko có quá căn tập như vậy -> duyệt + cnp trong O(căn.2.log) 
  66. 		      xét các tập có vec[i] <= S -> duyệt S^2 tính cống hiến cho tất cả cặp nặng -> O(N.S^2)
  67. 	*/
  68. 	void solve(void)
  69. 	{
  70. 		FOR(i,1,m) sort(all(vec[i]));
  71. 		FOR(i,1,n) sort(all(pos[i]));
  72. 		int dem = 0;
  73. 		FOR(i,1,n)
  74. 			if (cnt[i] > S) id[i] = ++dem;
  75. 		vi heavy;
  76. 		FOR(val,1,m)
  77. 			if (len[val] <= S)
  78. 			{
  79. 				vi cur;
  80. 				for (int x : vec[val])
  81. 					if (cnt[x] > S)
  82. 						cur.pb(id[x]);
  83. 				if (!cur.empty())
  84. 					FOR(i,0,sz(cur)-1)
  85. 						FOR(j,i+1,sz(cur)-1)
  86. 							sum[cur[i]][cur[j]] += val;
  87. 			}
  88. 			else heavy.pb(val);
  89. 		while (q--)
  90. 		{
  91. 			int x,y;
  92. 			cin >> x >> y;
  93. 			if (cnt[x] > cnt[y]) swap(x,y);
  94. 			if (cnt[x] <= S)
  95. 			{
  96. 				int ans = 0;
  97. 				for (int idx : pos[x])
  98. 				{
  99. 					int p = lower_bound(all(pos[y]),idx)-pos[y].begin();
  100. 					if (p < sz(pos[y]) and pos[y][p] == idx)
  101. 						ans += idx;
  102. 				}
  103. 				cout << ans << endl;
  104. 			}
  105. 			else 
  106. 			{
  107. 				if (x > y) swap(x,y);
  108. 				int ans = sum[id[x]][id[y]];
  109. 				for (int val : heavy)
  110. 				{
  111. 					int p1 = lower_bound(all(vec[val]),x)-vec[val].begin();
  112. 					if (p1 < sz(vec[val]) and vec[val][p1] == x)
  113. 					{
  114. 						int p2 = lower_bound(all(vec[val]),y)-vec[val].begin();
  115. 						if (p2 < sz(vec[val]) and vec[val][p2] == y)
  116. 							ans += val;
  117. 					}
  118. 				}
  119. 				cout << ans << endl;
  120. 			}
  121. 		}
  122. 	}
  123.  
  124. }
  125.  
  126. bool M2;
  127. signed main()
  128. {
  129.     fast;
  130.     if (fopen(name".inp","r"))
  131.     {
  132.     	freopen(name".inp","r",stdin);
  133.     	freopen(name".out","w",stdout);
  134.     }
  135.     cin >> n >> m;
  136.     FOR(i,1,m)
  137.     {
  138.     	cin >> len[i];
  139.     	FOR(j,1,len[i])
  140.     	{
  141.     		int x;
  142.     		cin >> x;
  143.     		vec[i].pb(x);
  144.     		pos[x].pb(i);
  145.     		cnt[x]++;
  146.     	}
  147.     }
  148.     cin >> q;
  149.     hungeazy::solve();
  150.     time();
  151.     memory();
  152.     return 0;
  153. }
  154. // ██░ ██  █    ██  ███▄    █   ▄████
  155. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  156. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  157. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  158. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  159. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  160. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  161. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  162. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 10028KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
stderr 
-------------Time:5.915ms.
8.08795 MB
https://ideone.com/JoP7hb
language:
C++14 (gcc 8.3)
created:
8 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!