oj.uz

Submission #348535

# Submission time Handle Problem Language Result Execution time Memory
348535 2021-01-15T06:39:59 Z Mahdi_Shokoufi Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 530 ms 38288 KB 
//In the name of Allah
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair < int , int > pii;
typedef pair < ll , ll > pll;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())

const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
const ll inf = 1e18 + 10;

int S, T, U, V, mark[N];
ll ds[N], dt[N], du[N], dv[N], dpu[N], dpv[N], ans;
vector < pll > adj[N];
vector < int > dag[N], dag2[N], vec;
priority_queue < pll , vector < pll > , greater < pll > > pq;

void dij(int s, ll *dis){
    fill(dis, dis + N, inf);
    dis[s] = 0;
    pq.push(mp(0, s));
    while (sz(pq)){
        ll v = pq.top().Y, c = pq.top().X;
        pq.pop();
        if (c != dis[v])
            continue;
        for (pll e : adj[v]){
            ll u = e.X, w = e.Y;
            ll cp = c + w;
            if (cp < dis[u]){
                dis[u] = cp;
                pq.push(mp(dis[u], u));
            }
        }
    }
}

void dfs(int v){
    mark[v] = 1;
    for (int u : dag[v])
        if (!mark[u])
            dfs(u);
    vec.pb(v);
}


void dfs2(int v){
    mark[v] = 1;
    for (int u : dag2[v])
        if (!mark[u])
            dfs2(u);
    vec.pb(v);
}


int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m >> S >> T >> U >> V;
    for (int i = 0; i < m; i ++){
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].pb(mp(v, w));
        adj[v].pb(mp(u, w));
    }
    dij(S, ds);
    dij(T, dt);
    dij(U, du);
    dij(V, dv);
    for (int i = 1; i <= n; i ++)
        for (pll e : adj[i])
            if (ds[i] + e.Y == ds[e.X])
                dag[i].pb(e.X);
    for (int i = 1; i <= n; i ++)
        for (pll e : adj[i])
            if (dt[i] + e.Y == dt[e.X])
                dag2[i].pb(e.X);
    fill(dpu, dpu + N, inf);
    fill(dpv, dpv + N, inf);
    ans = du[V];
    dfs(S);
    reverse(all(vec));
    for (int v : vec){
        dpu[v] = min(dpu[v], du[v]);
        dpv[v] = min(dpv[v], dv[v]);
        if (ds[v] + dt[v] == ds[T]){
            ans = min(ans, du[v] + dpv[v]);
            ans = min(ans, dv[v] + dpu[v]);
        }
        for (int u : dag[v]){
            dpu[u] = min(dpu[u], dpu[v]);
            dpv[u] = min(dpv[u], dpv[v]);
        }
    }
    vec.clear();
    fill(mark, mark + N, 0);
    fill(dpu, dpu + N, inf);
    fill(dpv, dpv + N, inf);
    dfs2(T);
    reverse(all(vec));
    for (int v : vec){
        dpu[v] = min(dpu[v], du[v]);
        dpv[v] = min(dpv[v], dv[v]);
        if (ds[v] + dt[v] == ds[T]){
            ans = min(ans, du[v] + dpv[v]);
            ans = min(ans, dv[v] + dpu[v]);
        }
        for (int u : dag2[v]){
            dpu[u] = min(dpu[u], dpu[v]);
            dpv[u] = min(dpv[u], dpv[v]);
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 31452 KB Output is correct
2 Correct 468 ms 32608 KB Output is correct
3 Correct 467 ms 36840 KB Output is correct
4 Correct 443 ms 31968 KB Output is correct
5 Correct 455 ms 33632 KB Output is correct
6 Correct 432 ms 31332 KB Output is correct
7 Correct 474 ms 33892 KB Output is correct
8 Correct 464 ms 34016 KB Output is correct
9 Correct 435 ms 32096 KB Output is correct
10 Correct 384 ms 31840 KB Output is correct
11 Correct 250 ms 30948 KB Output is correct
12 Correct 475 ms 33632 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 34268 KB Output is correct
2 Correct 464 ms 34404 KB Output is correct
3 Correct 460 ms 34532 KB Output is correct
4 Correct 463 ms 34408 KB Output is correct
5 Correct 464 ms 34404 KB Output is correct
6 Correct 448 ms 36192 KB Output is correct
7 Correct 530 ms 38288 KB Output is correct
8 Correct 497 ms 34404 KB Output is correct
9 Correct 508 ms 34400 KB Output is correct
10 Correct 490 ms 34528 KB Output is correct
11 Correct 286 ms 30948 KB Output is correct
12 Correct 465 ms 36576 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14188 KB Output is correct
2 Correct 8 ms 12524 KB Output is correct
3 Correct 8 ms 12524 KB Output is correct
4 Correct 25 ms 15980 KB Output is correct
5 Correct 17 ms 14188 KB Output is correct
6 Correct 9 ms 12652 KB Output is correct
7 Correct 10 ms 12652 KB Output is correct
8 Correct 10 ms 12780 KB Output is correct
9 Correct 9 ms 12652 KB Output is correct
10 Correct 17 ms 14188 KB Output is correct
11 Correct 9 ms 12524 KB Output is correct
12 Correct 8 ms 12524 KB Output is correct
13 Correct 9 ms 12524 KB Output is correct
14 Correct 9 ms 12524 KB Output is correct
15 Correct 9 ms 12524 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 31452 KB Output is correct
2 Correct 468 ms 32608 KB Output is correct
3 Correct 467 ms 36840 KB Output is correct
4 Correct 443 ms 31968 KB Output is correct
5 Correct 455 ms 33632 KB Output is correct
6 Correct 432 ms 31332 KB Output is correct
7 Correct 474 ms 33892 KB Output is correct
8 Correct 464 ms 34016 KB Output is correct
9 Correct 435 ms 32096 KB Output is correct
10 Correct 384 ms 31840 KB Output is correct
11 Correct 250 ms 30948 KB Output is correct
12 Correct 475 ms 33632 KB Output is correct
13 Correct 496 ms 34268 KB Output is correct
14 Correct 464 ms 34404 KB Output is correct
15 Correct 460 ms 34532 KB Output is correct
16 Correct 463 ms 34408 KB Output is correct
17 Correct 464 ms 34404 KB Output is correct
18 Correct 448 ms 36192 KB Output is correct
19 Correct 530 ms 38288 KB Output is correct
20 Correct 497 ms 34404 KB Output is correct
21 Correct 508 ms 34400 KB Output is correct
22 Correct 490 ms 34528 KB Output is correct
23 Correct 286 ms 30948 KB Output is correct
24 Correct 465 ms 36576 KB Output is correct
25 Correct 18 ms 14188 KB Output is correct
26 Correct 8 ms 12524 KB Output is correct
27 Correct 8 ms 12524 KB Output is correct
28 Correct 25 ms 15980 KB Output is correct
29 Correct 17 ms 14188 KB Output is correct
30 Correct 9 ms 12652 KB Output is correct
31 Correct 10 ms 12652 KB Output is correct
32 Correct 10 ms 12780 KB Output is correct
33 Correct 9 ms 12652 KB Output is correct
34 Correct 17 ms 14188 KB Output is correct
35 Correct 9 ms 12524 KB Output is correct
36 Correct 8 ms 12524 KB Output is correct
37 Correct 9 ms 12524 KB Output is correct
38 Correct 9 ms 12524 KB Output is correct
39 Correct 9 ms 12524 KB Output is correct
40 Correct 361 ms 30428 KB Output is correct
41 Correct 426 ms 31592 KB Output is correct
42 Correct 460 ms 31716 KB Output is correct
43 Correct 255 ms 28776 KB Output is correct
44 Correct 259 ms 28904 KB Output is correct
45 Correct 440 ms 33504 KB Output is correct
46 Correct 437 ms 33380 KB Output is correct
47 Correct 440 ms 31972 KB Output is correct
48 Correct 254 ms 26728 KB Output is correct
49 Correct 359 ms 32348 KB Output is correct
50 Correct 442 ms 32916 KB Output is correct
51 Correct 469 ms 33376 KB Output is correct