# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216928 | bharat2002 | Computer Network (BOI14_network) | C++14 | 0 ms | 0 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.
/*input
*/
#include<bits/stdc++.h>
using namespace std;
const int N=1e3 + 100;
const int mod=1e9 + 7;
#define int long long
const int inf=1e18;
#define pii pair<int, int>
#define f first
#define s second
#define mp make_pair
#define FOR(i, n) for(int i=1;i<=n;i++)
#define TRACE(x) cerr << #x << " = " << x << endl
//Trace prints the name of the variable and the value.
int dista[N], distb[N];
bool sf(int a, int b)
{
return dista[a]<dista[b];
}
void findRoute(int n, int a, int b)
{
for(int i=1;i<=n;i++)
{
if(i==a) continue;
dista[i]=ping(i, a) +1;
}
for(int i=1;i<=n;i++)
{
if(i==b) continue;
distb[i]=ping(i, b) + 1;
}
vector<int> vals;
for(int i=1;i<=n;i++)
{
if(dista[i] + distb[i]==dista[b])
{
vals.push_back(i);
}
}
sort(vals.begin(), vals.end());
for(auto i:vals)
{
travelTo(i);
}
}