oj.uz

답안 #58892

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58892 2018-07-19T18:48:03 Z Benq 관광 (NOI14_sightseeing) C++14
25 / 25
 3329 ms 258456 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 500001;

vector<array<int,3>> ed;
int par[MX], ans[MX];
vi rpar[MX];
int V,E,Q;

void unite(int c, int a, int b) {
    a = par[a], b = par[b];
    if (a == b) return;
    if (par[1] == a) {
        for (int i: rpar[b]) ans[i] = c;
    } else if (par[1] == b) {
        for (int i: rpar[a]) ans[i] = c;
    }
    if (sz(rpar[a]) < sz(rpar[b])) swap(a,b);
    for (int i: rpar[b]) {
        par[i] = a;
        rpar[a].pb(i);
    }
    rpar[b].clear();
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> V >> E >> Q;
    FOR(i,1,V+1) {
        par[i] = i;
        rpar[i].pb(i);
    }
    F0R(i,E) {
        int a,b,c; cin >> a >> b >> c;
        ed.pb({c,a,b});
    }
    sort(ed.rbegin(),ed.rend());
    for (auto a: ed) unite(a[0],a[1],a[2]);
    F0R(i,Q) {
        int x; cin >> x;
        cout << ans[x] << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 12152 KB Output is correct
2 Correct 15 ms 12152 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12620 KB Output is correct
2 Correct 17 ms 12620 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 15844 KB Output is correct
2 Correct 56 ms 16252 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2253 ms 128652 KB Output is correct
2 Correct 3329 ms 258456 KB Output is correct