# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1196048 | prideliqueee | Computer Network (BOI14_network) | C++20 | 53 ms | 4416 KiB |
#include<bits/stdc++.h>
#include "network.h"
using namespace std;
#define f first
#define s second
void findRoute (int N, int a, int b)
{
int sum=ping(a,b);
vector<pair<int,int>> v;
vector<int> dist[sum];
int mx=0;
for(int i=1;i<=N;i++)
{
if(i==a||i==b)
continue;
int dist1=ping(a,i);
if(dist1<sum)
dist[dist1].push_back(i);
}
int prev=a;
if(sum==1)
travelTo(b);
for(int i=1;i<sum;i++)
{
for(auto x:dist[i])
{
int dist1,dist2;
if(i==1)
dist1=1;
else
dist1=ping(x,prev);
if(dist1!=1)
continue;
dist2=ping(x,b);
if(dist2+i!=sum);
continue;
prev=x;
travelTo(x);
break;
}
}
travelTo(b);
}
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... |