제출 #1328371

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


void findRoute(int N, int a, int b)
{
    set<int>st;
    for (int i = 1; i <= N; i++) {
        if(i != a && i != b) st.insert(i);
    }
    while (a != b) {
        vector<int>V;
        for (auto i : st) {
            if (ping(a, i) == 1) {
                V.push_back(i);
            }
        }
        int mn = -1, node;
        for (auto i : V) {
            int d = ping(i, b);
            if (mn == -1 || mn > d) {
                mn = d;
                node = i;
            }
        }
        for(auto i : V){
            st.erase(i);
        }
        st.erase(a);
        travelTo(node);
        a = node;
    }
}

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