| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1326746 | vahagng | Computer Network (BOI14_network) | C++20 | 186 ms | 131072 KiB |
#include "network.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>adj[1001];
int par[1001], dist[1001];
void findRoute(int N, int a, int b)
{
for (int i = 1; i <= N; i++) {
if (i == a) continue;
if (ping(a, i) == 0) {
adj[a].push_back(i);
adj[i].push_back(a);
}
}
for (int i = 1; i <= N; i++) {
dist[i] = INT_MAX;
}
dist[a] = 0;
queue<int>q;
q.push(a);
while(!q.empty()){
auto node = q.front();
q.pop();
for(auto i : adj[node]){
if(dist[i] != INT_MAX) continue;
dist[i] = dist[node] + 1;
par[i] = node;
q.push(i);
}
}
vector<int>jampa;
int B = b;
while (B != a) {
jampa.push_back(B);
B = par[B];
}
for(auto i : jampa){
travelTo(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... | ||||
