oj.uz

Submission #298769

# Submission time Handle Problem Language Result Execution time Memory
298769 2020-09-14T02:02:39 Z HynDuf Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 410 ms 23164 KB 
#include <bits/stdc++.h>

#define task "C"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<ll, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 1e5 + 2;
const ll INF = 1e18;
int n, m, S, T, U, V;
ll dp[N], ans;
vii g[N];
vl dS, dT, dU, dV;
void dij(int r, vl &d)
{
    d.assign(n + 1, INF);
    d[r] = 0;
    priority_queue<ii, vii, greater<ii> > pq;
    pq.push({0, r});
    while (!pq.empty())
    {
        int u = pq.top().S;
        ll du = pq.top().F;
        pq.pop();
        if (du != d[u]) continue;
        for (ii v : g[u]) if (d[v.F] > du + v.S)
        {
            d[v.F] = du + v.S;
            pq.push({d[v.F], v.F});
        }
    }
}
bool in[N];
void updDP1(int u)
{
    in[u] = 1;
    dp[u] = dV[u];
    for (ii v : g[u]) if (dS[u] + v.S + dT[v.F] == dS[T])
    {
        if (!in[v.F]) updDP1(v.F);
        dp[u] = min(dp[u], dp[v.F]);
    }
    ans = min(ans, dU[u] + dp[u]);
}
void updDP(int u)
{
    in[u] = 1;
    dp[u] = dV[u];
    for (ii v : g[u]) if (dT[u] + v.S + dS[v.F] == dS[T])
    {
        if (!in[v.F]) updDP(v.F);
        dp[u] = min(dp[u], dp[v.F]);
    }
    ans = min(ans, dU[u] + dp[u]);
}
int main()
{
#ifdef HynDuf
    freopen(task".in", "r", stdin);
    //freopen(task".out", "w", stdout);
#else
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
#endif
    cin >> n >> m >> S >> T >> U >> V;
    rep(i, 1, m)
    {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].eb(v, w);
        g[v].eb(u, w);
    }
    dij(S, dS);
    dij(T, dT);
    dij(U, dU);
    dij(V, dV);
    ans = dU[V];
    fill(dp + 1, dp + 1 + n, INF);
    updDP(T);
    fill(dp + 1, dp + 1 + n, INF);
    fill(in + 1, in + 1 + n, 0);
    updDP1(S);
    cout << ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 19712 KB Output is correct
2 Correct 377 ms 18332 KB Output is correct
3 Correct 383 ms 21864 KB Output is correct
4 Correct 332 ms 19328 KB Output is correct
5 Correct 355 ms 18148 KB Output is correct
6 Correct 356 ms 19396 KB Output is correct
7 Correct 375 ms 17960 KB Output is correct
8 Correct 364 ms 18020 KB Output is correct
9 Correct 346 ms 18036 KB Output is correct
10 Correct 295 ms 18016 KB Output is correct
11 Correct 154 ms 13944 KB Output is correct
12 Correct 359 ms 18060 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 18672 KB Output is correct
2 Correct 380 ms 18812 KB Output is correct
3 Correct 380 ms 18544 KB Output is correct
4 Correct 380 ms 18700 KB Output is correct
5 Correct 394 ms 19364 KB Output is correct
6 Correct 389 ms 20044 KB Output is correct
7 Correct 408 ms 20344 KB Output is correct
8 Correct 410 ms 18804 KB Output is correct
9 Correct 378 ms 19096 KB Output is correct
10 Correct 384 ms 18552 KB Output is correct
11 Correct 177 ms 14968 KB Output is correct
12 Correct 394 ms 20408 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3968 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 18 ms 5376 KB Output is correct
5 Correct 10 ms 3968 KB Output is correct
6 Correct 3 ms 2944 KB Output is correct
7 Correct 3 ms 2816 KB Output is correct
8 Correct 4 ms 3072 KB Output is correct
9 Correct 3 ms 2816 KB Output is correct
10 Correct 11 ms 4352 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2816 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 3 ms 2816 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 19712 KB Output is correct
2 Correct 377 ms 18332 KB Output is correct
3 Correct 383 ms 21864 KB Output is correct
4 Correct 332 ms 19328 KB Output is correct
5 Correct 355 ms 18148 KB Output is correct
6 Correct 356 ms 19396 KB Output is correct
7 Correct 375 ms 17960 KB Output is correct
8 Correct 364 ms 18020 KB Output is correct
9 Correct 346 ms 18036 KB Output is correct
10 Correct 295 ms 18016 KB Output is correct
11 Correct 154 ms 13944 KB Output is correct
12 Correct 359 ms 18060 KB Output is correct
13 Correct 389 ms 18672 KB Output is correct
14 Correct 380 ms 18812 KB Output is correct
15 Correct 380 ms 18544 KB Output is correct
16 Correct 380 ms 18700 KB Output is correct
17 Correct 394 ms 19364 KB Output is correct
18 Correct 389 ms 20044 KB Output is correct
19 Correct 408 ms 20344 KB Output is correct
20 Correct 410 ms 18804 KB Output is correct
21 Correct 378 ms 19096 KB Output is correct
22 Correct 384 ms 18552 KB Output is correct
23 Correct 177 ms 14968 KB Output is correct
24 Correct 394 ms 20408 KB Output is correct
25 Correct 11 ms 3968 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 18 ms 5376 KB Output is correct
29 Correct 10 ms 3968 KB Output is correct
30 Correct 3 ms 2944 KB Output is correct
31 Correct 3 ms 2816 KB Output is correct
32 Correct 4 ms 3072 KB Output is correct
33 Correct 3 ms 2816 KB Output is correct
34 Correct 11 ms 4352 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2816 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 3 ms 2816 KB Output is correct
39 Correct 3 ms 2816 KB Output is correct
40 Correct 342 ms 23164 KB Output is correct
41 Correct 346 ms 22304 KB Output is correct
42 Correct 370 ms 22388 KB Output is correct
43 Correct 194 ms 16376 KB Output is correct
44 Correct 196 ms 16504 KB Output is correct
45 Correct 389 ms 21812 KB Output is correct
46 Correct 364 ms 20992 KB Output is correct
47 Correct 350 ms 23064 KB Output is correct
48 Correct 201 ms 14316 KB Output is correct
49 Correct 297 ms 22916 KB Output is correct
50 Correct 356 ms 21372 KB Output is correct
51 Correct 367 ms 21120 KB Output is correct