제출 #1314874

#제출 시각아이디문제언어결과실행 시간메모리
1314874zenzazaComputer Network (BOI14_network)C++20
100 / 100
50 ms4384 KiB
#include "network.h" #include <bits/stdc++.h> using namespace std; void findRoute (int N, int a, int b) { vector<int> node[N+5]; stack<int> ans; for (int i=1; i<=N; i++) { if (i==a) continue; int t = ping(a, i); node[t].push_back(i); } int cur = b; int count = 0; for (int i=ping(a, b)-1; i>=0; i--) { for (int x : node[i]) { if (ping(cur, x) == 0) { ans.push(x); cur = x; break; } } } while(!ans.empty()) travelTo(ans.top()), ans.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...