# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1196063 | prideliqueee | Computer Network (BOI14_network) | C++20 | 67 ms | 4420 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) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |