fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. typedef long long int64;
  6.  
  7. int graph[12][12];
  8. int n, resp = 0;
  9. int i = 0, j = 0, k = 0;
  10.  
  11. void nothing(){
  12. }
  13.  
  14. void loop() {
  15.     jmp_buf env;
  16.  
  17.     setjmp(env);
  18.  
  19.     cin >> graph[i][j];
  20.     i = ((j+1 == n) ? i+1 : i);
  21.     j = ((j+1 == n) ? 0 : j+1);
  22.     return ((i == n && j == 0) ? nothing() : longjmp(env, 0));  
  23. }
  24.  
  25.  
  26. void loop2() {
  27.     jmp_buf env;
  28.  
  29.     setjmp(env);
  30.  
  31.     resp = max(resp, graph[i][j]);
  32.     i = ((j+1 == n) ? i+1 : i);
  33.     j = ((j+1 == n) ? 0 : j+1);
  34.  
  35.     return ((i == n && j == 0) ? nothing() : longjmp(env, 0));  
  36. }
  37.  
  38. void warshall(){
  39.     jmp_buf env;
  40.  
  41.     setjmp(env);
  42.  
  43.     graph[i][j] = ((graph[i][j] > graph[i][k] + graph[k][j]) ? graph[i][k] + graph[k][j] : graph[i][j]);
  44.     i = ((j+1 == n) ? i+1 : i);
  45.     k = ((i == n) ? k+1 : k);
  46.     i = ((i == n) ? 0 : i);
  47.     j = ((j+1 == n) ? 0 : j+1);
  48.  
  49.     return ((k == n && i == 0) ? nothing() : longjmp(env, 0));
  50. }
  51.  
  52.  
  53. int main(){
  54.     ios::sync_with_stdio(false);
  55.     cin >> n;
  56.     loop();
  57.     i = 0, j = 0;
  58.     warshall();
  59.     i = 0, j = 0;
  60.     loop2();
  61.     cout << resp << endl;
  62.  
  63.     return 0;
  64. }
Time limit exceeded #stdin #stdout 5s 3452KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/gdN17g
language:
C++14 (gcc 8.3)
created:
8 years 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!