oj.uz

답안 #833795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833795 2023-08-22T08:40:15 Z manhlinh1501 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 252 ms 21296 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
using i64 = long long;
const i64 oo = 1e18;
#define eb emplace_back
using pii = pair<int, int>;
using pli = pair<i64, int>;
int n, m;
vector<pii> adj[N];
vector<i64> dist[4];
vector<i64> dp[2];
priority_queue<pli, vector<pli>, greater<pli>> Q;
int a[4];
i64 ans = oo;

#define S 0
#define T 1
#define U 2
#define V 3

void dijkstra(int u, vector<i64> &dist) {
    dist.assign(n + 1, oo);
    Q.emplace(0, u);
    dist[u] = 0;

    while(!Q.empty()) {
        pli top = Q.top();
        Q.pop();
        int u = top.second;

        if(dist[u] != top.first)
            continue;

        for(auto [v, w] : adj[u]) {
            if(dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                Q.emplace(dist[v], v);
            }
        }
    }
}

void solve(int type) {
    vector<pli> res;

    for(int i = 1; i <= n; i++) {
        if(dist[S][a[T]] == dist[S][i] + dist[T][i])
            res.eb(dist[type][i], i);
    }

    sort(res.begin(), res.end());

    for(pli x : res) {
        int u = x.second;
        dp[0][u] = dist[U][u];
        dp[1][u] = dist[V][u];

        for(auto [v, w] : adj[u]) {
            if(dist[type][v] + w == dist[type][u]) {
                dp[0][u] = min(dp[0][u], dp[0][v]);
                dp[1][u] = min(dp[1][u], dp[1][v]);
            }
        }

        ans = min(ans, min(dp[0][u] + dist[V][u], dp[1][u] + dist[U][u]));
    }
}

int main() {
    if(fopen(".inp", "r")) {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;

    for(int i = 0; i < 4; i++)
        cin >> a[i];

    for(int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].eb(v, w);
        adj[v].eb(u, w);
    }

    for(int i = 0; i < 4; i++)
        dijkstra(a[i], dist[i]);

//    for(int j = 0; j < 4; j++) {
//        cout << j << " : ";
//
//        for(int i = 1; i <= n; i++)
//            cout << dist[j][i] << " ";
//
//        cout << "\n";
//    }
    ans = dist[V][a[U]];
    dp[0].assign(n + 1, oo);
    dp[1].assign(n + 1, oo);
    solve(0);
    solve(1);
    cout << ans;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 15036 KB Output is correct
2 Correct 188 ms 15968 KB Output is correct
3 Correct 205 ms 18104 KB Output is correct
4 Correct 157 ms 15044 KB Output is correct
5 Correct 185 ms 19560 KB Output is correct
6 Correct 187 ms 18624 KB Output is correct
7 Correct 193 ms 19900 KB Output is correct
8 Correct 188 ms 19832 KB Output is correct
9 Correct 184 ms 18856 KB Output is correct
10 Correct 134 ms 18732 KB Output is correct
11 Correct 64 ms 14124 KB Output is correct
12 Correct 205 ms 18872 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 16084 KB Output is correct
2 Correct 212 ms 15848 KB Output is correct
3 Correct 202 ms 15732 KB Output is correct
4 Correct 208 ms 15904 KB Output is correct
5 Correct 197 ms 16632 KB Output is correct
6 Correct 218 ms 17080 KB Output is correct
7 Correct 252 ms 17984 KB Output is correct
8 Correct 225 ms 16108 KB Output is correct
9 Correct 211 ms 16520 KB Output is correct
10 Correct 207 ms 15952 KB Output is correct
11 Correct 75 ms 13036 KB Output is correct
12 Correct 204 ms 17292 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 3796 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2672 KB Output is correct
4 Correct 13 ms 4928 KB Output is correct
5 Correct 7 ms 3668 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 7 ms 3668 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 15036 KB Output is correct
2 Correct 188 ms 15968 KB Output is correct
3 Correct 205 ms 18104 KB Output is correct
4 Correct 157 ms 15044 KB Output is correct
5 Correct 185 ms 19560 KB Output is correct
6 Correct 187 ms 18624 KB Output is correct
7 Correct 193 ms 19900 KB Output is correct
8 Correct 188 ms 19832 KB Output is correct
9 Correct 184 ms 18856 KB Output is correct
10 Correct 134 ms 18732 KB Output is correct
11 Correct 64 ms 14124 KB Output is correct
12 Correct 205 ms 18872 KB Output is correct
13 Correct 228 ms 16084 KB Output is correct
14 Correct 212 ms 15848 KB Output is correct
15 Correct 202 ms 15732 KB Output is correct
16 Correct 208 ms 15904 KB Output is correct
17 Correct 197 ms 16632 KB Output is correct
18 Correct 218 ms 17080 KB Output is correct
19 Correct 252 ms 17984 KB Output is correct
20 Correct 225 ms 16108 KB Output is correct
21 Correct 211 ms 16520 KB Output is correct
22 Correct 207 ms 15952 KB Output is correct
23 Correct 75 ms 13036 KB Output is correct
24 Correct 204 ms 17292 KB Output is correct
25 Correct 8 ms 3796 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2672 KB Output is correct
28 Correct 13 ms 4928 KB Output is correct
29 Correct 7 ms 3668 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 7 ms 3668 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 202 ms 18936 KB Output is correct
41 Correct 177 ms 18812 KB Output is correct
42 Correct 205 ms 18840 KB Output is correct
43 Correct 87 ms 16172 KB Output is correct
44 Correct 87 ms 16252 KB Output is correct
45 Correct 201 ms 21296 KB Output is correct
46 Correct 185 ms 20908 KB Output is correct
47 Correct 170 ms 18344 KB Output is correct
48 Correct 90 ms 15640 KB Output is correct
49 Correct 156 ms 18488 KB Output is correct
50 Correct 216 ms 20948 KB Output is correct
51 Correct 191 ms 21260 KB Output is correct