제출 #1196063

#제출 시각아이디문제언어결과실행 시간메모리
1196063prideliqueeeComputer Network (BOI14_network)C++20
0 / 100
67 ms4420 KiB
#include<bits/stdc++.h> #include "network.h" using namespace std; #define f first #define s second void findRoute (int N, int a, int b) { int sum=ping(a,b); int dist[N+1]; int mx=0; for(int i=1;i<=N;i++) { if(i==a||i==b) continue; int dist1=ping(a,i); dist[i]=dist1+1; } vector<int> v; int now=b; while(now!=a) { v.push_back(now); for(int i=1;i<=N;i++) { if(dist[now]+1==dist[i]&&ping(now,i)==0) { now=i; break; } } } for(int i=v.size()-1;i>=0;i--) travelTo(v[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...