# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823897 | irmuun | Computer Network (BOI14_network) | C++17 | 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.
#include<bits/stdc++.h>
#include "network.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
void findRoute(int n,int a,int b){
int p[n+1][n+1];
vector<int>adj[n+1];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
p[i][j]=ping(i,j);
if(p[i][j]==0){
adj[i].pb(j);
adj[j].pb(i);
}
}
}
queue<ll>q;
int par[n+1];
fill(par,par+n+1,-1);
par[a]=0;
q.push(a);
while(!q.empty()){
int x=q.front();
q.pop();
for(auto y:adj[x]){
if(par[y]==-1){
par[y]=x;
q.push(y);
}
}
}
vector<int>v;
while(b!=a){
v.pb(b);
b=par[b];
}
v.pb(a);
reverse(all(v));
for(int i=0;i<v.size()-1;i++){
travelTo(v[i],v[i+1]);
}
}