oj.uz

Submission #151886

# Submission time Handle Problem Language Result Execution time Memory
151886 2019-09-05T09:57:53 Z Kamisama Computer Network (BOI14_network) C++14
100 / 100
 122 ms 8048 KB 
#include <cstdio>
#include <vector>
#include "network.h"
using namespace std;
const int maxn=1e3+7;

vector<int> disList[maxn],path;

void findRoute(int n, int a, int b){
  int pathLength=ping(a,b);
  for(int i=1;i<=n;i++) if(i!=a && i!=b) disList[ping(a,i)].push_back(i);
  path.push_back(b);
  for(pathLength--;pathLength>=0;pathLength--){
    for(int c: disList[pathLength]) if(!ping(c,b)){
      b=c;
      path.push_back(b);
      break;
    }
  }
  for(int i=(int)path.size()-1;i>=0;i--) travelTo(path[i]);
}

Compilation message

grader.c: In function 'int main()':
grader.c:48:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d%d%d%d", &N, &a, &b, &M);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.c:51:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &distance[u][v]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 4344 KB Output is correct
2 Correct 113 ms 4320 KB Output is correct
3 Correct 101 ms 4216 KB Output is correct
4 Correct 100 ms 4212 KB Output is correct
5 Correct 99 ms 4412 KB Output is correct
6 Correct 99 ms 4292 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4256 KB Output is correct
2 Correct 26 ms 2340 KB Output is correct
3 Correct 117 ms 4316 KB Output is correct
4 Correct 90 ms 4236 KB Output is correct
5 Correct 116 ms 4336 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4216 KB Output is correct
2 Correct 26 ms 2324 KB Output is correct
3 Correct 118 ms 4272 KB Output is correct
4 Correct 89 ms 4216 KB Output is correct
5 Correct 116 ms 4268 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4312 KB Output is correct
2 Correct 27 ms 3020 KB Output is correct
3 Correct 118 ms 7928 KB Output is correct
4 Correct 90 ms 6264 KB Output is correct
5 Correct 117 ms 8048 KB Output is correct