# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548775 | Mazaalai | City Mapping (NOI18_citymapping) | 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 "citymapping.h"
ll get(int a, int b) {
return get_distance(a, b);
}
void find_roads(int n, int q, int a[], int b[], int w[]) {
vector <int> dist[n+5];
int pt = 0;
for (int i = 2; i <= n; i++) {
int x = get(1, i);
if (x == 1) {
a[pt] = 1, b[pt] = i;
pt++;
}
dist[x].pb(i);
}
for (int i = 1; i < n; i++) {
if (dist[i].size() == 0 || dist[i+1].size() == 0) continue;
for (auto& el : dist[i])
for (auto& el1 : dist[i+1]) {
int x = get(el, el1);
if (x == 1) {
a[pt] = el, b[pt] = el1;
pt++;
}
}
}
return;
}