oj.uz

답안 #899274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899274 2024-01-05T16:37:05 Z aykhn Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 274 ms 36736 KB 
#include <bits/stdc++.h>
 
// author: aykhn
 
using namespace std;
typedef long long ll;
 
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mpr make_pair
#define eb emplace_back
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define ins insert
#define int ll
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
 
const int MXN = 1e5 + 5;
 
int dist[2][MXN];
int d[MXN];
int mn1[MXN], mn2[MXN];
vector<array<int, 2>> adj[MXN];
vector<int> par[MXN];
vector<int> g[MXN], o;
int used[MXN];
 
void dijk(int s, int id)
{
    for (int i = 0; i < MXN; i++) dist[id][i] = infll;
    priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> pq;
    dist[id][s] = 0;
    pq.push({0, s});
    while (!pq.empty())
    {
        array<int, 2> f = pq.top();
        pq.pop();
        if (f[0] > dist[id][f[1]]) continue;
        for (const array<int, 2> &v : adj[f[1]])
        {
            if (dist[id][v[0]] > f[0] + v[1])
            {
                dist[id][v[0]] = f[0] + v[1];
                pq.push({dist[id][v[0]], v[0]});
            }
        }
    }
}
 
void dfs(int a)
{
    used[a] = 1;
    for (int v : par[a])
    {
        g[v].pb(a);
        if (used[v]) continue;
        dfs(v);
    }
}
 
void dfs1(int a)
{
    used[a] = 1;
    for (int v : g[a])
    {
        if (used[v]) continue;
        dfs1(v);
    }
    o.pb(a);
}
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    int n, m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    while (m--)
    {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }
    dijk(u, 0);
    dijk(v, 1);
    for (int i = 0; i < MXN; i++) d[i] = mn1[i] = mn2[i] = infll;
    priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> pq;
    d[s] = 0;
    pq.push({0, s});
    while (!pq.empty())
    {
        int f = pq.top()[1];
        int w = pq.top()[0];
        pq.pop();
        if (w > d[f]) continue;
        for (const array<int, 2> &v : adj[f])
        {
            if (d[v[0]] > w + v[1])
            {
                d[v[0]] = w + v[1];
                par[v[0]].clear();
                par[v[0]].pb(f);
                pq.push({d[v[0]], v[0]});
            }
            else if (d[v[0]] == w + v[1]) par[v[0]].pb(f);
        }
    }
    for (int i = 0; i < MXN; i++) used[i] = 0;
    dfs(t);
    for (int i = 0; i < MXN; i++) used[i] = 0;
    dfs1(s);
    reverse(all(o));
    int res = infll;
    for (int x : o)
    {
        mn1[x] = min(mn1[x], dist[0][x]);
        mn2[x] = min(mn2[x], dist[1][x]);
        res = min(res, mn1[x] + dist[1][x]);
        res = min(res, mn2[x] + dist[0][x]);
        for (int v : g[x])
        {
            mn1[v] = min(mn1[v], mn1[x]);
            mn2[v] = min(mn2[v], mn2[x]);
        }
    }
    cout << min(dist[0][v], res) << '\n';
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 28772 KB Output is correct
2 Correct 205 ms 29440 KB Output is correct
3 Correct 234 ms 36296 KB Output is correct
4 Correct 184 ms 28224 KB Output is correct
5 Correct 256 ms 30748 KB Output is correct
6 Correct 182 ms 28740 KB Output is correct
7 Correct 203 ms 31080 KB Output is correct
8 Correct 234 ms 30720 KB Output is correct
9 Correct 196 ms 27972 KB Output is correct
10 Correct 194 ms 28252 KB Output is correct
11 Correct 78 ms 26764 KB Output is correct
12 Correct 220 ms 28312 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 31376 KB Output is correct
2 Correct 223 ms 31868 KB Output is correct
3 Correct 240 ms 31032 KB Output is correct
4 Correct 226 ms 31776 KB Output is correct
5 Correct 274 ms 32640 KB Output is correct
6 Correct 202 ms 35020 KB Output is correct
7 Correct 239 ms 36736 KB Output is correct
8 Correct 212 ms 31620 KB Output is correct
9 Correct 274 ms 32784 KB Output is correct
10 Correct 266 ms 31360 KB Output is correct
11 Correct 91 ms 28948 KB Output is correct
12 Correct 245 ms 35680 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14056 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 13 ms 15452 KB Output is correct
5 Correct 8 ms 13912 KB Output is correct
6 Correct 4 ms 12124 KB Output is correct
7 Correct 3 ms 12632 KB Output is correct
8 Correct 4 ms 12380 KB Output is correct
9 Correct 4 ms 12124 KB Output is correct
10 Correct 10 ms 13840 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12012 KB Output is correct
14 Correct 4 ms 12124 KB Output is correct
15 Correct 3 ms 12376 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 28772 KB Output is correct
2 Correct 205 ms 29440 KB Output is correct
3 Correct 234 ms 36296 KB Output is correct
4 Correct 184 ms 28224 KB Output is correct
5 Correct 256 ms 30748 KB Output is correct
6 Correct 182 ms 28740 KB Output is correct
7 Correct 203 ms 31080 KB Output is correct
8 Correct 234 ms 30720 KB Output is correct
9 Correct 196 ms 27972 KB Output is correct
10 Correct 194 ms 28252 KB Output is correct
11 Correct 78 ms 26764 KB Output is correct
12 Correct 220 ms 28312 KB Output is correct
13 Correct 230 ms 31376 KB Output is correct
14 Correct 223 ms 31868 KB Output is correct
15 Correct 240 ms 31032 KB Output is correct
16 Correct 226 ms 31776 KB Output is correct
17 Correct 274 ms 32640 KB Output is correct
18 Correct 202 ms 35020 KB Output is correct
19 Correct 239 ms 36736 KB Output is correct
20 Correct 212 ms 31620 KB Output is correct
21 Correct 274 ms 32784 KB Output is correct
22 Correct 266 ms 31360 KB Output is correct
23 Correct 91 ms 28948 KB Output is correct
24 Correct 245 ms 35680 KB Output is correct
25 Correct 9 ms 14056 KB Output is correct
26 Correct 3 ms 12124 KB Output is correct
27 Correct 3 ms 12124 KB Output is correct
28 Correct 13 ms 15452 KB Output is correct
29 Correct 8 ms 13912 KB Output is correct
30 Correct 4 ms 12124 KB Output is correct
31 Correct 3 ms 12632 KB Output is correct
32 Correct 4 ms 12380 KB Output is correct
33 Correct 4 ms 12124 KB Output is correct
34 Correct 10 ms 13840 KB Output is correct
35 Correct 3 ms 12124 KB Output is correct
36 Correct 3 ms 12124 KB Output is correct
37 Correct 3 ms 12012 KB Output is correct
38 Correct 4 ms 12124 KB Output is correct
39 Correct 3 ms 12376 KB Output is correct
40 Correct 191 ms 28028 KB Output is correct
41 Correct 191 ms 28076 KB Output is correct
42 Correct 203 ms 28068 KB Output is correct
43 Correct 81 ms 29644 KB Output is correct
44 Correct 120 ms 29644 KB Output is correct
45 Correct 211 ms 33716 KB Output is correct
46 Correct 198 ms 33224 KB Output is correct
47 Correct 216 ms 28244 KB Output is correct
48 Correct 103 ms 26560 KB Output is correct
49 Correct 161 ms 29052 KB Output is correct
50 Correct 236 ms 32564 KB Output is correct
51 Correct 205 ms 33592 KB Output is correct