제출 #1314864

#제출 시각아이디문제언어결과실행 시간메모리
1314864ninstroyer컴퓨터 네트워크 (BOI14_network)C++20
100 / 100
52 ms4332 KiB
#include "network.h" #include<bits/stdc++.h> using namespace std; void findRoute (int N, int a, int b) { int dist = ping(a,b)+1; vector<vector<int>> d(dist); for(int i = 1; i <= N; i++) { if(i == a || i == b) continue; int x = ping(a,i)+1; if(x >= dist) continue; d[x].push_back(i); } int cur = b; vector<int> res; res.push_back(b); for(int i = dist-1; i > 0; i--) { for(auto u : d[i]) { if(ping(cur,u) == 0) { res.push_back(u); cur = u; break; } } } reverse(res.begin(),res.end()); for(int i = 0; i < res.size(); i++) travelTo(res[i]); }

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