#include "network.h"
#include <vector>
using namespace std;
vector<int> p[1001];
void findRoute (int N, int a, int b)
{
int dist = ping(a,b);
for (int i=1;i<=N;i++) if (i != a){
p[ping(a,i)+1].push_back(i);
}
for (int d=1;d<dist;d++){
bool ed = 0;
for (int i=1;i<p[d].size();i++){
if (ping(a,p[d][i]) == 0){
if (d + ping(b,p[d][i]) == dist){
travelTo(a=p[d][i]);
ed = 1;
break;
}
}
}
if (!ed) travelTo(a=p[d][0]);
}
travelTo(b);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
132 ms |
5216 KB |
Output isn't correct - Travelling to nonadjacent computer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
75 ms |
5216 KB |
Output isn't correct - Travelling to nonadjacent computer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
50 ms |
5216 KB |
Output isn't correct - Travelling to nonadjacent computer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
5216 KB |
Output isn't correct - Travelling to nonadjacent computer |
2 |
Halted |
0 ms |
0 KB |
- |