oj.uz

Submission #250701

# Submission time Handle Problem Language Result Execution time Memory
250701 2020-07-18T19:18:29 Z mat_v Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 603 ms 23992 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<ll,ll>
#define N 100005

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


int n,m;
int s,t;
int u,v;

vector<pii> graf[N];
ll dist[N][4];

void djikstra(int x, int idx){
    priority_queue<pii> pq;
    pq.push({0,x});
    ff(i,1,n){
        dist[i][idx] = 1e8;
        dist[i][idx] *= dist[i][idx];
    }
    dist[x][idx] = 0;
    while(!pq.empty()){
        pii sta = pq.top();
        pq.pop();
        int tr = sta.yy;
        ll duz = -sta.xx;
        if(dist[tr][idx] != duz)continue;
        for(auto c:graf[tr]){
            if(dist[c.xx][idx] > duz + c.yy){
                dist[c.xx][idx] = duz + c.yy;
                pq.push({-dist[c.xx][idx], c.xx});
            }
        }
    }
}


int gidx;

ll dp[N][2];
bool bio[N][2];

ll resi(int x){
    if(bio[x][gidx])return dp[x][gidx];
    bio[x][gidx] = 1;
    dp[x][gidx] = dist[x][3];
    for(auto c:graf[x]){
        if(dist[c.xx][gidx] + c.yy == dist[x][gidx]){
            dp[x][gidx] = min(dp[x][gidx], resi(c.xx));
        }
    }
    return dp[x][gidx];
}

void init(int x){
    bio[x][gidx] = 1;
    dp[x][gidx] = dist[x][3];
    ff(i,1,n){
        if(!bio[i][gidx])dp[i][gidx] = resi(i);
    }
}


int main()
{

    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> m >> s >> t >> u >> v;
    ff(i,0,m - 1){
        ll a,b,c;
        cin >> a >> b >> c;
        graf[a].pb({b,c});
        graf[b].pb({a,c});
    }
    djikstra(s,0);
    djikstra(t,1);
    djikstra(u,2);
    djikstra(v,3);

    gidx = 0;
    init(s);

    gidx = 1;
    init(t);
    ll res = dist[v][2];
    ff(i,1,n){
        if(!(dist[i][0] + dist[i][1] == dist[t][0]))continue;
        res = min(res, dist[i][2] + min(dp[i][0], dp[i][1]));
    }
    cout << res << "\n";
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 519 ms 19524 KB Output is correct
2 Correct 541 ms 18372 KB Output is correct
3 Correct 494 ms 21712 KB Output is correct
4 Correct 384 ms 19348 KB Output is correct
5 Correct 487 ms 18500 KB Output is correct
6 Correct 465 ms 19684 KB Output is correct
7 Correct 443 ms 18476 KB Output is correct
8 Correct 603 ms 18352 KB Output is correct
9 Correct 413 ms 18284 KB Output is correct
10 Correct 350 ms 22816 KB Output is correct
11 Correct 263 ms 17272 KB Output is correct
12 Correct 491 ms 22412 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 19504 KB Output is correct
2 Correct 457 ms 19312 KB Output is correct
3 Correct 463 ms 20208 KB Output is correct
4 Correct 540 ms 20340 KB Output is correct
5 Correct 600 ms 20092 KB Output is correct
6 Correct 484 ms 20496 KB Output is correct
7 Correct 455 ms 20972 KB Output is correct
8 Correct 437 ms 20072 KB Output is correct
9 Correct 510 ms 19300 KB Output is correct
10 Correct 549 ms 19460 KB Output is correct
11 Correct 261 ms 15480 KB Output is correct
12 Correct 476 ms 23992 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4224 KB Output is correct
2 Correct 3 ms 2816 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 19 ms 5504 KB Output is correct
5 Correct 12 ms 4224 KB Output is correct
6 Correct 3 ms 2816 KB Output is correct
7 Correct 3 ms 2944 KB Output is correct
8 Correct 4 ms 2944 KB Output is correct
9 Correct 3 ms 2816 KB Output is correct
10 Correct 10 ms 4208 KB Output is correct
11 Correct 3 ms 2688 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 4 ms 2816 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 519 ms 19524 KB Output is correct
2 Correct 541 ms 18372 KB Output is correct
3 Correct 494 ms 21712 KB Output is correct
4 Correct 384 ms 19348 KB Output is correct
5 Correct 487 ms 18500 KB Output is correct
6 Correct 465 ms 19684 KB Output is correct
7 Correct 443 ms 18476 KB Output is correct
8 Correct 603 ms 18352 KB Output is correct
9 Correct 413 ms 18284 KB Output is correct
10 Correct 350 ms 22816 KB Output is correct
11 Correct 263 ms 17272 KB Output is correct
12 Correct 491 ms 22412 KB Output is correct
13 Correct 433 ms 19504 KB Output is correct
14 Correct 457 ms 19312 KB Output is correct
15 Correct 463 ms 20208 KB Output is correct
16 Correct 540 ms 20340 KB Output is correct
17 Correct 600 ms 20092 KB Output is correct
18 Correct 484 ms 20496 KB Output is correct
19 Correct 455 ms 20972 KB Output is correct
20 Correct 437 ms 20072 KB Output is correct
21 Correct 510 ms 19300 KB Output is correct
22 Correct 549 ms 19460 KB Output is correct
23 Correct 261 ms 15480 KB Output is correct
24 Correct 476 ms 23992 KB Output is correct
25 Correct 11 ms 4224 KB Output is correct
26 Correct 3 ms 2816 KB Output is correct
27 Correct 2 ms 2816 KB Output is correct
28 Correct 19 ms 5504 KB Output is correct
29 Correct 12 ms 4224 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 3 ms 2944 KB Output is correct
32 Correct 4 ms 2944 KB Output is correct
33 Correct 3 ms 2816 KB Output is correct
34 Correct 10 ms 4208 KB Output is correct
35 Correct 3 ms 2688 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 4 ms 2816 KB Output is correct
38 Correct 3 ms 2816 KB Output is correct
39 Correct 3 ms 2816 KB Output is correct
40 Correct 370 ms 23296 KB Output is correct
41 Correct 403 ms 22300 KB Output is correct
42 Correct 528 ms 22504 KB Output is correct
43 Correct 250 ms 17144 KB Output is correct
44 Correct 239 ms 17272 KB Output is correct
45 Correct 473 ms 22628 KB Output is correct
46 Correct 382 ms 21448 KB Output is correct
47 Correct 402 ms 23116 KB Output is correct
48 Correct 282 ms 15352 KB Output is correct
49 Correct 335 ms 22816 KB Output is correct
50 Correct 438 ms 21792 KB Output is correct
51 Correct 381 ms 21544 KB Output is correct