제출 #1324416

#제출 시각아이디문제언어결과실행 시간메모리
1324416hxluk.ka컴퓨터 네트워크 (BOI14_network)C++20
100 / 100
56 ms4364 KiB
#include "network.h"
#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
const int nx=1003;
int d[nx];
void findRoute(int N, int a, int b)
{
    for (int i=1; i<=N; i++) if (i!=a) d[i]=ping(i, a)+1;

    stack<int> s;
    int cur=b;
    while (cur!=a) {
        s.push(cur);
        for (int i=1; i<=N; i++) {
            if (d[i]+1==d[cur]&&ping(cur, i)==0) {
                cur=i;
                break;
            }
        }
    }
    while (!s.empty()) travelTo(s.top()), s.pop();
}

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