fork download
  1. #pragma GCC optimize("O3")
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. #define name "aaaaaa"
  5. #define endl "\n"
  6. #define fi first
  7. #define se second
  8. using ll = long long;
  9. using ull = unsigned ll;
  10. using db = double;
  11. using ld = long double;
  12. using pii = pair<int, int>;
  13. using pll = pair<ll, ll>;
  14. using pdb = pair<db, db>;
  15. using ppii = pair<ll, pii>;
  16. using vvi = vector<vector<int>>;
  17.  
  18. void file(){
  19. ios_base::sync_with_stdio(0); cin.tie(0);
  20. if(fopen(name".inp", "r")) {
  21. freopen(name".inp", "r", stdin);
  22. freopen(name".out", "w", stdout);
  23. }
  24. }
  25.  
  26. const int N = 105;
  27. const int inf = 1e9;
  28.  
  29. int d[N][N];
  30.  
  31. void solve(){
  32. int n, m;
  33. cin >> n >> m;
  34. for(int i = 0; i < N; i++){
  35. for(int j = 0; j < N; j++){
  36. d[i][j] = inf;
  37. }
  38. }
  39. while(m--){
  40. int u, v, w; cin >> u >> v >> w;
  41. d[u][v] = d[v][u] = w;
  42. }
  43. for(int i = 1; i <= n; i++){
  44. for(int k = 1; k <= n; k++){
  45. for(int j = 1; j <= n; j++){
  46. if(i == 3 && j == 4 && k == 5)
  47. {
  48. cout<<"gay";
  49. cout<<d[i][k]<<" "<<d[k][j]<<'\n';
  50. }
  51. d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
  52. }
  53. }
  54. }
  55. }
  56.  
  57. int main(){
  58. file();
  59. int test = 1;
  60. //cin >> test;
  61. while(test--){
  62. solve();
  63. }
  64. cerr << "\nProcess returned 0 (0x0) execution time : " << 1.0*clock()/CLOCKS_PER_SEC << " s" << endl;
  65. }
Success #stdin #stdout #stderr 0s 5316KB
stdin
5 6
1 5 2
2 1 6
3 4 2
4 2 9
5 3 7
2 3 4
stdout
gay7 1000000000
stderr
Process returned 0 (0x0)   execution time :  0.004287 s