제출 #1314950

#제출 시각아이디문제언어결과실행 시간메모리
1314950bananacookieComputer Network (BOI14_network)C++20
100 / 100
53 ms4316 KiB
#include "network.h" #include <bits/stdc++.h> using namespace std; const int NN=1e3+3; int dist[NN]; void findRoute (int N, int a, int b) { for(int i=1;i<=N;i++){ if(i!=a) dist[i]=ping(a,i)+1; } vector<int> ans={b}; int u=b; while(u!=a) { //ans.push_back(u); for(int i=1;i<=N;i++){ if(dist[i]+1==dist[u] && ping(u,i)==0){ u=i; ans.push_back(i); break; } } //cout<<"yeet"<<endl; } for(int i=ans.size()-2;i>=0;i--){ travelTo(ans[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...