oj.uz

Submission #88269

# Submission time Handle Problem Language Result Execution time Memory
88269 2018-12-05T03:35:08 Z tieunhi Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 585 ms 76516 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define PB push_back
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define N 100005
#define maxc 1ll*100000000000000007
#define ll long long

using namespace std;

int n, m, S, T, U, V, in[N];
ll ans[N], ans2[N], d[5][N];
vector<int> g[N];
vector<pii> a[N];
void setup()
{
    cin >> n >> m >> S >> T >> U >> V;
    FOR(i, 1, m)
    {
        int u, v, w; cin >> u >> v >> w;
        a[u].PB(mp(v, w));
        a[v].PB(mp(u, w));
    }
}
void IJK(int s, ll dis[])
{
    FOR(i, 1, n) dis[i] = maxc;
    dis[s] = 0;
    priority_queue<pair<ll, int> > q;
    q.push(mp(0, s));
    while (!q.empty())
    {
        int u = q.top().S;
        ll l = -q.top().F;
        q.pop();
        if (dis[u] < l) continue;
        for (auto z : a[u])
        {
            int v = z.F;
            int w = z.S;
            if (dis[v] > l + w)
            {
                dis[v] = l + w;
                q.push(mp(-dis[v], v));
            }
        }
    }
}
void add_edge(int u, int v)
{
    g[v].PB(u);
    in[u]++;
}
void solve()
{
    IJK(S, d[1]);
    IJK(T, d[2]);
    FOR(u, 1, n)
        for (auto z : a[u])
        {
            int v = z.F;
            int w = z.S;
            if (d[1][u] + d[2][v] + w == d[1][T])
                add_edge(u, v);
        }
    IJK(U, d[3]);
    IJK(V, d[4]);
    FOR(i, 1, n) ans[i] = d[4][i], ans2[i] = d[3][i];
    queue<int> q;
    q.push(T);
    ll res = d[3][V];
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        ll l = ans[u];
        ll l2 = ans2[u];
        res = min(res, l + d[3][u]);
        res = min(res, l2 + d[4][u]);
        for (auto v : g[u])
        {
            ans[v] = min(ans[v], ans[u]);
            ans2[v] = min(ans2[v], ans2[u]);
            in[v]--;
            if (in[v] == 0) q.push(v);
        }
    }
    cout <<res;
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("INP.TXT", "r", stdin);
    setup();
    solve();
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 21596 KB Output is correct
2 Correct 419 ms 24600 KB Output is correct
3 Correct 418 ms 30956 KB Output is correct
4 Correct 470 ms 32708 KB Output is correct
5 Correct 458 ms 36432 KB Output is correct
6 Correct 476 ms 40060 KB Output is correct
7 Correct 578 ms 43920 KB Output is correct
8 Correct 567 ms 47232 KB Output is correct
9 Correct 491 ms 49972 KB Output is correct
10 Correct 423 ms 54228 KB Output is correct
11 Correct 256 ms 54700 KB Output is correct
12 Correct 509 ms 60712 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 65180 KB Output is correct
2 Correct 556 ms 68796 KB Output is correct
3 Correct 528 ms 71960 KB Output is correct
4 Correct 539 ms 73712 KB Output is correct
5 Correct 573 ms 73904 KB Output is correct
6 Correct 533 ms 74360 KB Output is correct
7 Correct 534 ms 74788 KB Output is correct
8 Correct 585 ms 74788 KB Output is correct
9 Correct 537 ms 74788 KB Output is correct
10 Correct 526 ms 74788 KB Output is correct
11 Correct 243 ms 74788 KB Output is correct
12 Correct 506 ms 74788 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 74788 KB Output is correct
2 Correct 8 ms 74788 KB Output is correct
3 Correct 8 ms 74788 KB Output is correct
4 Correct 23 ms 74788 KB Output is correct
5 Correct 16 ms 74788 KB Output is correct
6 Correct 8 ms 74788 KB Output is correct
7 Correct 8 ms 74788 KB Output is correct
8 Correct 8 ms 74788 KB Output is correct
9 Correct 8 ms 74788 KB Output is correct
10 Correct 18 ms 74788 KB Output is correct
11 Correct 7 ms 74788 KB Output is correct
12 Correct 8 ms 74788 KB Output is correct
13 Correct 8 ms 74788 KB Output is correct
14 Correct 8 ms 74788 KB Output is correct
15 Correct 8 ms 74788 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 21596 KB Output is correct
2 Correct 419 ms 24600 KB Output is correct
3 Correct 418 ms 30956 KB Output is correct
4 Correct 470 ms 32708 KB Output is correct
5 Correct 458 ms 36432 KB Output is correct
6 Correct 476 ms 40060 KB Output is correct
7 Correct 578 ms 43920 KB Output is correct
8 Correct 567 ms 47232 KB Output is correct
9 Correct 491 ms 49972 KB Output is correct
10 Correct 423 ms 54228 KB Output is correct
11 Correct 256 ms 54700 KB Output is correct
12 Correct 509 ms 60712 KB Output is correct
13 Correct 525 ms 65180 KB Output is correct
14 Correct 556 ms 68796 KB Output is correct
15 Correct 528 ms 71960 KB Output is correct
16 Correct 539 ms 73712 KB Output is correct
17 Correct 573 ms 73904 KB Output is correct
18 Correct 533 ms 74360 KB Output is correct
19 Correct 534 ms 74788 KB Output is correct
20 Correct 585 ms 74788 KB Output is correct
21 Correct 537 ms 74788 KB Output is correct
22 Correct 526 ms 74788 KB Output is correct
23 Correct 243 ms 74788 KB Output is correct
24 Correct 506 ms 74788 KB Output is correct
25 Correct 17 ms 74788 KB Output is correct
26 Correct 8 ms 74788 KB Output is correct
27 Correct 8 ms 74788 KB Output is correct
28 Correct 23 ms 74788 KB Output is correct
29 Correct 16 ms 74788 KB Output is correct
30 Correct 8 ms 74788 KB Output is correct
31 Correct 8 ms 74788 KB Output is correct
32 Correct 8 ms 74788 KB Output is correct
33 Correct 8 ms 74788 KB Output is correct
34 Correct 18 ms 74788 KB Output is correct
35 Correct 7 ms 74788 KB Output is correct
36 Correct 8 ms 74788 KB Output is correct
37 Correct 8 ms 74788 KB Output is correct
38 Correct 8 ms 74788 KB Output is correct
39 Correct 8 ms 74788 KB Output is correct
40 Correct 443 ms 74788 KB Output is correct
41 Correct 457 ms 74788 KB Output is correct
42 Correct 469 ms 74788 KB Output is correct
43 Correct 249 ms 74788 KB Output is correct
44 Correct 239 ms 74788 KB Output is correct
45 Correct 526 ms 76516 KB Output is correct
46 Correct 451 ms 76516 KB Output is correct
47 Correct 384 ms 76516 KB Output is correct
48 Correct 254 ms 76516 KB Output is correct
49 Correct 400 ms 76516 KB Output is correct
50 Correct 517 ms 76516 KB Output is correct
51 Correct 522 ms 76516 KB Output is correct