제출 #93514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93514		admin	City Mapping (NOI18_citymapping)	C++17	25 / 100	39 ms	508 KiB

citymapping

#include "citymapping.h"

#include <bits/stdc++.h>

using namespace std;

using lint = long long;
using pil = pair<int, long long>;

void find_roads(int N, int Q, int A[], int B[], int W[]) {
	const int ROOT = 1;
	
	vector<lint> dist_to_root(N+1);
	for(int u = 1; u <= N; u++) {
		if(u != ROOT) dist_to_root[u] = get_distance(ROOT, u);
	}

	vector<int> internal(N);
	iota(internal.begin(), internal.end(), 1);
	sort(internal.begin(), internal.end(), [&](const int &p, const int &q) {
		return dist_to_root[p] < dist_to_root[q];
	});
	
	int e = 0;
	for(unsigned i = 1; i < internal.size(); i++) {
		int u = internal[i];
		int v = -1; lint d = 1e18;
		for(unsigned j = 0; j < i; j++) {
			int p = internal[j];
			lint c = (j == 0) ? dist_to_root[u] : get_distance(u, p);
			if(v == -1 || d > c) {
				d = c;
				v = p;
			}
		}
		A[e] = u; B[e] = v; W[e] = d;
		e += 1;
	}
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 43