oj.uz

답안 #632211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632211 2022-08-19T16:19:45 Z Ooops_sorry Robot (JOI21_ho_t4) C++14
100 / 100
 1431 ms 88724 KB 
#include<bits/stdc++.h>

using namespace std;

mt19937 rnd(51);

#define ll long long
#define pb push_back
#define ld long double

const ll INF = 1e18, N = 1e5 + 10;
map<int, vector<pair<int,ll>>> g[N];
vector<ll> d(N);
map<int, ll> color_d[N];
map<int, ll> total_sum[N];

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        d[i] = INF;
    }
    for (int i = 0; i < m; i++) {
        int a, b, c, p;
        cin >> a >> b >> c >> p;
        a--, b--;
        g[a][c].pb({b, p});
        g[b][c].pb({a, p});
        color_d[a][c] = color_d[b][c] = INF;
    }
    for (int v = 0; v < n; v++) {
        for (auto [c, arr] : g[v]) {
            for (auto to : arr) {
                total_sum[v][c] += to.second;
            }
        }
    }
    d[0] = 0;
    set<array<ll, 3>> st{{0, 0, -1}};
    while (st.size() > 0) {
        auto arr = *st.begin();
        st.erase(st.begin());
        int v = arr[1];
        if (arr[2] == -1) {
            for (auto [c, arr] : g[v]) {
                for (auto [u, p] : arr) {
                    if (d[u] > d[v] + min(total_sum[v][c] - p, p)) {
                        st.erase({d[u], u, -1});
                        d[u] = d[v] + min(total_sum[v][c] - p, p);
                        st.insert({d[u], u, -1});
                    }
                    if (color_d[u][c] > d[v]) {
                        st.erase({color_d[u][c], u, c});
                        color_d[u][c] = d[v];
                        st.insert({color_d[u][c], u, c});
                    }
                }
            }
        } else {
            int c = arr[2];
            for (auto [u, p] : g[v][c]) {
                ll dist = color_d[v][c] + total_sum[v][c] - p;
                if (d[u] > dist) {
                    st.erase({d[u], u, -1});
                    d[u] = dist;
                    st.insert({d[u], u, -1});
                }
                if (color_d[u][c] > dist) {
                    st.erase({color_d[u][c], u, c});
                    color_d[u][c] = dist;
                    st.insert({color_d[u][c], u, c});
                }
            }
        }
    }
    cout << (d[n - 1] == INF ? -1 : d[n - 1]) << endl;
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:37:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |         for (auto [c, arr] : g[v]) {
      |                   ^
Main.cpp:50:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   50 |             for (auto [c, arr] : g[v]) {
      |                       ^
Main.cpp:51:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   51 |                 for (auto [u, p] : arr) {
      |                           ^
Main.cpp:66:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |             for (auto [u, p] : g[v][c]) {
      |                       ^

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 7 ms 15188 KB Output is correct
6 Correct 8 ms 15188 KB Output is correct
7 Correct 9 ms 15372 KB Output is correct
8 Correct 8 ms 15188 KB Output is correct
9 Correct 11 ms 15868 KB Output is correct
10 Correct 10 ms 15828 KB Output is correct
11 Correct 9 ms 15676 KB Output is correct
12 Correct 9 ms 15572 KB Output is correct
13 Correct 10 ms 15624 KB Output is correct
14 Correct 9 ms 15612 KB Output is correct
15 Correct 9 ms 15572 KB Output is correct
16 Correct 10 ms 15572 KB Output is correct
17 Correct 10 ms 15608 KB Output is correct
18 Correct 8 ms 15444 KB Output is correct
19 Correct 9 ms 15444 KB Output is correct
20 Correct 9 ms 15484 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 35424 KB Output is correct
2 Correct 89 ms 25408 KB Output is correct
3 Correct 250 ms 31424 KB Output is correct
4 Correct 144 ms 28440 KB Output is correct
5 Correct 1128 ms 83560 KB Output is correct
6 Correct 867 ms 71552 KB Output is correct
7 Correct 407 ms 60572 KB Output is correct
8 Correct 429 ms 46812 KB Output is correct
9 Correct 458 ms 46820 KB Output is correct
10 Correct 385 ms 49740 KB Output is correct
11 Correct 137 ms 35560 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 7 ms 15188 KB Output is correct
6 Correct 8 ms 15188 KB Output is correct
7 Correct 9 ms 15372 KB Output is correct
8 Correct 8 ms 15188 KB Output is correct
9 Correct 11 ms 15868 KB Output is correct
10 Correct 10 ms 15828 KB Output is correct
11 Correct 9 ms 15676 KB Output is correct
12 Correct 9 ms 15572 KB Output is correct
13 Correct 10 ms 15624 KB Output is correct
14 Correct 9 ms 15612 KB Output is correct
15 Correct 9 ms 15572 KB Output is correct
16 Correct 10 ms 15572 KB Output is correct
17 Correct 10 ms 15608 KB Output is correct
18 Correct 8 ms 15444 KB Output is correct
19 Correct 9 ms 15444 KB Output is correct
20 Correct 9 ms 15484 KB Output is correct
21 Correct 234 ms 35424 KB Output is correct
22 Correct 89 ms 25408 KB Output is correct
23 Correct 250 ms 31424 KB Output is correct
24 Correct 144 ms 28440 KB Output is correct
25 Correct 1128 ms 83560 KB Output is correct
26 Correct 867 ms 71552 KB Output is correct
27 Correct 407 ms 60572 KB Output is correct
28 Correct 429 ms 46812 KB Output is correct
29 Correct 458 ms 46820 KB Output is correct
30 Correct 385 ms 49740 KB Output is correct
31 Correct 137 ms 35560 KB Output is correct
32 Correct 155 ms 28656 KB Output is correct
33 Correct 204 ms 30192 KB Output is correct
34 Correct 525 ms 53268 KB Output is correct
35 Correct 410 ms 44072 KB Output is correct
36 Correct 343 ms 50188 KB Output is correct
37 Correct 440 ms 57628 KB Output is correct
38 Correct 524 ms 62712 KB Output is correct
39 Correct 154 ms 31436 KB Output is correct
40 Correct 462 ms 52172 KB Output is correct
41 Correct 496 ms 52492 KB Output is correct
42 Correct 614 ms 65672 KB Output is correct
43 Correct 255 ms 40396 KB Output is correct
44 Correct 564 ms 45680 KB Output is correct
45 Correct 353 ms 47564 KB Output is correct
46 Correct 284 ms 47908 KB Output is correct
47 Correct 380 ms 56244 KB Output is correct
48 Correct 1431 ms 88724 KB Output is correct