oj.uz

답안 #38886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38886 2018-01-07T14:33:11 Z cheater2k 관광 (NOI14_sightseeing) C++14
15 / 25
 49 ms 77760 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 500005;
const int M = 5e6 + 5;

int n, m, q;
int c[M], fr[M], to[M];
int dsu[N];
vector<int> edges;
vector< pair<int,int> > G[N];
int mn[N];

int anc(int p) { return p == dsu[p] ? p : dsu[p] = anc(dsu[p]); }
void join(int p, int q) { p = anc(p); q = anc(q); dsu[p] = q; }

int main() {
	scanf("%d %d %d", &n, &m, &q);
	for (int i = 0; i < m; ++i) {
		int u, v, w; scanf("%d %d %d", &u, &v, &w);
		c[i] = w; fr[i] = u; to[i] = v;
		edges.push_back(i);
	}
	// build maximum spanning tree
	for (int i = 1; i <= n; ++i) dsu[i] = i;
	sort(edges.begin(), edges.end(), [&](int x, int y) {
		return c[x] > c[y];
	});
	for (int i = 0; i < m; ++i) {
		int w = c[edges[i]];
		int u = fr[edges[i]];
		int v = to[edges[i]];
		if (anc(u) == anc(v)) continue;
		join(u, v);
		G[u].push_back(make_pair(w, v));
		G[v].push_back(make_pair(w, u));
	}

	for (int i = 1; i <= n; ++i) mn[i] = -1;
	mn[1] = 1e9;
	// bfs
	queue <int> qu; qu.push(1);
	while(!qu.empty()) {
		int u = qu.front(); qu.pop();
		for (int i = 0; i < G[u].size(); ++i) {
			int v = G[u][i].second, w = G[u][i].first;
			if (mn[v] == -1) {
				mn[v] = min(mn[u], w); qu.push(v);
			}
		}
	}
	
	// answer queries
	while(q-- > 0) {
		int u; scanf("%d", &u);
		printf("%d\n", mn[u]);
	}
}

Compilation message

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:45:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < G[u].size(); ++i) {
                     ^
sightseeing.cpp:18:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &m, &q);
                               ^
sightseeing.cpp:20:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int u, v, w; scanf("%d %d %d", &u, &v, &w);
                                             ^
sightseeing.cpp:55:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int u; scanf("%d", &u);
                         ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 76236 KB Output is correct
2 Correct 0 ms 76236 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 76236 KB Output is correct
2 Correct 6 ms 76236 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 77760 KB Output is correct
2 Correct 29 ms 77760 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 0 KB -1: Interrupted system call
2 Halted 0 ms 0 KB -