oj.uz

Submission #124601

# Submission time Handle Problem Language Result Execution time Memory
124601 2019-07-03T14:51:25 Z MoNsTeR_CuBe Sightseeing (NOI14_sightseeing) C++17
15 / 25
 3500 ms 110992 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = numeric_limits<int>::max();

vector< int > dist;

vector< int > U;

vector< int > taille;

int getParents(int a){
	if(U[a] == a) return a;
	else return U[a] = getParents(U[a]);
}

void Union(int a, int b){
	a = getParents(a);
	b = getParents(b);
	
	if(taille[a] < taille[b]){
		taille[a] += taille[b];
		U[a] = U[b];
	}else{
		taille[b] += taille[a];
		U[b] = U[a];
	}
}

vector< vector< pair<int, int> > > Graph;

vector< bool > visited;

void dfs(int node, int cost){
	dist[node] = cost;
	visited[node] = true;
	for(pair<int, int> p : Graph[node]){
		if(visited[p.first]) continue;
		dfs(p.first, min(cost, p.second));
	}
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m, q;
	cin >> n >> m >> q;
	
	Graph.resize(n+1);
	
	vector< tuple<int, int, int> > edges;
	
	for(int i = 0; i < m; i++){
		
		int a, b, c;
		cin >> a >> b >> c;
		
		edges.push_back(make_tuple(c,a,b));
	}
	
	taille.assign(n+1,1);
	dist.resize(n+1);
	U.resize(n+1);
	
	for(int i = 0; i <= n; i++){
		U[i] = i;
	}
	
	sort(edges.begin(), edges.end(), greater< tuple<int, int, int> >());
	
	for(int i = 0; i < m; i++){
		int a = get<1>(edges[i]);
		int b = get<2>(edges[i]);
		
		int c = get<0>(edges[i]);
		
		if(getParents(a) == getParents(b)){
			continue;
		}
		Union(a,b);
		
		Graph[a].push_back(make_pair(b,c));
		Graph[b].push_back(make_pair(a,c));
	}
	visited.assign(n+1, false);
	dfs(1,INF);
	
	for(int i = 0; i < q; i++){
		int a;
		cin >> a;
		cout << dist[a] << endl;
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 3568 KB Output is correct
2 Correct 49 ms 3312 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2813 ms 63660 KB Output is correct
2 Execution timed out 3545 ms 110992 KB Time limit exceeded