# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1195166 | prideliqueee | Computer Network (BOI14_network) | C++20 | 49 ms | 4168 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);
vector<pair<int,int>> v;
for(int i=1;i<=N;i++)
{
if(i==a||i==b)
continue;
int dist1=ping(a,i);
int dist2=ping(i,b);
if(dist1+dist2==sum)
{
v.push_back({dist1,i});
}
}
sort(v.begin(),v.end());
for(auto x:v)
travelTo(x.s);
travelTo(b);
}
컴파일 시 표준 에러 (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... |