# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752440 | jamielim | Computer Network (BOI14_network) | C++14 | 82 ms | 4244 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 "network.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> ii;
const int INF=1012345678;
int dista[1005];
set<int> found;
void findRoute (int N, int a, int b){
int d=ping(a,b)+1;
found.insert(0);
found.insert(d);
memset(dista,-1,sizeof(dista));
dista[0]=a;
dista[d]=b;
for(int i=1;i<=N;i++){
if(i==a||i==b)continue;
int x=ping(i,a)+1;
if(dista[x]!=-1)continue;
if(x>d)continue;
auto it=found.upper_bound(x);
int y=ping(i,dista[*it])+1;
if(x+y==(*it)){
dista[x]=i;
found.insert(x);
}
}
for(int i=1;i<=d;i++)travelTo(dista[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... |