oj.uz

답안 #373266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373266 2021-03-04T00:54:16 Z ja_kingy Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 440 ms 28504 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;

const ll MXN = 1e5+1, INF = 1e18;
ll n,m,s,t,u,v,disS[MXN],disU[MXN],disV[MXN],ans;
vector<pii> adj[MXN];
pii cache[MXN][2];

void dijk(int s, ll* dis) {
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    fill(dis, dis+n+1, INF);
    pq.emplace(0, s);
    dis[s] = 0;
    while (pq.size()) {
        pii u = pq.top(); pq.pop();
        if (u.first != dis[u.second]) continue;
        for (pii e: adj[u.second]) {
            ll nw = e.second + u.first;
            if (nw < dis[e.first]) {
                dis[e.first] = nw;
                pq.emplace(nw, e.first);
            }            
        }
    }
}

pii dp(int u, int dir) {
    if (cache[u][dir].first < 0) {
        cache[u][dir] = {INF, INF};
        for (pii e: adj[u]) {
            ll nw = disS[u] + (dir ? e.second : -e.second);
            if (nw == disS[e.first]) {
                pii res = dp(e.first, dir);
                cache[u][dir].first = min(cache[u][dir].first, res.first);
                cache[u][dir].second = min(cache[u][dir].second, res.second);
            }            
        }
        if (cache[u][dir].first != INF || u == (dir ? t : s)) {
            cache[u][dir].first = min(cache[u][dir].first, disU[u]);
            cache[u][dir].second = min(cache[u][dir].second, disV[u]);            
        }
    }
    return cache[u][dir];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> s >> t >> u >> v;
    for (int i = 0,a,b,c; i < m; ++i) {
        cin >> a >> b >> c;
        adj[a].emplace_back(b,c);
        adj[b].emplace_back(a,c);
    }
    dijk(s, disS);
    dijk(u, disU);
    dijk(v, disV);
    fill(&cache[0][0], &cache[n+1][0], make_pair(-1,-1));
    ans = disU[v];
    for (int i = 1; i <= n; ++i) {
        pii be = dp(i,1), ab = dp(i,0);
        ans = min({ans, ab.first + be.second, ab.second + be.first});
    }
    cout << ans;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 22468 KB Output is correct
2 Correct 346 ms 22476 KB Output is correct
3 Correct 367 ms 25244 KB Output is correct
4 Correct 340 ms 22588 KB Output is correct
5 Correct 343 ms 22140 KB Output is correct
6 Correct 367 ms 22656 KB Output is correct
7 Correct 352 ms 22240 KB Output is correct
8 Correct 351 ms 22388 KB Output is correct
9 Correct 363 ms 23176 KB Output is correct
10 Correct 320 ms 23244 KB Output is correct
11 Correct 182 ms 19180 KB Output is correct
12 Correct 367 ms 22908 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 369 ms 24576 KB Output is correct
2 Correct 386 ms 24400 KB Output is correct
3 Correct 378 ms 25560 KB Output is correct
4 Correct 384 ms 25872 KB Output is correct
5 Correct 352 ms 25356 KB Output is correct
6 Correct 346 ms 26156 KB Output is correct
7 Correct 375 ms 28504 KB Output is correct
8 Correct 367 ms 25236 KB Output is correct
9 Correct 440 ms 24260 KB Output is correct
10 Correct 382 ms 26088 KB Output is correct
11 Correct 194 ms 19692 KB Output is correct
12 Correct 349 ms 25776 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4460 KB Output is correct
2 Correct 3 ms 2796 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 19 ms 6252 KB Output is correct
5 Correct 11 ms 4460 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 4 ms 2924 KB Output is correct
9 Correct 3 ms 2896 KB Output is correct
10 Correct 10 ms 4460 KB Output is correct
11 Correct 2 ms 2796 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 22468 KB Output is correct
2 Correct 346 ms 22476 KB Output is correct
3 Correct 367 ms 25244 KB Output is correct
4 Correct 340 ms 22588 KB Output is correct
5 Correct 343 ms 22140 KB Output is correct
6 Correct 367 ms 22656 KB Output is correct
7 Correct 352 ms 22240 KB Output is correct
8 Correct 351 ms 22388 KB Output is correct
9 Correct 363 ms 23176 KB Output is correct
10 Correct 320 ms 23244 KB Output is correct
11 Correct 182 ms 19180 KB Output is correct
12 Correct 367 ms 22908 KB Output is correct
13 Correct 369 ms 24576 KB Output is correct
14 Correct 386 ms 24400 KB Output is correct
15 Correct 378 ms 25560 KB Output is correct
16 Correct 384 ms 25872 KB Output is correct
17 Correct 352 ms 25356 KB Output is correct
18 Correct 346 ms 26156 KB Output is correct
19 Correct 375 ms 28504 KB Output is correct
20 Correct 367 ms 25236 KB Output is correct
21 Correct 440 ms 24260 KB Output is correct
22 Correct 382 ms 26088 KB Output is correct
23 Correct 194 ms 19692 KB Output is correct
24 Correct 349 ms 25776 KB Output is correct
25 Correct 12 ms 4460 KB Output is correct
26 Correct 3 ms 2796 KB Output is correct
27 Correct 2 ms 2796 KB Output is correct
28 Correct 19 ms 6252 KB Output is correct
29 Correct 11 ms 4460 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 3 ms 2924 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 3 ms 2896 KB Output is correct
34 Correct 10 ms 4460 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 2 ms 2796 KB Output is correct
37 Correct 2 ms 2796 KB Output is correct
38 Correct 3 ms 2796 KB Output is correct
39 Correct 3 ms 2796 KB Output is correct
40 Correct 338 ms 22304 KB Output is correct
41 Correct 346 ms 22944 KB Output is correct
42 Correct 366 ms 23012 KB Output is correct
43 Correct 172 ms 18952 KB Output is correct
44 Correct 177 ms 19180 KB Output is correct
45 Correct 346 ms 23092 KB Output is correct
46 Correct 364 ms 22128 KB Output is correct
47 Correct 356 ms 22452 KB Output is correct
48 Correct 198 ms 16364 KB Output is correct
49 Correct 311 ms 21920 KB Output is correct
50 Correct 342 ms 22340 KB Output is correct
51 Correct 344 ms 22368 KB Output is correct