Submission #1196081

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196081		NAMIN	City Mapping (NOI18_citymapping)	C++20	9 / 100	33 ms	584 KiB

citymapping

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

#define ll long long

struct Edges{
	int u,v;
	ll w;
	bool operator<(const Edges& e)const{
		return w < e.w;
	}
};

vector<int> parent;
vector<Edges> edges;

int find(int node){
	if(parent[node]==node)
		return node;
	return parent[node] = find(node);
}

void unite(int a,int b){
	a = find(a),b = find(b);
	parent[b] = a;
}
void find_roads(int N, int Q, int A[], int B[], int W[]) {
	parent.resize(N+1);
	for(int i=1;i<=N;i++)
		parent[i] = i;
	
	int cur = 0;
	for(int i=1;i<=N;i++){
		for(int j=i+1;j<=N;j++){
			if(get_distance(i,j) == 1){
				A[cur] = i,B[cur] = j,W[cur]=1;
				cur++;
			}
			//edges.push_back({i,j,get_distance(i,j)});
		}
	}
	return;
	/*sort(edges.begin(),edges.end());
	
	int cur = 0;
	for(auto edge : edges){
		ll u = edge.u,v = edge.v,w = edge.w;
		if(find(u) != find(v)){
			unite(u,v);
			A[cur] = u;
			B[cur] = v;
			W[cur] = w;
			cur++;
			if(cur==N-1)
				return;
		}
	}
	assert(cur == N-1);
	
	return;*/
}

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