oj.uz

Submission #147485

# Submission time Handle Problem Language Result Execution time Memory
147485 2019-08-29T17:41:32 Z JovanK26 City Mapping (NOI18_citymapping) C++14
0 / 100
 3 ms 504 KB 
#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=0;i<N;i++)
    {
        for(int j=0;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;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB get_distance() arguments out of range.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB get_distance() arguments out of range.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB get_distance() arguments out of range.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB get_distance() arguments out of range.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB get_distance() arguments out of range.
2 Halted 0 ms 0 KB -