# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515986 | Joo | City Mapping (NOI18_citymapping) | C++17 | 2 ms | 460 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 "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
void find_roads(int N, int Q, int A[], int B[], int W[]) {
int leaf = 0;
long long mx = 0;
for(int i = 2; i <= N; i++){
long long res = get_distance(1, i);
if(res > mx){
mx = res;
leaf = i;
}
}
vector<pair<int, int>> vec;
for(int i = 1; i <= N; i++){
long long res = get_distance(leaf, i);
vec.emplace_back(res, i);
}
sort(vec.begin(), vec.end());
for(int i = 0; i+1 < vec.size(); i++){
A[i] = vec[i].second;
B[i] = vec[i+1].second;
W[i] = vec[i+1].first-vec[i].first;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |