oj.uz

답안 #367009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
367009 2021-02-16T03:04:22 Z jainbot27 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 540 ms 26516 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
using T = pair<ll, int>;
using T2 = pair<ll, pii>;

int n, m, s, t, u, v;
vector<pair<int, ll>> adj[mxN];
ll du[mxN], dv[mxN], ans = infLL;
ll dist[mxN];
ll dp[2][mxN];
bool vis[mxN];

void dij(int sc, ll arr[]){
    F0R(i, n) arr[i] = infLL;
    arr[sc] = 0;
    priority_queue<T, vector<T>, greater<T>> pq;
    pq.push({0, sc});
    while(!pq.empty()){
        int U = pq.top().s; ll dU = pq.top().f;
        pq.pop();
        if(dU!=arr[U]) continue;
        trav(V, adj[U]){
            if(ckmin(arr[V.f], arr[U]+V.s)){
                pq.push({arr[V.f], V.f});
            }
        }
    }
}

void dij2(int sc, int en){
    F0R(i, n) dist[i] = dp[0][i] = dp[1][i] = infLL, vis[i] = 0;
    priority_queue<T2, vector<T2>, greater<T2>> pq;
    pq.push({0, {sc, -1}});
    while(!pq.empty()){
        int U = pq.top().s.f, P = pq.top().s.s; ll dU = pq.top().f;
        //cout << U << ' ' << P << ' ' << dU << '\n';
        pq.pop();
        if(!vis[U]){
            dist[U] = dU;
            vis[U] = 1;
            dp[0][U] = du[U];
            dp[1][U] = dv[U];
            if(P!=-1) {
                ckmin(dp[0][U], dp[0][P]);
                ckmin(dp[1][U], dp[1][P]);
            }
            trav(V, adj[U]) pq.push({dU+V.s, {V.f, U}});
        }
        else if(dU==dist[U]){
            if(min(dp[0][P], du[U])+min(dp[1][P], dv[U])<dp[0][U]+dp[1][U]){
                dp[0][U]=min(dp[0][P], du[U]);
                dp[1][U]=min(dp[1][P], dv[U]);
            }
        }
    }
    ckmin(ans, dp[0][en]+dp[1][en]);
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> s >> t >> u >> v;
    s--; t--; u--; v--;
    F0R(i, m){
        int e1, e2; ll e3; 
        cin >> e1 >> e2 >> e3;
        e1--; e2--; 
        adj[e1].pb({e2, e3});
        adj[e2].pb({e1, e3});
    }
    dij(u, du); dij(v, dv);
    ans = du[v];
    dij2(s, t); dij2(t, s);
    cout << ans << nl;
    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 515 ms 26516 KB Output is correct
2 Correct 464 ms 26060 KB Output is correct
3 Correct 463 ms 25612 KB Output is correct
4 Correct 521 ms 25784 KB Output is correct
5 Correct 452 ms 23488 KB Output is correct
6 Correct 522 ms 26168 KB Output is correct
7 Correct 462 ms 25896 KB Output is correct
8 Correct 484 ms 26052 KB Output is correct
9 Correct 515 ms 26180 KB Output is correct
10 Correct 453 ms 26028 KB Output is correct
11 Correct 164 ms 14444 KB Output is correct
12 Correct 540 ms 26380 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 26248 KB Output is correct
2 Correct 463 ms 23520 KB Output is correct
3 Correct 487 ms 25728 KB Output is correct
4 Correct 524 ms 23664 KB Output is correct
5 Correct 459 ms 23460 KB Output is correct
6 Correct 476 ms 25612 KB Output is correct
7 Correct 479 ms 23700 KB Output is correct
8 Correct 467 ms 23688 KB Output is correct
9 Correct 471 ms 23368 KB Output is correct
10 Correct 468 ms 25776 KB Output is correct
11 Correct 171 ms 14444 KB Output is correct
12 Correct 453 ms 25636 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 7332 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 62 ms 9392 KB Output is correct
5 Correct 27 ms 7980 KB Output is correct
6 Correct 5 ms 5228 KB Output is correct
7 Correct 6 ms 5356 KB Output is correct
8 Correct 7 ms 5356 KB Output is correct
9 Correct 5 ms 5228 KB Output is correct
10 Correct 27 ms 7992 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 5 ms 5228 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 515 ms 26516 KB Output is correct
2 Correct 464 ms 26060 KB Output is correct
3 Correct 463 ms 25612 KB Output is correct
4 Correct 521 ms 25784 KB Output is correct
5 Correct 452 ms 23488 KB Output is correct
6 Correct 522 ms 26168 KB Output is correct
7 Correct 462 ms 25896 KB Output is correct
8 Correct 484 ms 26052 KB Output is correct
9 Correct 515 ms 26180 KB Output is correct
10 Correct 453 ms 26028 KB Output is correct
11 Correct 164 ms 14444 KB Output is correct
12 Correct 540 ms 26380 KB Output is correct
13 Correct 502 ms 26248 KB Output is correct
14 Correct 463 ms 23520 KB Output is correct
15 Correct 487 ms 25728 KB Output is correct
16 Correct 524 ms 23664 KB Output is correct
17 Correct 459 ms 23460 KB Output is correct
18 Correct 476 ms 25612 KB Output is correct
19 Correct 479 ms 23700 KB Output is correct
20 Correct 467 ms 23688 KB Output is correct
21 Correct 471 ms 23368 KB Output is correct
22 Correct 468 ms 25776 KB Output is correct
23 Correct 171 ms 14444 KB Output is correct
24 Correct 453 ms 25636 KB Output is correct
25 Correct 35 ms 7332 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 62 ms 9392 KB Output is correct
29 Correct 27 ms 7980 KB Output is correct
30 Correct 5 ms 5228 KB Output is correct
31 Correct 6 ms 5356 KB Output is correct
32 Correct 7 ms 5356 KB Output is correct
33 Correct 5 ms 5228 KB Output is correct
34 Correct 27 ms 7992 KB Output is correct
35 Correct 4 ms 5100 KB Output is correct
36 Correct 4 ms 5100 KB Output is correct
37 Correct 4 ms 5100 KB Output is correct
38 Correct 5 ms 5228 KB Output is correct
39 Correct 4 ms 5228 KB Output is correct
40 Correct 479 ms 25624 KB Output is correct
41 Correct 492 ms 26184 KB Output is correct
42 Correct 492 ms 26276 KB Output is correct
43 Correct 178 ms 14316 KB Output is correct
44 Correct 182 ms 14572 KB Output is correct
45 Correct 453 ms 22848 KB Output is correct
46 Correct 468 ms 22592 KB Output is correct
47 Correct 496 ms 23492 KB Output is correct
48 Correct 208 ms 14444 KB Output is correct
49 Correct 451 ms 24876 KB Output is correct
50 Correct 455 ms 22704 KB Output is correct
51 Correct 442 ms 22600 KB Output is correct