| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331245 | jump | Computer Network (BOI14_network) | C++20 | 52 ms | 4436 KiB |
#include "network.h"
#include <bits/stdc++.h>
int dist[2010];
std::vector<std::vector<int>> table;
std::vector<int> route;
void findRoute (int N, int a, int b)
{
table.resize(2010);
for(int i=1;i<=N;i++){
if(i==a)dist[i]=0;
else dist[i]=ping(a,i)+1;
table[dist[i]].push_back(i);
}
int curr=b;
//std::cout << curr << "<-" << '\n';
route.push_back(b);
while(curr!=a){
for(int i=0;i<table[dist[curr]-1].size();i++){
if(ping(curr,table[dist[curr]-1][i])==0){
int target=table[dist[curr]-1][i];
route.push_back(target);
curr=target;
break;
}
}
//std::cout << curr << "<-" << '\n';
}
for(int i=route.size()-2;i>=0;i--){
travelTo(route[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... | ||||
