fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2026-03-06 21:16:57
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2026-03-06 21:45:34
  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 "DICHUYEN"
  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 = 71;
  54. int n,m,val[N][N],k,q,INF;
  55.  
  56. struct Query {
  57. 	int c,d;
  58. 	void input() {
  59. 		cin >> c >> d;
  60. 	}
  61. } query[sqr(N)];
  62.  
  63. namespace sub1 {
  64.  
  65. 	bool approved() {
  66. 		return k == 1;
  67. 	}
  68.  
  69. 	void solve(void)
  70. 	{
  71. 		FOR(i,1,q)
  72. 		{
  73. 			int c = query[i].c, d = query[i].d;
  74. 			cout << (val[c][d] != INF ? val[c][d] : -1) << endl;
  75. 		}
  76. 	}
  77.  
  78. }
  79.  
  80. namespace sub3 {
  81.  
  82. 	int dist[N][N][N];
  83.  
  84. 	/*
  85. 		-> Chuẩn bị trước mảng lưu đường đi ngắn nhất từ c -> d với k tuyến 
  86. 		-> Gọi mảng dist[i][j][u]: đường đi ngắn nhất từ i -> j và đã sử dụng u tuyến
  87. 	*/
  88.  
  89. 	void Dijkstra(int p)
  90. 	{
  91. 		FOR(i,1,n) 
  92. 			FOR(j,0,k) dist[p][i][j] = oo;
  93. 		dist[p][p][0] = 0;
  94. 		priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<tuple<int,int,int>>> q;
  95. 		q.push({0,p,0});
  96. 		while (!q.empty())
  97. 		{
  98. 			auto [cost,u,cnt] = q.top();
  99. 			q.pop();
  100. 			if (cnt == k or cost > dist[p][u][cnt]) continue;
  101. 			FOR(v,1,n)
  102. 				if (minimize(dist[p][v][cnt+1],dist[p][u][cnt]+val[u][v]))
  103. 					q.push({dist[p][v][cnt+1],v,cnt+1}); 
  104. 		}
  105. 	}
  106.  
  107. 	void solve(void)
  108. 	{
  109. 		minimize(k,n);
  110. 		FOR(i,1,n) Dijkstra(i);
  111. 		FOR(i,1,q)
  112. 		{
  113. 			int c = query[i].c, d = query[i].d;
  114. 			cout << (dist[c][d][k] == oo ? -1 : dist[c][d][k]) << endl;
  115. 		}
  116. 	}
  117.  
  118. }
  119.  
  120. bool M2;
  121. signed main()
  122. {
  123.     fast;
  124.     if (fopen(name".inp","r"))
  125.     {
  126.     	freopen(name".inp","r",stdin);
  127.     	freopen(name".out","w",stdout);
  128.     }
  129.     cin >> n >> m;
  130.     fill(val,0x3f);
  131.     INF = val[0][0];
  132.     FOR(i,1,n) val[i][i] = 0;
  133.     FOR(i,1,m)
  134.     {
  135.     	int u,v,w;
  136.     	cin >> u >> v >> w;
  137.     	minimize(val[u][v],w);
  138.     }
  139.     cin >> k >> q;
  140.     FOR(i,1,q) query[i].input();
  141.     if (sub1::approved()) return sub1::solve(), time(), memory(), 0;
  142.     sub3::solve();
  143.     time();
  144.     memory();
  145.     return 0;
  146. }
  147. // ██░ ██  █    ██  ███▄    █   ▄████
  148. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  149. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  150. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  151. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  152. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  153. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  154. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  155. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 5284KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:6.084ms.
2.84612 MB
https://ideone.com/XqWVfl
language:
C++14 (gcc 8.3)
created:
13 hours 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!