oj.uz

Submission #937048

# Submission time Handle Problem Language Result Execution time Memory
937048 2024-03-03T09:58:16 Z Whisper Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 282 ms 28648 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;
//dpU(i) is the minimum cost that we can reach from U -> i
//dpV(i) is the same as U
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 255 ms 24232 KB Output is correct
2 Correct 210 ms 23360 KB Output is correct
3 Correct 254 ms 28648 KB Output is correct
4 Correct 266 ms 23860 KB Output is correct
5 Correct 208 ms 24048 KB Output is correct
6 Correct 277 ms 24268 KB Output is correct
7 Correct 262 ms 24312 KB Output is correct
8 Correct 210 ms 24024 KB Output is correct
9 Correct 248 ms 23112 KB Output is correct
10 Correct 179 ms 23500 KB Output is correct
11 Correct 70 ms 20560 KB Output is correct
12 Correct 235 ms 23264 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 24748 KB Output is correct
2 Correct 233 ms 25188 KB Output is correct
3 Correct 247 ms 25040 KB Output is correct
4 Correct 241 ms 24976 KB Output is correct
5 Correct 277 ms 25816 KB Output is correct
6 Correct 282 ms 27896 KB Output is correct
7 Correct 221 ms 28620 KB Output is correct
8 Correct 242 ms 25152 KB Output is correct
9 Correct 238 ms 25804 KB Output is correct
10 Correct 221 ms 24772 KB Output is correct
11 Correct 87 ms 22692 KB Output is correct
12 Correct 234 ms 28276 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12120 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 12 ms 13536 KB Output is correct
5 Correct 7 ms 12120 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 4 ms 10432 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 8 ms 12084 KB Output is correct
11 Correct 2 ms 10332 KB Output is correct
12 Correct 2 ms 10332 KB Output is correct
13 Correct 3 ms 10472 KB Output is correct
14 Correct 3 ms 10476 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 255 ms 24232 KB Output is correct
2 Correct 210 ms 23360 KB Output is correct
3 Correct 254 ms 28648 KB Output is correct
4 Correct 266 ms 23860 KB Output is correct
5 Correct 208 ms 24048 KB Output is correct
6 Correct 277 ms 24268 KB Output is correct
7 Correct 262 ms 24312 KB Output is correct
8 Correct 210 ms 24024 KB Output is correct
9 Correct 248 ms 23112 KB Output is correct
10 Correct 179 ms 23500 KB Output is correct
11 Correct 70 ms 20560 KB Output is correct
12 Correct 235 ms 23264 KB Output is correct
13 Correct 252 ms 24748 KB Output is correct
14 Correct 233 ms 25188 KB Output is correct
15 Correct 247 ms 25040 KB Output is correct
16 Correct 241 ms 24976 KB Output is correct
17 Correct 277 ms 25816 KB Output is correct
18 Correct 282 ms 27896 KB Output is correct
19 Correct 221 ms 28620 KB Output is correct
20 Correct 242 ms 25152 KB Output is correct
21 Correct 238 ms 25804 KB Output is correct
22 Correct 221 ms 24772 KB Output is correct
23 Correct 87 ms 22692 KB Output is correct
24 Correct 234 ms 28276 KB Output is correct
25 Correct 11 ms 12120 KB Output is correct
26 Correct 3 ms 10332 KB Output is correct
27 Correct 3 ms 10332 KB Output is correct
28 Correct 12 ms 13536 KB Output is correct
29 Correct 7 ms 12120 KB Output is correct
30 Correct 3 ms 10588 KB Output is correct
31 Correct 4 ms 10432 KB Output is correct
32 Correct 3 ms 10588 KB Output is correct
33 Correct 4 ms 10588 KB Output is correct
34 Correct 8 ms 12084 KB Output is correct
35 Correct 2 ms 10332 KB Output is correct
36 Correct 2 ms 10332 KB Output is correct
37 Correct 3 ms 10472 KB Output is correct
38 Correct 3 ms 10476 KB Output is correct
39 Correct 3 ms 10332 KB Output is correct
40 Correct 223 ms 24172 KB Output is correct
41 Correct 205 ms 23008 KB Output is correct
42 Correct 192 ms 23224 KB Output is correct
43 Correct 82 ms 22864 KB Output is correct
44 Correct 88 ms 22928 KB Output is correct
45 Correct 206 ms 25776 KB Output is correct
46 Correct 199 ms 25664 KB Output is correct
47 Correct 200 ms 23744 KB Output is correct
48 Correct 81 ms 20564 KB Output is correct
49 Correct 167 ms 23776 KB Output is correct
50 Correct 226 ms 25084 KB Output is correct
51 Correct 202 ms 26044 KB Output is correct