Submission #836177

#	Time	Username	Problem	Language	Result	Execution time	Memory
836177		Liudas	City Mapping (NOI18_citymapping)	C++17	32 / 100	2 ms	468 KiB

citymapping

#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
void find_roads(int N, int Q, int A[], int B[], int W[]) {
	vector<pair<long long, long long>> dist(N, {0, 0});
	for(int i = 1; i < N; i ++){
		dist[i] = {get_distance(1, i + 1), i};
	}
	sort(dist.rbegin(), dist.rend());
	for(int i = 1; i < N; i ++){
		dist[i] = {get_distance(dist[i].second + 1, dist[0].second + 1), dist[i].second};
	}
	long long total = 0;
	dist[0] = {0, dist[0].second};
	sort(dist.begin(), dist.end());
	for(int i = 1; i < N; i ++){
		W[i-1] = dist[i].first - total;
		A[i-1] = dist[i-1].second + 1;
		B[i-1] = dist[i].second + 1;
		total += W[i-1];
		//cout << A[i] << " " << B[i] << " " << W[i] << endl;
	}
	return;
}

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