제출 #1328396

#제출 시각아이디문제언어결과실행 시간메모리
1328396vahagng컴퓨터 네트워크 (BOI14_network)C++20
100 / 100
56 ms4364 KiB
#include "network.h"
#include <bits/stdc++.h>
using namespace std;

int d[1001];

void findRoute(int N, int a, int b)
{
    for (int i = 1; i <= N; i++) {
        if (i == a) continue;
        d[i] = ping(a, i);
    }
    d[a] = -1;
    vector<int>ans;
    while (b != a) {
        ans.push_back(b);
        for (int i = 1; i <= N; i++) {
            if (d[i] + 1 == d[b] && ping(i, b) == 0) {
                b = i;
                break;
            }
        }
    }
    reverse(ans.begin(), ans.end());
    for (auto i : ans) {
        travelTo(i);
    }
}

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