oj.uz

Submission #956466

# Submission time Handle Problem Language Result Execution time Memory
956466 2024-04-02T02:53:06 Z vjudge1 Ferries (NOI13_ferries) C++17
40 / 40
 156 ms 25512 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, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 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());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

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;
    }

const int MAX = 2e5 + 5;
int numNode, numEdge;
vector<int> G[MAX];
priority_queue<int> cost[MAX];
int vis[MAX], F[MAX];
void Whisper(){
    cin >> numNode >> numEdge;
    for (int i = 1; i <= numEdge; ++i){
        int u, v, w; cin >> u >> v >> w;
        G[v].emplace_back(u);
        cost[u].push(w);
    }
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.emplace(0, numNode);
    memset(F, 0x3f, sizeof F);
    F[numNode] = 0;
    //greedy we match the minimum path with the maximum edge
    while (!q.empty()){
        int u, du; tie(du, u) = q.top(); q.pop();
        if(vis[u]) continue;
        vis[u] = 1;
        for (int&v : G[u]) {
            int w = cost[v].top(); cost[v].pop();
            if(minimize(F[v], F[u] + w)){
                q.emplace(F[v], v);
            }
        }
    }
    cout << F[1];
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct
3 Correct 10 ms 15708 KB Output is correct
4 Correct 81 ms 24460 KB Output is correct
5 Correct 80 ms 24512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 4 ms 14424 KB Output is correct
3 Correct 9 ms 15708 KB Output is correct
4 Correct 44 ms 19520 KB Output is correct
5 Correct 60 ms 21328 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15452 KB Output is correct
2 Correct 13 ms 15452 KB Output is correct
3 Correct 142 ms 24348 KB Output is correct
4 Correct 141 ms 24632 KB Output is correct
5 Correct 146 ms 24656 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 24148 KB Output is correct
2 Correct 126 ms 24168 KB Output is correct
3 Correct 147 ms 25456 KB Output is correct
4 Correct 143 ms 25292 KB Output is correct
5 Correct 156 ms 25512 KB Output is correct