Submission #39368

#	Time	Username	Problem	Language	Result	Execution time	Memory
39368		MatheusLealV	Sightseeing (NOI14_sightseeing)	C++14	9 / 25	1703 ms	95480 KiB

sightseeing

#include <bits/stdc++.h>
#define f first
#define s second
#define N 500010
#define logn 20
using namespace std;
typedef pair<int, int> pii;

int n, m, q, pai[N], peso[N], nivel[N], ans[N];

vector<pii> grafo[N];

vector< pair<int, pii> > A;

int Find(int x)
{
	if(x == pai[x]) return x;

	return pai[x] = Find(pai[x]);
}

void join(int a, int b)
{
	if(peso[a] >= peso[b]) swap(a, b);

	pai[a] = b;

	if(peso[a] == peso[b]) peso[b] ++;
}

void getans()
{
	memset(ans, 0x3f3f3f3f, sizeof ans);

	queue<pii> fila;

	fila.push(pii(1, 1));

	while(!fila.empty())
	{
		int x = fila.front().f, p = fila.front().s;

		fila.pop();

		for(auto v: grafo[x])
		{	
			if(v.f == p) continue;

			ans[v.f] = min(ans[x], v.s);

			fila.push(pii(v.f, x));
		}
	}
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>m>>q;

	for(int i = 1, a, b, c; i <= m; i++)
	{
		cin>>a>>b>>c;

		A.push_back(make_pair(c, pii(a, b)));
	}

	sort(A.rbegin(), A.rend());

	for(int i = 1; i <= n; i++) pai[i] = i;

	for(auto p: A)
	{
		int a = Find(p.s.f), b = Find(p.s.s);

		if(a == b) continue;

		join(a, b);

		grafo[a].push_back(pii(b, p.f));

		grafo[b].push_back(pii(a, p.f));
	}

	getans();

	while(q--)
	{
		int x;

		cin>>x;

		cout<<ans[x]<<"\n";
	}
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 10