제출 #836216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
836216		unnick	City Mapping (NOI18_citymapping)	C++14	0 / 100	2 ms	512 KiB

citymapping

#include "citymapping.h"

#include <algorithm>
#include <numeric>
#include <vector>

using namespace std;

#define ll long long

void find_roads(int N, int Q, int A[], int B[], int W[]) {
	// vector<ll> dists(N*N);
	vector<ll> dists(N);
	dists[0] = 0;
	vector<int> ids(N);
	iota(ids.begin(), ids.end(), 0);
	for (int i = 2; i <= N; i++) {
		dists[i-1] = get_distance(1,i);
	}
	sort(ids.begin(), ids.end(), [&](int a, int b) {
		return dists[a] < dists[b];
	});
	for (int i = 0; i < N-1; i++) {
		A[i] = ids[i]+1;
		B[i] = ids[i+1]+1;
		W[i] = dists[ids[i+1]] - dists[ids[i]];
	}
}

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