# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548800 | usukhbaatar | City Mapping (NOI18_citymapping) | C++14 | 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"
#include <vector>
void find_roads(int N, int Q, int A[], int B[], int W[]) {
vector<pair<int, pair<int, int>>> e;
int xx = 0;
for (int i = 1; i <= N; i++) {
for (int j = i + 1; j <= N; j++) {
int temp = get_distance(i, j);
if (temp == 1) {
A[xx] = i;
B[xx] = j;
W[xx] = 1;
xx++;
}
}
}
return;
}