Submission #1196064

#TimeUsernameProblemLanguageResultExecution timeMemory
1196064prideliqueeeComputer Network (BOI14_network)C++20
0 / 100
1095 ms20820 KiB
#include<bits/stdc++.h>
#include "network.h"
using namespace std;
#define f first
#define s second
void findRoute (int N, int a, int b)
{
    int sum=ping(a,b);
    int dist[N+1];
    int mx=0;
    for(int i=1;i<=N;i++)
    {
        if(i==a||i==b)
        continue;
        int dist1=ping(a,i);
        dist[i]=dist1+1;
    }
    vector<int> v;
    int now=b;
    while(now!=a)
    {
        v.push_back(now);
        for(int i=1;i<=N;i++)
        {
            if(dist[now]==dist[i]+1&&ping(now,i)==0)
            {
                now=i;
                break;
            }
        }
    }
    for(int i=v.size()-1;i>=0;i--)
    travelTo(v[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]
   48 |     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]
   51 |             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...