Submission #1348630

#	Time	Username	Problem	Language	Result	Execution time	Memory
1348630		bananacookie	Computer Network (BOI14_network)	C++17	100 / 100	38 ms	4404 KiB

network

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#include "network.h" //********** 

const int NN=1005;
vector<int> dist[NN];

void findRoute (int N, int a, int b)
{
    int dist_b;
    for(int i=1;i<=N;i++){
        if(i==a) continue;
        int cur_dist=ping(a,i);

        dist[cur_dist].push_back(i);
        if(i==b) dist_b=cur_dist;
    }

    vector<int> path; path.push_back(b);

    int cur_v=b;
    for(int i=dist_b-1;i>=0;i--){ //i=subset of previous node
        for(int u:dist[i]){
            if(ping(u,cur_v)==0){
                path.push_back(u);
                cur_v=u;
                break;
            }
        }
    }

    reverse(path.begin(),path.end());

    for(int x:path) travelTo(x);
}

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]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25