oj.uz

답안 #678591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678591 2023-01-06T08:10:21 Z jahsdwaijsd Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 280 ms 21636 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#define taskname "bai3"
#define all(x) x.begin(), x.end()
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
using namespace std;
using cd = complex<double>;

const int mxN = 1e5 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int n, m, s, t, u, v;
ll dp[mxN][2][2];
vector<ll> from_u, from_v;
vector<pair<int, ll>> G[mxN];

vector<ll> dijkstra(int v) {
    vector<ll> res(n + 1, oo);
    vector<bool> vis(n + 1);
    res[v] = 0;
    priority_queue<pair<ll, int>> pq;
    pq.push({0, v});
    while(pq.size()) {
        pair<ll, int> top = pq.top(); pq.pop();
        if(vis[top.ss])
            continue;
        vis[top.ss] = true;
        for(auto [u, w] : G[top.ss]) {
            if(res[u] > res[top.ss] + w) {
                res[u] = res[top.ss] + w;
                pq.push({-res[u], u});
            }
        }
    }
    return res;
}

void dijkstra1(int s, int t) {
    vector<ll> res(n + 1, oo);
    for(int i = 1; i <= n; ++i)
        dp[i][0][0] = dp[i][0][1] = dp[i][1][0] = dp[i][1][1] = oo;
    vector<bool> vis(n + 1);
    priority_queue<pair<ll, int>> pq;
    res[s] = 0;
    dp[s][0][0] = 0;
    dp[s][0][1] = from_v[s];
    dp[s][1][0] = from_u[s];
    dp[s][1][1] = from_v[s] + from_u[s];
    pq.push({0, s});

    while(pq.size()) {
        pair<ll, int> top = pq.top(); pq.pop();
        if(vis[top.ss])
            continue;
        vis[top.ss] = true;
        for(auto [u, w] : G[top.ss]) {
            if(res[u] > res[top.ss] + w) {
                res[u] = res[top.ss] + w;
                pq.push({-res[u], u});
                dp[u][0][1] = min(dp[top.ss][0][1], from_v[u]);
                dp[u][1][0] = min(dp[top.ss][1][0], from_u[u]);
                dp[u][1][1] = min({dp[top.ss][1][1], dp[top.ss][0][1] + from_u[u], dp[top.ss][1][0] + from_v[u], from_v[u] + from_u[u]});
            }
            else if(res[u] == res[top.ss] + w) {
                dp[u][0][1] = min({dp[u][0][1], dp[top.ss][0][1], from_v[u]});
                dp[u][1][0] = min({dp[u][1][0], dp[top.ss][1][0], from_u[u]});
                dp[u][1][1] = min({dp[u][1][1], dp[top.ss][1][1], dp[top.ss][0][1] + from_u[u], dp[top.ss][1][0] + from_v[u], from_v[u] + from_u[u]});
            }
        }
    }
    cout << min(from_u[v], dp[t][1][1]) << "\n";
}

void solve() {
    cin >> n >> m;
    cin >> s >> t >> u >> v;
    for(int i = 1; i <= m; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        G[u].pb({v, w});
        G[v].pb({u, w});
    }
    from_u = dijkstra(u);
    from_v = dijkstra(v);
    dijkstra1(s, t);
}

signed main() {
#ifdef CDuongg
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
    auto end = chrono::high_resolution_clock::now();
    cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
    cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 21628 KB Output is correct
2 Correct 243 ms 20428 KB Output is correct
3 Correct 251 ms 20124 KB Output is correct
4 Correct 248 ms 20464 KB Output is correct
5 Correct 255 ms 20244 KB Output is correct
6 Correct 240 ms 21636 KB Output is correct
7 Correct 273 ms 20472 KB Output is correct
8 Correct 262 ms 20504 KB Output is correct
9 Correct 227 ms 20348 KB Output is correct
10 Correct 187 ms 20148 KB Output is correct
11 Correct 117 ms 13508 KB Output is correct
12 Correct 258 ms 20360 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 20512 KB Output is correct
2 Correct 260 ms 20496 KB Output is correct
3 Correct 244 ms 20424 KB Output is correct
4 Correct 250 ms 20408 KB Output is correct
5 Correct 246 ms 20412 KB Output is correct
6 Correct 240 ms 20136 KB Output is correct
7 Correct 225 ms 20392 KB Output is correct
8 Correct 251 ms 20396 KB Output is correct
9 Correct 253 ms 20496 KB Output is correct
10 Correct 256 ms 20408 KB Output is correct
11 Correct 109 ms 13384 KB Output is correct
12 Correct 241 ms 20156 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 3980 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 13 ms 5400 KB Output is correct
5 Correct 10 ms 4008 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 9 ms 4052 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 21628 KB Output is correct
2 Correct 243 ms 20428 KB Output is correct
3 Correct 251 ms 20124 KB Output is correct
4 Correct 248 ms 20464 KB Output is correct
5 Correct 255 ms 20244 KB Output is correct
6 Correct 240 ms 21636 KB Output is correct
7 Correct 273 ms 20472 KB Output is correct
8 Correct 262 ms 20504 KB Output is correct
9 Correct 227 ms 20348 KB Output is correct
10 Correct 187 ms 20148 KB Output is correct
11 Correct 117 ms 13508 KB Output is correct
12 Correct 258 ms 20360 KB Output is correct
13 Correct 275 ms 20512 KB Output is correct
14 Correct 260 ms 20496 KB Output is correct
15 Correct 244 ms 20424 KB Output is correct
16 Correct 250 ms 20408 KB Output is correct
17 Correct 246 ms 20412 KB Output is correct
18 Correct 240 ms 20136 KB Output is correct
19 Correct 225 ms 20392 KB Output is correct
20 Correct 251 ms 20396 KB Output is correct
21 Correct 253 ms 20496 KB Output is correct
22 Correct 256 ms 20408 KB Output is correct
23 Correct 109 ms 13384 KB Output is correct
24 Correct 241 ms 20156 KB Output is correct
25 Correct 8 ms 3980 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 13 ms 5400 KB Output is correct
29 Correct 10 ms 4008 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 9 ms 4052 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 208 ms 21120 KB Output is correct
41 Correct 280 ms 20396 KB Output is correct
42 Correct 244 ms 20448 KB Output is correct
43 Correct 100 ms 13340 KB Output is correct
44 Correct 100 ms 13420 KB Output is correct
45 Correct 237 ms 20060 KB Output is correct
46 Correct 220 ms 19996 KB Output is correct
47 Correct 245 ms 20280 KB Output is correct
48 Correct 113 ms 13388 KB Output is correct
49 Correct 205 ms 21220 KB Output is correct
50 Correct 199 ms 20048 KB Output is correct
51 Correct 235 ms 20088 KB Output is correct