Submission #1314843

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314843		ninstroyer	Computer Network (BOI14_network)	C++20	25 / 100	51 ms	4348 KiB

network

#include "network.h"
#include<bits/stdc++.h>
using namespace std;

void findRoute (int N, int a, int b)
{
    int dist = ping(a,b)+1;
    int sz = dist+1;
    vector<int> arr(sz);
    arr[0] = a;
    arr[sz-1] = b;
    bool empty = true;
    int last = -1;
    for(int i = 1; i <= N; i++)
    {
        if(i == a || i == b) continue;
        if(empty)
        {
            int x = ping(a, i)+1;
            int y = ping(i, b)+1;
            if(x+y == dist) arr[x] = i;
            last = i;
        }
        else
        {
            int x = ping(a,i)+1;
            int y = ping(i,last)+1;
            if(x+y==last)
            {
                arr[x] = i;
                last = min(last, x);
            }
        }
    }
    for(int i = 1; i < sz; i++) travelTo(arr[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]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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