Submission #123501

#	Time	Username	Problem	Language	Result	Execution time	Memory
123501		mechfrog88	City Mapping (NOI18_citymapping)	C++14	9 / 100	104 ms	6640 KiB

citymapping

#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;

struct node{
	int a,b,w;
	bool operator <(const node& rhs) const{
		return w < rhs.w;
	}
};

vector <int> id;

int find(int i){
	if (id[i] < 0) return i;
	return id[i] = find(id[i]);
}

void unio(int i,int j){
	int a = find(i);
	int b = find(j);
	if (a == b) return;
	if (id[b] < id[a]) swap(a,b);
	id[a] += id[b];
	id[b] = a;
}


void find_roads(int n, int q, int a[], int b[], int w[]) {
	vector <node> arr(n+1);
	for (int z=1;z<=n;z++){
		for (int x=z+1;x<=n;x++){
			node temp;
			temp.a = z; temp.b = x; temp.w = get_distance(z,x);
			arr.push_back(temp);
		}
	}
	id.resize(n+1,-1);
	sort(arr.begin(),arr.end());
	vector <int> count(n+1,0);
	int c = 0;
	for (int z=0;z<arr.size();z++){
		if (count[arr[z].a] >= 3 || count[arr[z].b] >= 3) continue;
		int i = find(arr[z].a);
		int j = find(arr[z].b);
		if (i == j) continue;
		unio(i,j);
		a[c] = arr[z].a;
		b[c] = arr[z].b;
		w[c] = arr[z].w;
		count[arr[z].a]++;
		count[arr[z].b]++;
		c++;
	}
	return;
}

Compilation message (stderr)

citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:42:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int z=0;z<arr.size();z++){
               ~^~~~~~~~~~~

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