oj.uz

Submission #600536

# Submission time Handle Problem Language Result Execution time Memory
600536 2022-07-21T03:49:51 Z vbee Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 328 ms 20240 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define MASK(i) (1 << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define ll long long
#define pb push_back
#define TASK "task"

using namespace std;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}

const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int LOG = 18;
const int BASE = 323;
const int N = 1e5 + 7;

int n, m, s, t, u, v;
ll du[N], dv[N], ds[N], dp[2][N], ans;
vector<pair<int, int> > g[N];

void dijkstra1(int start, ll arr[]){
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>> > kew;
    kew.push({0, start});
    for (int i = 1; i <= n; i++) arr[i] = loo;
    arr[start] = 0;
    while (!kew.empty()){
        auto k = kew.top();
        kew.pop();
        if (arr[k.se] < k.fi) continue;
        for (auto u : g[k.se]){
            if (u.se + k.fi < arr[u.fi]){
                arr[u.fi] = u.se + k.fi;
                kew.push({arr[u.fi], u.fi});
            }
        }
    }
}

void dijkstra2(int start, int end){
    fill(dp[0], dp[0] + N - 1, loo);
    fill(dp[1], dp[1] + N - 1, loo);
    fill(ds, ds + N - 1, loo);
    priority_queue<pair<ll, ll>, vector<pair<ll, ll> >, greater<pair<ll, ll>> > kew;
    kew.push({0, start});
    dp[0][start] = du[start];
    dp[1][start] = dv[start];
    while (!kew.empty()){
        auto k = kew.top();
        kew.pop();
        if (ds[k.se] < k.fi) continue;
        for (auto u : g[k.se]){
            if (u.se + k.fi < ds[u.fi]){
                ds[u.fi] = u.se + k.fi;
                dp[0][u.fi] = min(du[u.fi], dp[0][k.se]);
                dp[1][u.fi] = min(dv[u.fi], dp[1][k.se]);
                kew.push({ds[u.fi], u.fi});
            }
            else if (u.se + k.fi == ds[u.fi]){
                if (min(du[u.fi], dp[0][k.se]) + min(dv[u.fi], dp[1][k.se]) <= dp[0][u.fi] + dp[1][u.fi]){
                    dp[0][u.fi] = min(du[u.fi], dp[0][k.se]);
                    dp[1][u.fi] = min(dv[u.fi], dp[1][k.se]);
                }
            }
        }
    }
    minimize(ans, dp[0][end] + dp[1][end]);
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    // freopen(TASK".inp", "r", stdin);
    // freopen(TASK".out", "w", stdout);
    cin >> n >> m >> s >> t >> u >> v;
    for (int i = 1; i <= m; i++){
        int a, b, c; cin >> a >> b >> c;
        g[a].pb({b, c});
        g[b].pb({a, c});
    }
    dijkstra1(u, du);
    dijkstra1(v, dv);
    ans = du[v];
    dijkstra2(s, t);
    dijkstra2(t, s);
    // for (int i = 1; i <= n; i++){
    //     cout << du[i] << " " << dv[i] << " " << ds[i] << "\n";
    // }
    cout << ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 19824 KB Output is correct
2 Correct 281 ms 18264 KB Output is correct
3 Correct 262 ms 19536 KB Output is correct
4 Correct 281 ms 18624 KB Output is correct
5 Correct 232 ms 17972 KB Output is correct
6 Correct 271 ms 19896 KB Output is correct
7 Correct 275 ms 18368 KB Output is correct
8 Correct 258 ms 18180 KB Output is correct
9 Correct 263 ms 18916 KB Output is correct
10 Correct 234 ms 18972 KB Output is correct
11 Correct 103 ms 11796 KB Output is correct
12 Correct 268 ms 18972 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 18508 KB Output is correct
2 Correct 276 ms 18224 KB Output is correct
3 Correct 299 ms 18104 KB Output is correct
4 Correct 258 ms 18268 KB Output is correct
5 Correct 286 ms 18204 KB Output is correct
6 Correct 250 ms 18452 KB Output is correct
7 Correct 273 ms 18256 KB Output is correct
8 Correct 328 ms 18128 KB Output is correct
9 Correct 271 ms 18212 KB Output is correct
10 Correct 300 ms 18140 KB Output is correct
11 Correct 98 ms 11712 KB Output is correct
12 Correct 239 ms 18524 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 6100 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 5 ms 5080 KB Output is correct
4 Correct 17 ms 7064 KB Output is correct
5 Correct 12 ms 6028 KB Output is correct
6 Correct 4 ms 5128 KB Output is correct
7 Correct 4 ms 5132 KB Output is correct
8 Correct 5 ms 5204 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 8 ms 6096 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5016 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 19824 KB Output is correct
2 Correct 281 ms 18264 KB Output is correct
3 Correct 262 ms 19536 KB Output is correct
4 Correct 281 ms 18624 KB Output is correct
5 Correct 232 ms 17972 KB Output is correct
6 Correct 271 ms 19896 KB Output is correct
7 Correct 275 ms 18368 KB Output is correct
8 Correct 258 ms 18180 KB Output is correct
9 Correct 263 ms 18916 KB Output is correct
10 Correct 234 ms 18972 KB Output is correct
11 Correct 103 ms 11796 KB Output is correct
12 Correct 268 ms 18972 KB Output is correct
13 Correct 259 ms 18508 KB Output is correct
14 Correct 276 ms 18224 KB Output is correct
15 Correct 299 ms 18104 KB Output is correct
16 Correct 258 ms 18268 KB Output is correct
17 Correct 286 ms 18204 KB Output is correct
18 Correct 250 ms 18452 KB Output is correct
19 Correct 273 ms 18256 KB Output is correct
20 Correct 328 ms 18128 KB Output is correct
21 Correct 271 ms 18212 KB Output is correct
22 Correct 300 ms 18140 KB Output is correct
23 Correct 98 ms 11712 KB Output is correct
24 Correct 239 ms 18524 KB Output is correct
25 Correct 10 ms 6100 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 5 ms 5080 KB Output is correct
28 Correct 17 ms 7064 KB Output is correct
29 Correct 12 ms 6028 KB Output is correct
30 Correct 4 ms 5128 KB Output is correct
31 Correct 4 ms 5132 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 8 ms 6096 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5016 KB Output is correct
40 Correct 254 ms 20240 KB Output is correct
41 Correct 251 ms 19104 KB Output is correct
42 Correct 253 ms 18960 KB Output is correct
43 Correct 146 ms 11816 KB Output is correct
44 Correct 89 ms 11768 KB Output is correct
45 Correct 216 ms 17860 KB Output is correct
46 Correct 246 ms 17536 KB Output is correct
47 Correct 253 ms 19616 KB Output is correct
48 Correct 101 ms 11212 KB Output is correct
49 Correct 239 ms 19752 KB Output is correct
50 Correct 228 ms 17836 KB Output is correct
51 Correct 237 ms 17700 KB Output is correct