fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. #define int long long
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "dichuyen"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 1e5 + 5;
  38. int n, m, q;
  39. int dist[55][55], d[55][55], g[55][55], ans[N];
  40. vector<array<int, 3>> query[200];
  41.  
  42. void init(void) {
  43.     cin >> n >> m >> q;
  44.     memset(dist, 0x3f, sizeof dist);
  45.     FOR(i, 1, n) dist[i][i] = 0;
  46.     FOR(T, 1, m) {
  47.         FOR(i, 1, n) FOR(j, 1, n) cin >> d[i][j];
  48.         FOR(k, 1, n) FOR(u, 1, n) FOR(v, 1, n)
  49.             minimize(d[u][v], d[u][k] + d[k][v]);
  50.         FOR(i, 1, n) FOR(j, 1, n) minimize(dist[i][j], d[i][j]);
  51.     }
  52. }
  53.  
  54. void process(void) {
  55.     FOR(i, 1, q) {
  56.         int x, y, k;
  57.         cin >> x >> y >> k;
  58.         query[min(k, n)].pb({x, y, i});
  59.     }
  60.  
  61.     FOR(i, 1, n) FOR(j, 1, n) d[i][j] = dist[i][j];
  62.     FOR(T, 0, n) {
  63.         for(auto x : query[T])
  64.             ans[x[2]] = dist[x[0]][x[1]];
  65.         memset(g, 0x3f, sizeof g);
  66.         FOR(k, 1, n) FOR(u, 1, n) FOR(v, 1, n)
  67.             minimize(g[u][v], dist[u][k] + d[k][v]);
  68.         FOR(i, 1, n) FOR(j, 1, n) dist[i][j] = g[i][j];
  69.     }
  70.     FOR(i, 1, q) cout << ans[i] << '\n';
  71. }
  72.  
  73. signed main() {
  74.     ios_base::sync_with_stdio(0);
  75.     cin.tie(0); cout.tie(0);
  76.     if (fopen(task".inp", "r")) {
  77.         freopen(task".inp", "r", stdin);
  78.         freopen(task".out", "w", stdout);
  79.     }
  80.     int tc = 1;
  81. //    cin >> tc;
  82.     while(tc--) {
  83.         init();
  84.         process();
  85.     }
  86.     return 0;
  87. }
  88.  
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/cD72zI
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!