# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1196059 | prideliqueee | Computer Network (BOI14_network) | C++20 | 52 ms | 4416 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;
vector<int> dist[sum];
int mx=0;
for(int i=1;i<=N;i++)
{
if(i==a||i==b)
continue;
int dist1=ping(a,i);
if(dist1<sum)
dist[dist1].push_back(i);
}
int prev=a;
if(sum==0)
travelTo(b);
for(int i=0;i<sum;i++)
{
for(auto x:dist[i])
{
int dist1,dist2;
if(i==0)
dist1=0;
else
dist1=ping(x,prev);
if(dist1!=0)
continue;
dist2=ping(x,b);
if(dist2+i!=sum-1);
continue;
prev=x;
travelTo(x);
break;
}
}
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... |