oj.uz

답안 #771485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771485 2023-07-03T04:34:51 Z horiiseun 관광 (NOI14_sightseeing) C++17
25 / 25
 1647 ms 209784 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

int v, e, q, ans[500005];
vector<tuple<int, int, int>> edges;

struct UnionFind {
	int par[500005];
	vector<int> adj[500005];
	UnionFind() {
		for (int i = 0; i < 500005; i++) {
			par[i] = i;
			adj[i].push_back(i);
		}
	}

	int find(int x) {
		return par[x] == x ? par[x] : find(par[x]);
	}

	void merge(int x, int y, int c) {
		x = find(x);
		y = find(y);
		if (x != y) {
			if (x > y) swap(x, y);
			if (x == 1) {
				for (int i : adj[y]) {
					adj[x].push_back(i);
					ans[i] = c;
				}
				par[y] = x;
				adj[y].clear();
				return;
			}
			if (adj[x].size() < adj[y].size()) swap(x, y);
			par[y] = x;
			for (int i : adj[y]) {
				adj[x].push_back(i);
			}
			adj[y].clear();
		}
	}
} uf;

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> v >> e >> q;
	for (int i = 0, a, b, c; i < e; i++) {
		cin >> a >> b >> c;
		edges.push_back({c, a, b});
	}
	sort(edges.begin(), edges.end(), greater<tuple<int, int, int>>());
	
	for (auto [c, a, b] : edges) {
		uf.merge(a, b, c);
	}

	for (int i = 0, x; i < q; i++) {
		cin >> x;
		cout << ans[x] << "\n";
	}

}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 29664 KB Output is correct
2 Correct 27 ms 29652 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 29776 KB Output is correct
2 Correct 26 ms 29700 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 31848 KB Output is correct
2 Correct 45 ms 31560 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1142 ms 131532 KB Output is correct
2 Correct 1647 ms 209784 KB Output is correct