Submission #151886

#	Time	Username	Problem	Language	Result	Execution time	Memory
151886		Kamisama	Computer Network (BOI14_network)	C++14	100 / 100	122 ms	8048 KiB

network

#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 (stderr)

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 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25