oj.uz

Submission #594066

# Submission time Handle Problem Language Result Execution time Memory
594066 2022-07-12T04:23:12 Z rurutoria7 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 320 ms 21168 KB 
#include <bits/stdc++.h>
#define int long long
#define rep(i,j,k) for (int i=j; i<=k; i++)
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define ff first
#define ss second
#define pb push_back
#define lyx_my_wife ios::sync_with_stdio(0), cin.tie(0);
using namespace std;
typedef pair<int,int> pii;

const int N = 1e5+10, M = 2e5+10;

int n, m, s, t, u, v;
vector<pii> G[N];

int disu[N], disv[N], diss[N], dist[N], vis[N];
int dpu[N], dpv[N], ans;

void dijks(int rt, int dis[N], int fordp=0, int forans=0)
{
    memset(dis, 0x3f, sizeof(disu));
    memset(vis, 0, sizeof(vis));
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    dis[rt] = 0;
    pq.push({0, rt});

    if (fordp)
    {
        memset(dpu, 0x3f, sizeof(dpu));
        memset(dpv, 0x3f, sizeof(dpv));
    }
    
    while(pq.size())
    {
        int i = pq.top().ss, d = pq.top().ff;
        pq.pop(); 

        if (vis[i]) continue;
        vis[i] = 1;

        if (fordp)
        {
            dpu[i] = min(dpu[i], disu[i]);
            dpv[i] = min(dpv[i], disv[i]);            
        }

        for (auto e: G[i])
        {
            int j = e.ss, w = e.ff;
            if (dis[j] > d+w)
            {
                dis[j] = d+w;
                pq.push({dis[j], j});
                if (fordp) dpu[j] = dpu[i], dpv[j] = dpv[i];
            }
            else if (dis[j] == d+w and fordp)
                dpu[j] = min(dpu[j], dpu[i]), dpv[j] = min(dpv[j], dpv[i]);

        }
    }
}

void bfs(int rt)
{
    queue<int> q;
    memset(vis,0,sizeof(vis));
    q.push(rt);
    while(q.size())
    {
        int i = q.front(); q.pop();
        if (vis[i]) continue;
        vis[i] = 1;
        for (auto e: G[i])
        {
            int w = e.ff, j = e.ss;
            if (diss[j] != diss[i]-w) continue;
            ans = min(ans, dpu[j]+disv[i]);
            ans = min(ans, dpv[j]+disu[i]);
            q.push(j);
        }
    }
}

signed main()
{
    lyx_my_wife
    cin >> n >> m >> s >> t >> u >> v;
    rep(_,1,m)
    {
        int i, j, w;
        cin >> i >> j >> w;
        G[i].pb({w,j});
        G[j].pb({w,i});
    }

    // dijks for disu, disv
    dijks(u,disu);
    dijks(v,disv);
    dijks(s,diss,1);
    ans = disu[v];
    bfs(t);
    cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 21168 KB Output is correct
2 Correct 294 ms 19888 KB Output is correct
3 Correct 243 ms 19612 KB Output is correct
4 Correct 247 ms 19952 KB Output is correct
5 Correct 259 ms 19732 KB Output is correct
6 Correct 238 ms 21120 KB Output is correct
7 Correct 252 ms 19940 KB Output is correct
8 Correct 273 ms 19952 KB Output is correct
9 Correct 230 ms 19904 KB Output is correct
10 Correct 215 ms 19592 KB Output is correct
11 Correct 118 ms 12868 KB Output is correct
12 Correct 242 ms 19828 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 20172 KB Output is correct
2 Correct 242 ms 19936 KB Output is correct
3 Correct 320 ms 19896 KB Output is correct
4 Correct 241 ms 19836 KB Output is correct
5 Correct 273 ms 19812 KB Output is correct
6 Correct 284 ms 19760 KB Output is correct
7 Correct 298 ms 19840 KB Output is correct
8 Correct 315 ms 19888 KB Output is correct
9 Correct 263 ms 19864 KB Output is correct
10 Correct 265 ms 19900 KB Output is correct
11 Correct 107 ms 12752 KB Output is correct
12 Correct 253 ms 19696 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8780 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 16 ms 10188 KB Output is correct
5 Correct 12 ms 8844 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 5 ms 7640 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 11 ms 8780 KB Output is correct
11 Correct 4 ms 7292 KB Output is correct
12 Correct 3 ms 7292 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 21168 KB Output is correct
2 Correct 294 ms 19888 KB Output is correct
3 Correct 243 ms 19612 KB Output is correct
4 Correct 247 ms 19952 KB Output is correct
5 Correct 259 ms 19732 KB Output is correct
6 Correct 238 ms 21120 KB Output is correct
7 Correct 252 ms 19940 KB Output is correct
8 Correct 273 ms 19952 KB Output is correct
9 Correct 230 ms 19904 KB Output is correct
10 Correct 215 ms 19592 KB Output is correct
11 Correct 118 ms 12868 KB Output is correct
12 Correct 242 ms 19828 KB Output is correct
13 Correct 310 ms 20172 KB Output is correct
14 Correct 242 ms 19936 KB Output is correct
15 Correct 320 ms 19896 KB Output is correct
16 Correct 241 ms 19836 KB Output is correct
17 Correct 273 ms 19812 KB Output is correct
18 Correct 284 ms 19760 KB Output is correct
19 Correct 298 ms 19840 KB Output is correct
20 Correct 315 ms 19888 KB Output is correct
21 Correct 263 ms 19864 KB Output is correct
22 Correct 265 ms 19900 KB Output is correct
23 Correct 107 ms 12752 KB Output is correct
24 Correct 253 ms 19696 KB Output is correct
25 Correct 13 ms 8780 KB Output is correct
26 Correct 4 ms 7380 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 16 ms 10188 KB Output is correct
29 Correct 12 ms 8844 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 4 ms 7508 KB Output is correct
32 Correct 5 ms 7640 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 11 ms 8780 KB Output is correct
35 Correct 4 ms 7292 KB Output is correct
36 Correct 3 ms 7292 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 4 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 222 ms 20616 KB Output is correct
41 Correct 286 ms 19852 KB Output is correct
42 Correct 227 ms 19848 KB Output is correct
43 Correct 124 ms 12756 KB Output is correct
44 Correct 107 ms 12916 KB Output is correct
45 Correct 279 ms 19648 KB Output is correct
46 Correct 232 ms 19500 KB Output is correct
47 Correct 251 ms 19784 KB Output is correct
48 Correct 161 ms 12860 KB Output is correct
49 Correct 195 ms 20816 KB Output is correct
50 Correct 230 ms 19600 KB Output is correct
51 Correct 242 ms 19588 KB Output is correct