#include "citymapping.h"
#include<bits/stdc++.h>
#define ll long long
#define F first
#define Ss second
#define pb push_back
using namespace std;
void find_roads(int N, int Q, int a[], int b[], int w[]) {
vector<pair<ll,ll>>v;
for(ll i=2;i<=N;i++){
v.pb({get_distance(1,i),i});
}
sort(v.begin(),v.end(),greater<pair<ll,ll>>());
ll as=v[0].Ss;
v.clear();
for(ll i=1;i<=N;i++){
if(i!=as){
v.pb({get_distance(as,i),i});
}
}
sort(v.begin(),v.end());
ll l=as,p=0;
for(ll i=0;i<N-1;i++){
a[i]=l;
b[i]=v[i].Ss;
w[i]=v[i].F-p;
l=v[i].Ss;
p=v[i].F;
}
return;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |