답안 #770020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770020 2023-06-30T16:48:05 Z Filya 관광 (NOI14_sightseeing) C++14
25 / 25
1693 ms 218932 KB
//♥God will make a way♥
 
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
const int N = 500005;
int p[N];
vi g[N]; 
int ans[N];
void init(int n) {
    fri(n + 1) {
		p[i] = i;
		g[i].pb(i);
	}
}
int get(int a) {
    if(a != p[a])
        p[a] = get(p[a]);
    return p[a];
}
void join(int a, int b, ll c) {
    a = get(a);
    b = get(b);
	if(a==b) return;
	if(a > b) swap(a, b);
	if(a == 1) {
		for(int x : g[b]) {
			ans[x] = c;
			g[a].pb(x);
		}
		p[b] = a;
		ans[b] = c;
		g[b].clear();
		return;
	}
	// dbg(a) dbg(b)
    if(g[a].size() > g[b].size()) swap(a, b);
    p[a] = b;
	for(int x : g[a])
		g[b].pb(x);
	g[a].clear();
}
pair<ll, pii> edge[5000005];
int main() {
    fastio;
	int n, m, q, x; cin >> n >> m >> q;
	init(n);
	fri(m) cin >> edge[i].ss.ff >> edge[i].ss.ss >> edge[i].ff;
	sort(edge, edge + m); reverse(edge, edge + m);
	fri(m) join(edge[i].ss.ff, edge[i].ss.ss, edge[i].ff); //qani vor naxord bolor nayacnery mec en sranic, vor gagatnery kpnum en mekin, dranc patasxany arden voroshvum e
	fri(q) {
		cin >> x;
		cout << ans[x] << '\n';
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12260 KB Output is correct
2 Correct 6 ms 12032 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 14904 KB Output is correct
2 Correct 20 ms 15232 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1004 ms 78468 KB Output is correct
2 Correct 1693 ms 218932 KB Output is correct