제출 #1342648

#제출 시각아이디문제언어결과실행 시간메모리
1342648yc11컴퓨터 네트워크 (BOI14_network)C++20
50 / 100
52 ms4396 KiB
#include<bits/stdc++.h>
#include"network.h"
using namespace std;
void findRoute (int N, int a, int b)
{
    int d;

    vector<vector<int> > hi2;
    hi2.resize(N);
    for (int i = 0;i<N;i++){
        if (i+1==a) continue;
        int c=  ping(i+1,a);
        hi2[c].push_back(i+1);
        if(i+1==b) d = c;
    }
    int c = a;
    for (int i = 0;i<d;i++){
        for (int j = 0;j<hi2[i].size();j++){
            if (ping(hi2[i][j],b)==d-i-1 and ping(hi2[i][j],c)==0) {travelTo(hi2[i][j]);c=hi2[i][j];
            break;}
        }
    }
    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...