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>
bool vis[1001][1001];
void find_roads(int N, int Q, int A[], int B[], int W[]) {
int br=0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(i==j)continue;
if(vis[i][j] || vis[j][i])continue;
vis[i][j]=1;
vis[j][i]=1;
int temp=get_distance(i, j);
if(temp==1)
{
A[br]=i;
B[br]=j;
W[br]=1;
br++;
}
}
}
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... |