Submission #47319

#TimeUsernameProblemLanguageResultExecution timeMemory
47319rajarshi_basuComputer Network (BOI14_network)C++14
100 / 100
171 ms4588 KiB
#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){ if(node == b)break; for(int i=1;i<=N;i++){ if((dist[i] == dist[node] - 1) and (ping(node,i) == 0)){ travelTo(i); node = 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]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...