Submission #733851

#TimeUsernameProblemLanguageResultExecution timeMemory
733851vjudge1City Mapping (NOI18_citymapping)C++17
32 / 100
2 ms476 KiB
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void find_roads(int N, int Q, int A[], int B[], int W[]) {
    int x = -1;
    ll mx = 0;
    for (int i = 1; i < N; i++) {
		ll s = get_distance(1, i + 1);
		if (s > mx) {
			mx = s;
			x = i;
		}
	}
	vector<pair<ll, int>> p(N);
	for (int i = 0; i < N; i++) {
		p[i] = {get_distance(x + 1, i + 1), i};
	}
	sort(p.begin(), p.end());
	for (int i = 0; i < N - 1; i++) {
		A[i] = p[i].second + 1;
		B[i] = p[i + 1].second + 1;
		W[i] = p[i + 1].first - p[i].first;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...