Submission #961555

#	Time	Username	Problem	Language	Result	Execution time	Memory
961555		vjudge1	City Mapping (NOI18_citymapping)	C++17	25 / 100	19 ms	9820 KiB

citymapping

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ent "\n"

const int maxn = 1e3 + 100;
const ll INF = (ll)1e18 + 100;
const int inf = 1e9 + 100;
const int MOD = 1e9 + 7;
const int maxl = 30;
const int P = 31;

long long get_distance(int X, int Y);

int n;
ll d[maxn][maxn];
vector<pii> ans;
int r;

void calc(vector<int> v){
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	random_shuffle(v.begin(), v.end());
	r = v[0];
	for(int i: v){
		if(i != r) d[r][i] = get_distance(r, i);
	}
	sort(v.begin(), v.end(), [](int i, int j){
		return d[r][i] < d[r][j];
	});
	vector<vector<int>> to;
	for(int i: v){
		if(i == r) continue;
		bool ok = 1;
		for(int j = 0; j < to.size(); j++){
			if(j == 2 || d[r][to[j][0]] + get_distance(to[j][0], i) == d[r][i]){
				to[j].push_back(i);
				ok = 0; break;
			}
		}
		if(ok) to.push_back({i});
	}
	for(auto s: to){
		ans.push_back({r, s[0]});
	}
	for(auto s: to){
		calc(s);
	}
}

void find_roads(int N, int Q, int A[], int B[], int W[]){
	srand(time(0));
	n = N;
	vector<int> v;
	for(int i = 1; i <= n; i++){
		v.push_back(i);
	}
	calc(v);
	for(int i = 0; i < n - 1; i++){
		A[i] = ans[i].first;
		B[i] = ans[i].second;
		W[i] = d[A[i]][B[i]];
	}
}

Compilation message (stderr)

citymapping.cpp: In function 'void calc(std::vector<int>)':
citymapping.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for(int j = 0; j < to.size(); j++){
      |                  ~~^~~~~~~~~~~

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