# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752571 | penguin133 | Computer Network (BOI14_network) | C++17 | 84 ms | 4496 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#include "network.h"
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector <int> tmp[10005];
void findRoute (int N, int a, int b)
{
int hi;
for(int i=1;i<=N;i++){
if(i == b)continue;
int x = ping(i, b);
x++;
if(i == a)hi = x;
else tmp[x].push_back(i);
}
int cur = a;
while(hi){
for(auto i : tmp[hi-1]){
if(ping(cur, i) == 1){
travelTo(i);
cur = i;
hi--;
break;
}
}
}
travelTo(b);
}
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... |