제출 #855828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855828		Hard_slipper	컴퓨터 네트워크 (BOI14_network)	C++14	25 / 100	70 ms	11856 KiB

network

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

int path[1005][1005] = {};

void findRoute (int N, int a, int b)
{
    int dist = ping(a, b)+1;

    for(int i =1; i <= N; i++)
    {
        if(i == a || i == b) continue;
        int cur_dist = ping(a, i)+1;
        int final_dist = ping(i, b)+1;
        //cout << cur_dist << ' ' << final_dist << '\n';
        if(cur_dist+final_dist == dist)
        {
            path[cur_dist][final_dist] = i;
        }
    }
    path[dist][0] = b;
    int cur_dist = 1;
    int final_dist = dist-1;
    while(cur_dist <= dist)
    {
        travelTo(path[cur_dist][final_dist]);
        final_dist--;
        cur_dist++;
    }
}

컴파일 시 표준 에러 (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