제출 #1338967

#제출 시각아이디문제언어결과실행 시간메모리
1338967luvqrose컴퓨터 네트워크 (BOI14_network)C++20
25 / 100
49 ms4300 KiB
#include "network.h"
#include <bits/stdc++.h>

using namespace std;

void findRoute (int N, int a, int b)
{
    int dist = ping(a, b), cd, cu;
    stack<int> s;
    vector<int> adj[dist+1];
    for (int i=1; i<=N; i++)
    {
        if (i==a) continue;
        cd=ping(a, i);
        if (cd<dist) adj[cd].push_back(i);
    }
    cu=b;
    for (int i=dist; i>=0; i--)
    {
        for (auto c : adj[i])
        {
            if (ping(cu, c)==0) s.push(c), cu=c;
        }
    }
    while (!s.empty()) travelTo(s.top()), s.pop();
    travelTo(b);
}

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