# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70404 | Googal | Computer Network (BOI14_network) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
//#include "network.h"
using namespace std;
const int NMAX = 1e3;
vector < int > p[1 + NMAX];
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 ok = false;
for(int i = 1; i < p[d].size(); i++) {
if(ping(a, p[d][i]) == 0) {
if(d + ping(p[d][i], b) == dist) {
a = p[d][i];
travelTo(a);
ok = true;
break;
}
}
}
if (ok == false) {
a = p[d][0];
travelTo(a);
}
}
travelTo(b);
}