oj.uz

답안 #492651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492651 2021-12-08T09:54:52 Z leu_naut Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 601 ms 35432 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define FOR(i,a,b) for (int i = a; i <= b; ++i)
#define FORd(i,a,b) for (int i = a; i >= b; --i)
#define pii pair <ll,ll>
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0);
#define tri pair <ll,pii>
#define f first
#define s second

const int N = 2e5;
const int MOD = 1e9 + 7;
const ll oo = 1e18;

vector <pii> g[N + 5];
ll Du[N + 5], Dv[N + 5], ans = LLONG_MAX, D[N + 5], vs[N + 5], dp[2][N + 5],n;

void dijsktra_u(int x)
{
    memset(vs,0,sizeof(vs));
    for (int i = 1; i <= n; ++i) Du[i] = oo;
    Du[x] = 0;
    priority_queue <pii> q;
    q.push(pii(0,x));
    while (!q.empty()) {
        ll u,w;
        tie(w,u) = q.top();
        q.pop();
        if (!vs[u]) {
            vs[u] = 1;
            Du[u] = -w;
            for (auto i : g[u]) q.push(pii(w - i.s,i.f));
        }
    }
}

void dijsktra_v(int x)
{
    memset(vs,0,sizeof(vs));
    for (int i = 1; i <= n; ++i) Dv[i] = oo;
    Dv[x] = 0;
    priority_queue <pii> q;
    q.push(pii(0,x));
    while (!q.empty()) {
        ll u,w;
        tie(w,u) = q.top();
        q.pop();
        if (!vs[u]) {
            vs[u] = 1;
            Dv[u] = -w;
            for (auto i : g[u]) q.push(pii(w - i.s, i.f));
        }
    }
}

void dijsktra(int x, int y)
{
    memset(vs,0,sizeof(vs));
    FOR(i,0,n) dp[0][i] = oo, dp[1][i] = oo, D[i] = oo;
    D[x] = 0;
    priority_queue <tri> q;
    q.push(tri(0,pii(x,0)));
    while (!q.empty()) {
        ll w,u,par;
        pii z;
        tie(w,z) = q.top();
        q.pop();
        tie(u,par) = z;
        if (!vs[u]) {
            vs[u] = 1;
            D[u] = -w;
            dp[0][u] = min(Du[u], dp[0][par]);
            dp[1][u] = min(Dv[u], dp[1][par]);
            for (auto i : g[u])
                q.push(tri(w - i.s, pii(i.f,u)));
        }
        else if (D[u] == -w) {
            ll tmp1 = min(Du[u], dp[0][par]), tmp2 = min(Dv[u], dp[1][par]);
            if (tmp1 + tmp2 <= dp[0][u] + dp[1][u]) {
                dp[0][u] = min(dp[0][par],tmp1);
                dp[1][u] = min(dp[1][par],tmp2);
            }
        }
    }
    ans = min(ans, dp[0][y] + dp[1][y]);
}

int main()
{

    FastIO
    ll m,s,t,u,v;
    cin >> n >> m >> s >> t >> u >> v;
    FOR(i,1,m)
    {
        int u,v,w;
        cin >> u >> v >> w;
        g[u].push_back(pii(v,w));
        g[v].push_back(pii(u,w));
    }
    dijsktra_u(u);
    dijsktra_v(v);
    ans = min(ans, Du[v]);
    dijsktra(s,t);
    //cout << dp[0][5] << ' ' << dp[1][5] << '\n';
    dijsktra(t,s);
    cout << ans;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 595 ms 34916 KB Output is correct
2 Correct 490 ms 33968 KB Output is correct
3 Correct 457 ms 33812 KB Output is correct
4 Correct 601 ms 33972 KB Output is correct
5 Correct 499 ms 30472 KB Output is correct
6 Correct 546 ms 34736 KB Output is correct
7 Correct 481 ms 33812 KB Output is correct
8 Correct 453 ms 34236 KB Output is correct
9 Correct 505 ms 35260 KB Output is correct
10 Correct 500 ms 35320 KB Output is correct
11 Correct 124 ms 17660 KB Output is correct
12 Correct 547 ms 35432 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 554 ms 34568 KB Output is correct
2 Correct 466 ms 30356 KB Output is correct
3 Correct 500 ms 33756 KB Output is correct
4 Correct 499 ms 30472 KB Output is correct
5 Correct 452 ms 30180 KB Output is correct
6 Correct 503 ms 33828 KB Output is correct
7 Correct 468 ms 30176 KB Output is correct
8 Correct 455 ms 30580 KB Output is correct
9 Correct 490 ms 30180 KB Output is correct
10 Correct 475 ms 33636 KB Output is correct
11 Correct 124 ms 17828 KB Output is correct
12 Correct 469 ms 33980 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 9772 KB Output is correct
2 Correct 5 ms 6604 KB Output is correct
3 Correct 4 ms 6684 KB Output is correct
4 Correct 74 ms 12876 KB Output is correct
5 Correct 38 ms 10732 KB Output is correct
6 Correct 5 ms 6824 KB Output is correct
7 Correct 7 ms 6988 KB Output is correct
8 Correct 10 ms 6988 KB Output is correct
9 Correct 6 ms 6732 KB Output is correct
10 Correct 39 ms 10672 KB Output is correct
11 Correct 4 ms 6556 KB Output is correct
12 Correct 3 ms 6604 KB Output is correct
13 Correct 4 ms 6688 KB Output is correct
14 Correct 4 ms 6692 KB Output is correct
15 Correct 4 ms 6732 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 595 ms 34916 KB Output is correct
2 Correct 490 ms 33968 KB Output is correct
3 Correct 457 ms 33812 KB Output is correct
4 Correct 601 ms 33972 KB Output is correct
5 Correct 499 ms 30472 KB Output is correct
6 Correct 546 ms 34736 KB Output is correct
7 Correct 481 ms 33812 KB Output is correct
8 Correct 453 ms 34236 KB Output is correct
9 Correct 505 ms 35260 KB Output is correct
10 Correct 500 ms 35320 KB Output is correct
11 Correct 124 ms 17660 KB Output is correct
12 Correct 547 ms 35432 KB Output is correct
13 Correct 554 ms 34568 KB Output is correct
14 Correct 466 ms 30356 KB Output is correct
15 Correct 500 ms 33756 KB Output is correct
16 Correct 499 ms 30472 KB Output is correct
17 Correct 452 ms 30180 KB Output is correct
18 Correct 503 ms 33828 KB Output is correct
19 Correct 468 ms 30176 KB Output is correct
20 Correct 455 ms 30580 KB Output is correct
21 Correct 490 ms 30180 KB Output is correct
22 Correct 475 ms 33636 KB Output is correct
23 Correct 124 ms 17828 KB Output is correct
24 Correct 469 ms 33980 KB Output is correct
25 Correct 38 ms 9772 KB Output is correct
26 Correct 5 ms 6604 KB Output is correct
27 Correct 4 ms 6684 KB Output is correct
28 Correct 74 ms 12876 KB Output is correct
29 Correct 38 ms 10732 KB Output is correct
30 Correct 5 ms 6824 KB Output is correct
31 Correct 7 ms 6988 KB Output is correct
32 Correct 10 ms 6988 KB Output is correct
33 Correct 6 ms 6732 KB Output is correct
34 Correct 39 ms 10672 KB Output is correct
35 Correct 4 ms 6556 KB Output is correct
36 Correct 3 ms 6604 KB Output is correct
37 Correct 4 ms 6688 KB Output is correct
38 Correct 4 ms 6692 KB Output is correct
39 Correct 4 ms 6732 KB Output is correct
40 Correct 523 ms 34760 KB Output is correct
41 Correct 501 ms 35160 KB Output is correct
42 Correct 540 ms 35196 KB Output is correct
43 Correct 194 ms 17864 KB Output is correct
44 Correct 143 ms 17880 KB Output is correct
45 Correct 488 ms 28976 KB Output is correct
46 Correct 454 ms 28660 KB Output is correct
47 Correct 555 ms 30428 KB Output is correct
48 Correct 148 ms 17276 KB Output is correct
49 Correct 549 ms 33188 KB Output is correct
50 Correct 480 ms 29096 KB Output is correct
51 Correct 455 ms 29028 KB Output is correct