oj.uz

Submission #746215

# Submission time Handle Problem Language Result Execution time Memory
746215 2023-05-21T22:43:18 Z stevancv Robot (JOI21_ho_t4) C++14
58 / 100
 3000 ms 83016 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 (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 7 ms 14420 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 8 ms 14468 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 7 ms 14548 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 11 ms 15024 KB Output is correct
10 Correct 10 ms 15004 KB Output is correct
11 Correct 8 ms 14804 KB Output is correct
12 Correct 11 ms 14692 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 14628 KB Output is correct
16 Correct 10 ms 14676 KB Output is correct
17 Correct 9 ms 14804 KB Output is correct
18 Correct 9 ms 14676 KB Output is correct
19 Correct 11 ms 14712 KB Output is correct
20 Correct 9 ms 14676 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 34012 KB Output is correct
2 Correct 90 ms 24896 KB Output is correct
3 Correct 262 ms 28612 KB Output is correct
4 Correct 133 ms 27796 KB Output is correct
5 Correct 1082 ms 83016 KB Output is correct
6 Correct 780 ms 71908 KB Output is correct
7 Correct 346 ms 51520 KB Output is correct
8 Correct 438 ms 49772 KB Output is correct
9 Correct 437 ms 49532 KB Output is correct
10 Correct 398 ms 50000 KB Output is correct
11 Correct 175 ms 39208 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 8 ms 14468 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 7 ms 14548 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 11 ms 15024 KB Output is correct
10 Correct 10 ms 15004 KB Output is correct
11 Correct 8 ms 14804 KB Output is correct
12 Correct 11 ms 14692 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 14628 KB Output is correct
16 Correct 10 ms 14676 KB Output is correct
17 Correct 9 ms 14804 KB Output is correct
18 Correct 9 ms 14676 KB Output is correct
19 Correct 11 ms 14712 KB Output is correct
20 Correct 9 ms 14676 KB Output is correct
21 Correct 233 ms 34012 KB Output is correct
22 Correct 90 ms 24896 KB Output is correct
23 Correct 262 ms 28612 KB Output is correct
24 Correct 133 ms 27796 KB Output is correct
25 Correct 1082 ms 83016 KB Output is correct
26 Correct 780 ms 71908 KB Output is correct
27 Correct 346 ms 51520 KB Output is correct
28 Correct 438 ms 49772 KB Output is correct
29 Correct 437 ms 49532 KB Output is correct
30 Correct 398 ms 50000 KB Output is correct
31 Correct 175 ms 39208 KB Output is correct
32 Correct 219 ms 22516 KB Output is correct
33 Correct 219 ms 26340 KB Output is correct
34 Correct 597 ms 48048 KB Output is correct
35 Correct 374 ms 40232 KB Output is correct
36 Correct 371 ms 46808 KB Output is correct
37 Correct 424 ms 48796 KB Output is correct
38 Correct 404 ms 55588 KB Output is correct
39 Correct 195 ms 24388 KB Output is correct
40 Correct 424 ms 49540 KB Output is correct
41 Correct 521 ms 49584 KB Output is correct
42 Correct 606 ms 62172 KB Output is correct
43 Correct 323 ms 36792 KB Output is correct
44 Correct 656 ms 36372 KB Output is correct
45 Correct 360 ms 47340 KB Output is correct
46 Correct 314 ms 47484 KB Output is correct
47 Execution timed out 3069 ms 48228 KB Time limit exceeded
48 Halted 0 ms 0 KB -