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 "bits/stdc++.h"
#include "citymapping.h"
using namespace std;
void find_roads(int N, int Q, int A[], int B[], int W[]) {
int k = 0;
for(int i = 1; i <= N; ++i) {
for(int j = i + 1; j <= N; ++j) {
if(get_distance(i, j) == 1) {
A[k] = i; B[k] = j; W[k] = 1;
++k;
}
}
}
/* for (int i = 0; i < N - 1; i++) { */
/* A[i] = 1; */
/* B[i] = 2; */
/* W[i] = 1; */
/* } */
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... |