oj.uz

Submission #47318

# Submission time Handle Problem Language Result Execution time Memory
47318 2018-04-30T13:43:04 Z rajarshi_basu Computer Network (BOI14_network) C++14
0 / 100
 138 ms 4516 KB 
#include "network.h"
#define FOR(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define mp make_pair
#define pb push_back
#define iii pair<int, pair<int,int> >
#define vi vector<int>

using namespace std;

void findRoute(int N,int a,int b){
  int dist[N];

  for(int i = 1;i<=N; i++){
    if(i == b)dist[i] = 0;
    else{
      dist[i] = ping(i,b) + 1;
    }  
  }

  int node = a;
  while(true){
    for(int i=1;i<=N;i++){
      if((dist[i] == dist[node] - 1) and (ping(node,i) == 0)){
        travelTo(node);
      }
      if(node == b)break;
    }
  }
}

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
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 121 ms 4344 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 134 ms 4380 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 134 ms 4516 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 138 ms 4516 KB Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -