| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314902 | channk | Computer Network (BOI14_network) | C++20 | 1096 ms | 4200 KiB |
#include "network.h"
#include <vector>
#include <stack>
using namespace std;
void findRoute (int N, int a, int b)
{
vector<int> arr(1005);
for(int i=1;i<N;i++){
if(i!=a && i!=b) arr[i] = ping(a,i)+1;
}
stack<int> stk;
int curr = b;
while(curr!=a){
for(int i=1;i<N;i++){
if(arr[i]+1==arr[curr] && ping(curr,i)==0){
curr = i;
stk.push(i);
}
}
}
while(!stk.empty()){
travelTo(stk.top());
stk.pop();
}
}
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... | ||||
