oj.uz

Submission #515987

# Submission time Handle Problem Language Result Execution time Memory
515987 2022-01-20T09:06:40 Z Joo City Mapping (NOI18_citymapping) C++17
32 / 100
 2 ms 464 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;

void find_roads(int N, int Q, int A[], int B[], int W[]) {
	int leaf = 0;
	long long mx = 0;
	for(int i = 2; i <= N; i++){
		long long res = get_distance(1, i);
		if(res > mx){
			mx = res;
			leaf = i;
		}
	}

	vector<pair<long long, int>> vec;
	for(int i = 1; i <= N; i++){
		long long res = get_distance(leaf, i);
		vec.emplace_back(res, i);
	}
	sort(vec.begin(), vec.end());

	for(int i = 0; i+1 < vec.size(); i++){
		A[i] = vec[i].second;
		B[i] = vec[i+1].second;
		W[i] = vec[i+1].first-vec[i].first;
	}

	return;
}

Compilation message

citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(int i = 0; i+1 < vec.size(); i++){
      |                 ~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Correct: 1997 out of 500000 queries used.
2 Incorrect 1 ms 460 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Correct: 1997 out of 500000 queries used.
2 Incorrect 1 ms 460 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Correct: 1981 out of 12000 queries used.
2 Correct 1 ms 460 KB Correct: 1985 out of 12000 queries used.
3 Correct 1 ms 460 KB Correct: 1999 out of 12000 queries used.
4 Correct 1 ms 460 KB Correct: 1985 out of 12000 queries used.
5 Correct 1 ms 460 KB Correct: 1981 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Correct: 1981 out of 12000 queries used.
2 Correct 1 ms 460 KB Correct: 1985 out of 12000 queries used.
3 Correct 1 ms 460 KB Correct: 1999 out of 12000 queries used.
4 Correct 1 ms 460 KB Correct: 1985 out of 12000 queries used.
5 Correct 1 ms 460 KB Correct: 1981 out of 12000 queries used.
6 Correct 1 ms 460 KB Correct: 1995 out of 12000 queries used.
7 Correct 1 ms 456 KB Correct: 1991 out of 12000 queries used.
8 Correct 2 ms 464 KB Correct: 1999 out of 12000 queries used.
9 Correct 2 ms 456 KB Correct: 1993 out of 12000 queries used.
10 Correct 1 ms 460 KB Correct: 1987 out of 12000 queries used.

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Correct: 1997 out of 500000 queries used.
2 Incorrect 1 ms 460 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -