oj.uz

Submission #1104521

# Submission time Handle Problem Language Result Execution time Memory
1104521 2024-10-24T01:55:08 Z vjudge1 Sightseeing (NOI14_sightseeing) C++17
25 / 25
 2650 ms 166620 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

//#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX_NODE                        500005
#define MAX_EDGE                        5000005
int numNode, numEdge, numQuery;

vector<pair<int, int>> G[MAX_NODE];

int minDist[MAX_NODE];
void process(void){
    cin >> numNode >> numEdge >> numQuery;
    for (int i = 1; i <= numEdge; ++i){
        int u, v, w; cin >> u >> v >> w;
        G[u].emplace_back(v, w);
        G[v].emplace_back(u, w);
    }

    memset(minDist, -0x3f, sizeof minDist);
    priority_queue<pair<int, int>> q;

    minDist[1] = 2e9;
    q.emplace(minDist[1], 1);
    while(q.size()){
        int du, u; tie(du, u) = q.top(); q.pop();

        for (pair<int, int>&x : G[u]) {
            int v = x.first;
            int d = min(du, x.second);
            if(maximize(minDist[v], d)){
                q.emplace(minDist[v], v);
            }
        }
    }
    for (int i = 1; i <= numQuery; ++i){
        int x; cin >> x;
        cout << minDist[x] << '\n';
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 16052 KB Output is correct
2 Correct 20 ms 15708 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1920 ms 109492 KB Output is correct
2 Correct 2650 ms 166620 KB Output is correct