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 <map>
using namespace std;
map<int,int> mp;
map<int,int>::iterator it;
void findRoute (int n, int a, int b)
{
int dist = ping(a, b);
int x,y;
int i;
mp[dist+1]=b;
for(i=1;i<=n;i++){
if(i==a || i==b) continue;
x=ping(a,i);
if(x >= dist) continue;
if(mp.find(x+1) != mp.end() ) continue;
mp[x+1]=i;
it=mp.find(x+1);
it++;
y=ping(i,it->second);
if(it->first != (x+1) + (y+1) ){
it--;
mp.erase(it);
}
}
for(it=mp.begin(); it!=mp.end(); it++){
travelTo(it->second);
}
}
# | 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... |