제출 #16054

#제출 시각아이디문제언어결과실행 시간메모리
16054kaTkaHrComputer Network (BOI14_network)C++98
25 / 100
130 ms5072 KiB
#include "network.h"
#include<vector>

using namespace std;

const int MX = 1005;

int ans[MX];

void findRoute (int N, int a, int b)
{
	int D = ping(a, b) + 1;
	ans[0] = a, ans[D] = b;
	for (int i = 1; i <= N; i++){
		if (i == a || i == b) continue;
		int x = ping(a, i) + 1, y = ping(i, b) + 1;
		if (x + y == D) ans[x] = i;
	}
	for (int i = 1; i <= D; i++) travelTo(ans[i]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...