oj.uz

Submission #937045

# Submission time Handle Problem Language Result Execution time Memory
937045 2024-03-03T09:38:48 Z Whisper Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 286 ms 27300 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 Lg(x) 31 - __builtin_clz(x)

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

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
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;
    }
int numNode, numEdge;

vector<pair<int, int>> adj[MAX];

int F[MAX][4], node[4];
void dijkstra(int x){
    for (int i = 1; i <= numNode; ++i) F[i][x] = LINF;
    F[node[x]][x] = 0;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.emplace(0, node[x]);
    while (q.size()){
        pair<int, int> f = q.top(); q.pop();
        int du = f.first, u = f.second;
        if (F[u][x] < du) continue;
        for (pair<int, int> &c : adj[u]){
            int v = c.first, w = c.second;
            if (minimize(F[v][x], F[u][x] + w)){
                q.emplace(F[v][x], v);
            }
        }
    }
}

vector<int> G[MAX];

int dpU[MAX], dpV[MAX];
int vis[MAX];
int res;
void dp(int u){
    if (vis[u]) return;
    vis[u] = 1;
    for (int &v : G[u]){
        dp(v);
        minimize(dpU[u], dpU[v]);
        minimize(dpU[u], F[v][2]);

        minimize(dpV[u], dpV[v]);
        minimize(dpV[u], F[v][3]);
    }
    minimize(res, dpU[u] + F[u][3]);
    minimize(res, dpV[u] + F[u][2]);
}
void Whisper(){
    cin >> numNode >> numEdge;
    REP(i, 4) cin >> node[i];
    for (int i = 1; i <= numEdge; ++i){
        int u, v, w; cin >> u >> v >> w;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }

    REP(i, 4) dijkstra(i);
    for (int u = 1; u <= numNode; ++u){
        for (pair<int, int>& x : adj[u]){
            int v = x.first, w = x.second;
            if (F[u][0] + w + F[v][1] == F[node[1]][0]){
                G[u].push_back(v);
            }
        }
    }
    for (int i = 0; i <= numNode; ++i) dpU[i] = dpV[i] = LINF;
    res = F[node[2]][3];

    dp(node[0]);
    cout << res;
}


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

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 21916 KB Output is correct
2 Correct 243 ms 21108 KB Output is correct
3 Correct 225 ms 26804 KB Output is correct
4 Correct 197 ms 21596 KB Output is correct
5 Correct 261 ms 22040 KB Output is correct
6 Correct 225 ms 22088 KB Output is correct
7 Correct 205 ms 22352 KB Output is correct
8 Correct 214 ms 22016 KB Output is correct
9 Correct 280 ms 20868 KB Output is correct
10 Correct 169 ms 20808 KB Output is correct
11 Correct 67 ms 19284 KB Output is correct
12 Correct 214 ms 20908 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 22796 KB Output is correct
2 Correct 259 ms 23164 KB Output is correct
3 Correct 238 ms 22556 KB Output is correct
4 Correct 214 ms 22984 KB Output is correct
5 Correct 231 ms 23840 KB Output is correct
6 Correct 255 ms 25740 KB Output is correct
7 Correct 233 ms 26372 KB Output is correct
8 Correct 282 ms 23156 KB Output is correct
9 Correct 228 ms 23760 KB Output is correct
10 Correct 286 ms 22720 KB Output is correct
11 Correct 71 ms 21332 KB Output is correct
12 Correct 217 ms 26132 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11864 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10328 KB Output is correct
4 Correct 13 ms 13400 KB Output is correct
5 Correct 7 ms 12124 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 4 ms 10580 KB Output is correct
8 Correct 3 ms 10584 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 7 ms 12124 KB Output is correct
11 Correct 2 ms 10332 KB Output is correct
12 Correct 2 ms 10400 KB Output is correct
13 Correct 2 ms 10468 KB Output is correct
14 Correct 3 ms 10328 KB Output is correct
15 Correct 3 ms 10332 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 21916 KB Output is correct
2 Correct 243 ms 21108 KB Output is correct
3 Correct 225 ms 26804 KB Output is correct
4 Correct 197 ms 21596 KB Output is correct
5 Correct 261 ms 22040 KB Output is correct
6 Correct 225 ms 22088 KB Output is correct
7 Correct 205 ms 22352 KB Output is correct
8 Correct 214 ms 22016 KB Output is correct
9 Correct 280 ms 20868 KB Output is correct
10 Correct 169 ms 20808 KB Output is correct
11 Correct 67 ms 19284 KB Output is correct
12 Correct 214 ms 20908 KB Output is correct
13 Correct 238 ms 22796 KB Output is correct
14 Correct 259 ms 23164 KB Output is correct
15 Correct 238 ms 22556 KB Output is correct
16 Correct 214 ms 22984 KB Output is correct
17 Correct 231 ms 23840 KB Output is correct
18 Correct 255 ms 25740 KB Output is correct
19 Correct 233 ms 26372 KB Output is correct
20 Correct 282 ms 23156 KB Output is correct
21 Correct 228 ms 23760 KB Output is correct
22 Correct 286 ms 22720 KB Output is correct
23 Correct 71 ms 21332 KB Output is correct
24 Correct 217 ms 26132 KB Output is correct
25 Correct 7 ms 11864 KB Output is correct
26 Correct 3 ms 10332 KB Output is correct
27 Correct 3 ms 10328 KB Output is correct
28 Correct 13 ms 13400 KB Output is correct
29 Correct 7 ms 12124 KB Output is correct
30 Correct 3 ms 10588 KB Output is correct
31 Correct 4 ms 10580 KB Output is correct
32 Correct 3 ms 10584 KB Output is correct
33 Correct 3 ms 10588 KB Output is correct
34 Correct 7 ms 12124 KB Output is correct
35 Correct 2 ms 10332 KB Output is correct
36 Correct 2 ms 10400 KB Output is correct
37 Correct 2 ms 10468 KB Output is correct
38 Correct 3 ms 10328 KB Output is correct
39 Correct 3 ms 10332 KB Output is correct
40 Correct 258 ms 25712 KB Output is correct
41 Correct 206 ms 24948 KB Output is correct
42 Correct 189 ms 25064 KB Output is correct
43 Correct 78 ms 23900 KB Output is correct
44 Correct 76 ms 23744 KB Output is correct
45 Correct 196 ms 27268 KB Output is correct
46 Correct 271 ms 27184 KB Output is correct
47 Correct 195 ms 25524 KB Output is correct
48 Correct 88 ms 21168 KB Output is correct
49 Correct 177 ms 25560 KB Output is correct
50 Correct 199 ms 26512 KB Output is correct
51 Correct 221 ms 27300 KB Output is correct