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