fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-12-05 15:05:13
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-12-05 16:07:46
  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 1e9
  46. #define name "TROCHOIHH"
  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)1e3+10;
  54. int n,m,k;
  55. vii g[N];
  56. vi flower[N];
  57.  
  58. namespace sub2 {
  59.  
  60. 	int d[N][2][MASK(10)],bit[N],dist[N][MASK(10)];
  61.  
  62. 	bool approved() {
  63. 		return k <= 2;
  64. 	}
  65.  
  66. 	void Dijkstra(int p, bool type)
  67. 	{
  68. 		FOR(i,1,n) 
  69. 			FOR(j,0,MASK(k)-1)
  70. 				d[i][type][j] = oo;
  71. 		priority_queue<array<int,3>,vector<array<int,3>>,greater<array<int,3>>> q;
  72. 		d[p][type][bit[p]] = 0;
  73. 		q.push({0,p,bit[p]});
  74. 		while (!q.empty())
  75. 		{
  76. 			auto [cost,u,mask] = q.top();
  77. 			q.pop();
  78. 			if (cost > d[u][type][mask]) continue;
  79. 			for (auto [v,w] : g[u])
  80. 			{
  81. 				int newMask = mask | bit[v];
  82. 				if (minimize(d[v][type][newMask],d[u][type][mask]+w))
  83. 					q.push({d[v][type][newMask],v,newMask});
  84. 			}
  85. 		}
  86. 	}
  87.  
  88. 	void solve(void)
  89. 	{
  90. 		FOR(i,1,n)
  91. 			for (int x : flower[i]) bit[i] |= MASK(x-1);
  92. 		Dijkstra(1,0); Dijkstra(n,1);
  93. 		fill(dist,0x3f);
  94. 		FOR(i,1,n)
  95. 			FOR(pre,0,MASK(k)-1)
  96. 				FOR(cur,0,MASK(k)-1)
  97. 					minimize(dist[i][(pre|cur)],d[i][0][pre]+d[i][1][cur]);
  98. 		int ans = oo;
  99. 		FOR(i,1,n)
  100. 			FOR(pre,0,MASK(k)-1)
  101. 				FOR(cur,0,MASK(k)-1)
  102. 					if ((pre|cur) == MASK(k)-1)
  103. 						minimize(ans,max(dist[i][pre],dist[i][cur]));
  104. 		cout << ans;
  105. 	}
  106.  
  107. }
  108.  
  109. namespace sub3 {
  110.  
  111. 	int d[N][2][MASK(10)],bit[N],best[N][MASK(10)];
  112.  
  113. 	void Dijkstra(int p, bool type)
  114. 	{
  115. 		FOR(i,1,n) 
  116. 			FOR(j,0,MASK(k)-1)
  117. 				d[i][type][j] = oo;
  118. 		priority_queue<array<int,3>,vector<array<int,3>>,greater<array<int,3>>> q;
  119. 		d[p][type][bit[p]] = 0;
  120. 		q.push({0,p,bit[p]});
  121. 		while (!q.empty())
  122. 		{
  123. 			auto [cost,u,mask] = q.top();
  124. 			q.pop();
  125. 			if (cost > d[u][type][mask]) continue;
  126. 			for (auto [v,w] : g[u])
  127. 			{
  128. 				int newMask = mask | bit[v];
  129. 				if (minimize(d[v][type][newMask],d[u][type][mask]+w))
  130. 					q.push({d[v][type][newMask],v,newMask});
  131. 			}
  132. 		}
  133. 	}
  134.  
  135. 	void solve(void)
  136. 	{
  137. 		FOR(i,1,n)
  138. 			for (int x : flower[i]) bit[i] |= MASK(x-1);
  139. 		Dijkstra(1,0); Dijkstra(n,1);
  140. 		int ans = oo;
  141. 		FOR(i,1,n)
  142. 		{
  143. 			FOR(mask,0,MASK(k)-1) 
  144. 				best[i][mask] = d[i][1][mask];
  145. 			FOR(j,0,k-1)
  146. 				FOR(mask,0,MASK(k)-1)
  147. 					if (!BIT(mask,j))
  148. 						minimize(best[i][mask],best[i][mask | MASK(j)]);
  149. 			FOR(mask,0,MASK(k)-1)
  150. 			{
  151. 				int x = d[i][0][mask], y = best[i][(MASK(k)-1)^mask];
  152. 				if (x != oo and y != oo)
  153. 					minimize(ans,x+y);
  154. 			}
  155. 			FOR(mask,0,MASK(k)-1)
  156. 				best[i][mask] = d[i][0][mask];
  157. 			FOR(j,0,k-1)
  158. 				FOR(mask,0,MASK(k)-1)
  159. 					if (!BIT(mask,j))
  160. 						minimize(best[i][mask],best[i][mask | MASK(j)]);
  161. 			FOR(mask,0,MASK(k)-1)
  162. 			{
  163. 				int x = d[i][1][mask], y = best[i][(MASK(k)-1)^mask];
  164. 				if (x != oo and y != oo)
  165. 					minimize(ans,x+y);
  166. 			}
  167. 		}
  168. 		cout << ans;
  169. 	}
  170.  
  171. }
  172.  
  173. bool M2;
  174. signed main()
  175. {
  176.     fast;
  177.     if (fopen(name".inp","r"))
  178.     {
  179.     	freopen(name".inp","r",stdin);
  180.     	freopen(name".out","w",stdout);
  181.     }
  182.     cin >> n >> m >> k;
  183.     FOR(i,1,n)
  184.     {
  185.     	int len;
  186.     	cin >> len;
  187.     	FOR(j,1,len)
  188.     	{
  189.     		int x;
  190.     		cin >> x;
  191.     		flower[i].pb(x);
  192.     	}
  193.     }
  194.     FOR(i,1,m)
  195.     {
  196.     	int u,v,w;
  197.     	cin >> u >> v >> w;
  198.     	g[u].pb({v,w}); g[v].pb({u,w});
  199.     }
  200.     if (sub2::approved()) return sub2::solve(), time(), memory(), 0;
  201.     sub3::solve();
  202.     time();
  203.     memory();
  204.     return 0;
  205. }
  206. // ██░ ██  █    ██  ███▄    █   ▄████
  207. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  208. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  209. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  210. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  211. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  212. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  213. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  214. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 10044KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1000000000
stderr
copy 
-------------Time:5.525ms.
23.7259 MB
https://ideone.com/w8uLjT
language:
C++14 (gcc 8.3)
created:
2 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!