oj.uz

Submission #746216

# Submission time Handle Problem Language Result Execution time Memory
746216 2023-05-21T22:47:30 Z stevancv Robot (JOI21_ho_t4) C++14
100 / 100
 1109 ms 88236 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const ll linf = 1e18;
map<int, vector<array<int, 2>>> g[N];
map<int, ll> sum[N], dist[N];
int col[2 * N], cost[2 * N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v >> col[i] >> cost[i];
        g[u][col[i]].push_back({v, i});
        g[v][col[i]].push_back({u, i});
        dist[u][col[i]] = dist[v][col[i]] = linf;
        sum[u][col[i]] += cost[i];
        sum[v][col[i]] += cost[i];
    }
    for (int i = 2; i <= n; i++) dist[i][0] = linf;
    priority_queue<pair<ll, pair<int, int>>> pq;
    pq.push({0, {1, 0}});
    dist[1][0] = 0;
    while (!pq.empty()) {
        ll d = -pq.top().first;
        int x = pq.top().second.first;
        int y = pq.top().second.second;
        pq.pop();
        if (d > dist[x][y]) continue;
        if (y > 0) {
            for (auto u : g[x][y]) {
                ll o = d + sum[x][y] - cost[u[1]];
                if (dist[u[0]][0] > o) {
                    dist[u[0]][0] = o;
                    pq.push({-o, {u[0], 0}});
                }
            }
            continue;
        }
        for (auto &uu : g[x]) {
            int y = uu.first;
            ll kk = sum[x][y];
            for (auto u : uu.second) {
                ll o = d + min((ll)cost[u[1]], kk - cost[u[1]]);
                if (dist[u[0]][0] > o) {
                    dist[u[0]][0] = o;
                    pq.push({-o, {u[0], 0}});
                }
                if (dist[u[0]][y] > d) {
                    dist[u[0]][y] = d;
                    pq.push({-d, {u[0], y}});
                }
            }
        }
    }
    if (dist[n][0] == linf) dist[n][0] = -1;
    cout << dist[n][0] << en;
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 8 ms 14424 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14468 KB Output is correct
6 Correct 8 ms 14424 KB Output is correct
7 Correct 10 ms 14480 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 10 ms 15116 KB Output is correct
10 Correct 10 ms 14972 KB Output is correct
11 Correct 9 ms 14804 KB Output is correct
12 Correct 9 ms 14676 KB Output is correct
13 Correct 9 ms 14804 KB Output is correct
14 Correct 9 ms 14804 KB Output is correct
15 Correct 8 ms 14676 KB Output is correct
16 Correct 9 ms 14676 KB Output is correct
17 Correct 9 ms 14848 KB Output is correct
18 Correct 8 ms 14604 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 8 ms 14676 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 34104 KB Output is correct
2 Correct 119 ms 24936 KB Output is correct
3 Correct 216 ms 28716 KB Output is correct
4 Correct 129 ms 27732 KB Output is correct
5 Correct 1050 ms 83088 KB Output is correct
6 Correct 803 ms 71892 KB Output is correct
7 Correct 358 ms 51416 KB Output is correct
8 Correct 426 ms 49532 KB Output is correct
9 Correct 438 ms 49892 KB Output is correct
10 Correct 385 ms 49672 KB Output is correct
11 Correct 157 ms 38988 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 8 ms 14424 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14468 KB Output is correct
6 Correct 8 ms 14424 KB Output is correct
7 Correct 10 ms 14480 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 10 ms 15116 KB Output is correct
10 Correct 10 ms 14972 KB Output is correct
11 Correct 9 ms 14804 KB Output is correct
12 Correct 9 ms 14676 KB Output is correct
13 Correct 9 ms 14804 KB Output is correct
14 Correct 9 ms 14804 KB Output is correct
15 Correct 8 ms 14676 KB Output is correct
16 Correct 9 ms 14676 KB Output is correct
17 Correct 9 ms 14848 KB Output is correct
18 Correct 8 ms 14604 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 8 ms 14676 KB Output is correct
21 Correct 234 ms 34104 KB Output is correct
22 Correct 119 ms 24936 KB Output is correct
23 Correct 216 ms 28716 KB Output is correct
24 Correct 129 ms 27732 KB Output is correct
25 Correct 1050 ms 83088 KB Output is correct
26 Correct 803 ms 71892 KB Output is correct
27 Correct 358 ms 51416 KB Output is correct
28 Correct 426 ms 49532 KB Output is correct
29 Correct 438 ms 49892 KB Output is correct
30 Correct 385 ms 49672 KB Output is correct
31 Correct 157 ms 38988 KB Output is correct
32 Correct 122 ms 22548 KB Output is correct
33 Correct 169 ms 26432 KB Output is correct
34 Correct 450 ms 47952 KB Output is correct
35 Correct 345 ms 40240 KB Output is correct
36 Correct 337 ms 46736 KB Output is correct
37 Correct 401 ms 48612 KB Output is correct
38 Correct 392 ms 55568 KB Output is correct
39 Correct 151 ms 24196 KB Output is correct
40 Correct 425 ms 49500 KB Output is correct
41 Correct 471 ms 49700 KB Output is correct
42 Correct 556 ms 62200 KB Output is correct
43 Correct 310 ms 36816 KB Output is correct
44 Correct 473 ms 36340 KB Output is correct
45 Correct 362 ms 47348 KB Output is correct
46 Correct 348 ms 47444 KB Output is correct
47 Correct 350 ms 48272 KB Output is correct
48 Correct 1109 ms 88236 KB Output is correct