| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 42650 | BlackFlag777 | Computer Network (BOI14_network) | C++14 | 121 ms | 4728 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;
void travelTo(int k);
void findRoute(int N, int a, int b);
int ping (int i, int j);
void findRoute(int N, int a, int b)
{
    vector<int>v[1003];
    int par[1003],vis[1003];
    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
        {
            if(i!=j)
            {
                if(ping(i,j)==0)
                {
                    v[i].push_back(j);
                    v[j].push_back(i);
                }
            }
        }
    }
    queue<int>q;
    par[a]=-1;
    q.push(a);
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        if(vis[p])continue;
        vis[p]=1;
        for(int i=0;i<v[p].size();i++)
        {
            if(!par[v[p][i]]&&par[v[p][i]]!=-1)
            {
                par[v[p][i]]=p;
                q.push(v[p][i]);
            }
        }
    }
    vector<int>ans;
    int temp=b;
    while(1)
    {
        ans.push_back(temp);
        temp=par[temp];
        if(par[temp]==-1)break;
    }
    reverse(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++)
    {
        travelTo(ans[i]);
    }
    return ;
}
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... | ||||
