| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314886 | gotzillaz | Computer Network (BOI14_network) | C++20 | 49 ms | 4248 KiB |
#include "network.h"
#include <iostream>
#include <vector>
using namespace std;
void findRoute(int N, int a, int b) {
vector<vector<int>> sp(N + 1, vector<int>());
int pb = 0;
vector<int> ans = {b};
for (int i = 1; i <= N; i++) {
if (i == a)
continue;
int x = ping(a, i);
sp[x].push_back(i);
if (i == b) {
pb = x;
break;
}
}
int now = b;
for (int i = pb - 1; i >= 0; i--) {
for (int k = 0; k <= sp[i].size(); k++) {
int x = ping(now, sp[i][k]);
if (x == 0) {
ans.push_back(sp[i][k]);
now = sp[i][k];
break;
}
}
}
// ans.push_back(a);
// for (int i = 0; i < ans.size(); i++)
// cout << ans[i] << endl;
for (int i = ans.size() - 1; i >= 0; i--) {
// cout << ans[i] << " " << N << endl;
travelTo(ans[i]);
}
}
Compilation message (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... | ||||
