oj.uz

Submission #548798

# Submission time Handle Problem Language Result Execution time Memory
548798 2022-04-14T12:14:02 Z usukhbaatar City Mapping (NOI18_citymapping) C++14
0 / 100
 40 ms 468 KB 
#include "citymapping.h"

void find_roads(int N, int Q, int A[], int B[], int W[]) {
	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;
			}
		}
	}
	return;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 448 KB Reported list of edges differ from actual.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 448 KB Reported list of edges differ from actual.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 448 KB Reported list of edges differ from actual.
2 Halted 0 ms 0 KB -