oj.uz

Submission #917950

# Submission time Handle Problem Language Result Execution time Memory
917950 2024-01-29T07:27:43 Z 406 Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 175488 KB 
#include <bits/stdc++.h>
#define int int64_t
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)

using namespace std;
using ar = array<int, 2>;
using ar3 = array<int, 3>;

const int64_t INF = 1ll << 60;
const int N = 2e5 + 5;

vector<ar3> adj[N];
int n, m, C[N], d[N], cnt[N], sum[N];
ar last[N];

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n >> m;
        FOR(i, 0, m) {
                int u, v, c, p;
                cin >> u >> v >> c >> p;
                --u, --v;
                adj[v].push_back({u, c, p});
                adj[u].push_back({v, c, p});
        }
        fill(last, last + N, ar{-1, -1});

        vector<array<int, 4>> E;
        FOR(i, 0, n) {
                for (auto [u, c, p]: adj[i]) cnt[c]++, sum[c] += p;
                for (auto &[u, c, p]: adj[i]) for (auto &[v, cv, pv]: adj[i]) if (cv == c && (u != v)) {
                        E.push_back({u, v, c, sum[c] - pv});
                }
                for (auto &[u, c, p]: adj[i]) {
                        if (cnt[c] == 2) {
                                if (last[c][0] == -1) last[c] = {u, p};
                                else {
                                        E.push_back({last[c][0], u, c, last[c][1]});
                                        E.push_back({u, last[c][0], c, p});
                                }
                        }
                        p = min(p, sum[c] - p);
                }
                for (auto [u, c, p]: adj[i]) cnt[c] = sum[c] = 0, last[c][0] = -1;
        }
        for (auto [u, v, c, p]: E)
                adj[u].push_back({v, c, p});

        fill(d + 1, d + N, INF);
        queue<int> q;
        q.push(0);
        while (q.size()) {
                int v = q.front();
                q.pop();
                for (auto [u, c, p]: adj[v]) {
                        int w = d[v] + p;
                        if (w < d[u]) {
                                q.push(u);
                                d[u] = w;
                        }
                }
        }
        cout << (d[n - 1] < INF ? d[n - 1] : -1) << '\n';
        return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14424 KB Output is correct
2 Correct 4 ms 14424 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 4 ms 14424 KB Output is correct
5 Correct 4 ms 14540 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 5 ms 14808 KB Output is correct
8 Correct 4 ms 15064 KB Output is correct
9 Correct 5 ms 15072 KB Output is correct
10 Correct 16 ms 29896 KB Output is correct
11 Correct 94 ms 128804 KB Output is correct
12 Correct 39 ms 56244 KB Output is correct
13 Correct 101 ms 126112 KB Output is correct
14 Correct 102 ms 125336 KB Output is correct
15 Correct 4 ms 14948 KB Output is correct
16 Correct 6 ms 15580 KB Output is correct
17 Correct 5 ms 15068 KB Output is correct
18 Correct 4 ms 14428 KB Output is correct
19 Correct 6 ms 16592 KB Output is correct
20 Correct 5 ms 15068 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 49156 KB Output is correct
2 Correct 28 ms 26300 KB Output is correct
3 Correct 244 ms 175488 KB Output is correct
4 Correct 46 ms 36548 KB Output is correct
5 Execution timed out 3102 ms 47724 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14424 KB Output is correct
2 Correct 4 ms 14424 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 4 ms 14424 KB Output is correct
5 Correct 4 ms 14540 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 5 ms 14808 KB Output is correct
8 Correct 4 ms 15064 KB Output is correct
9 Correct 5 ms 15072 KB Output is correct
10 Correct 16 ms 29896 KB Output is correct
11 Correct 94 ms 128804 KB Output is correct
12 Correct 39 ms 56244 KB Output is correct
13 Correct 101 ms 126112 KB Output is correct
14 Correct 102 ms 125336 KB Output is correct
15 Correct 4 ms 14948 KB Output is correct
16 Correct 6 ms 15580 KB Output is correct
17 Correct 5 ms 15068 KB Output is correct
18 Correct 4 ms 14428 KB Output is correct
19 Correct 6 ms 16592 KB Output is correct
20 Correct 5 ms 15068 KB Output is correct
21 Correct 74 ms 49156 KB Output is correct
22 Correct 28 ms 26300 KB Output is correct
23 Correct 244 ms 175488 KB Output is correct
24 Correct 46 ms 36548 KB Output is correct
25 Execution timed out 3102 ms 47724 KB Time limit exceeded
26 Halted 0 ms 0 KB -