| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314842 | ninstroyer | 컴퓨터 네트워크 (BOI14_network) | C++20 | 50 ms | 4276 KiB |
#include "network.h"
#include<bits/stdc++.h>
using namespace std;
void findRoute (int N, int a, int b)
{
int dist = ping(a,b)+1;
int sz = dist+1;
vector<int> arr(sz);
arr[0] = a;
arr[sz-1] = b;
bool empty = true;
int last = -1;
for(int i = 1; i <= N; i++)
{
if(i == a || i == b) continue;
if(empty)
{
int x = ping(a, i)+1;
int y = ping(i, b)+1;
if(x+y == dist) arr[x] = i;
last = i;
}
else
{
int x = ping(a,i)+1;
int y = ping(i,last)+1;
if(x+y==last)
{
arr[x] = i;
last = max(last, x);
}
}
}
for(int i = 1; i < sz; i++) travelTo(arr[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... | ||||
