oj.uz

Submission #916847

# Submission time Handle Problem Language Result Execution time Memory
916847 2024-01-26T15:22:07 Z maybe_baby Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 39836 KB 
#include <bits/stdc++.h>

#define x first
#define y second

using ll = long long;

using namespace std;

struct triple {
    int x, y;
    ll z;
};

struct four {
    int x, y;
    ll z, t;
};

int main() {
    int n, m;
    cin >> n >> m;
    int ans = 1;
    for (int i = 0; i < 1ll * n * n; ++i) {
        ans *= 1032423;
        ans++;
    }
    cerr << ans;
    vector<vector<four>> g(n);
    vector<vector<triple>> g1(n);
    for (int i = 0; i < m; i++) {
        int u, v, c;
        ll p;
        cin >> u >> v >> c >> p; u--; v--; c--;
        g1[u].push_back({v, c, p});
        g1[v].push_back({u, c, p});
    }
    vector<int> cnt(m, 0);
    vector<ll> sum(m, 0);
    for (int i = 0; i < n; i++) {
        for (auto [u, c, p] : g1[i]) {
            cnt[c]++;
            sum[c] += p;
        }
        for (auto [u, c, p] : g1[i]) {
            if (cnt[c] > 1) {
                g[i].push_back({u, c, p, sum[c] - p});
            } else {
                g[i].push_back({u, c, p, 0});
            }
        }
        for (auto [u, c, p] : g1[i]) {
            cnt[c]--;
            sum[c] -= p;
        }
    }
    set<pair<ll, int>> st;
    vector<ll> dist(n, INT64_MAX / 2), dist2(m, INT64_MAX / 2);
    vector<int> used(n, 0);
    dist[0] = 0;
    for (int i = 0; i < n; i++) {
        st.emplace(dist[i], i);
    }
    while (!st.empty()) {
        auto [d, s] = *st.begin();
        st.erase(st.begin());
        for (auto [i, c, p, w] : g[s]) {
            if (used[i]) {
                dist2[c] = min(dist[i], dist2[c]);
            }
        }
        used[s] = 1;
        for (auto [i, c, p, w] : g[s]) {
            if (!used[i]) {
                st.erase({dist[i], i});
                dist[i] = min(dist[i], min({d + w, dist2[c] + w, d + p}));
                st.emplace(dist[i], i);
            }
        }
        for (auto [i, c, p, w] : g[s]) {
            if (used[i]) {
                dist2[c] = INT64_MAX / 2;
            }
        }
    }
    if (dist[n - 1] == INT64_MAX / 2) {
        cout << "-1\n";
    } else {
        cout << dist[n - 1] << "\n";
    }
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 688 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 5 ms 664 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 894 ms 14160 KB Output is correct
2 Correct 350 ms 7020 KB Output is correct
3 Correct 505 ms 20380 KB Output is correct
4 Correct 841 ms 10576 KB Output is correct
5 Correct 1992 ms 35712 KB Output is correct
6 Correct 2041 ms 36588 KB Output is correct
7 Correct 2011 ms 36392 KB Output is correct
8 Correct 2032 ms 39836 KB Output is correct
9 Correct 2055 ms 39836 KB Output is correct
10 Execution timed out 3031 ms 344 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 688 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 5 ms 664 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 894 ms 14160 KB Output is correct
22 Correct 350 ms 7020 KB Output is correct
23 Correct 505 ms 20380 KB Output is correct
24 Correct 841 ms 10576 KB Output is correct
25 Correct 1992 ms 35712 KB Output is correct
26 Correct 2041 ms 36588 KB Output is correct
27 Correct 2011 ms 36392 KB Output is correct
28 Correct 2032 ms 39836 KB Output is correct
29 Correct 2055 ms 39836 KB Output is correct
30 Execution timed out 3031 ms 344 KB Time limit exceeded
31 Halted 0 ms 0 KB -