oj.uz

Submission #746214

# Submission time Handle Problem Language Result Execution time Memory
746214 2023-05-21T22:41:07 Z stevancv Robot (JOI21_ho_t4) C++14
58 / 100
 3000 ms 83328 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 8 ms 14400 KB Output is correct
2 Correct 9 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14320 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 9 ms 14560 KB Output is correct
8 Correct 13 ms 14420 KB Output is correct
9 Correct 13 ms 15092 KB Output is correct
10 Correct 12 ms 14932 KB Output is correct
11 Correct 15 ms 14804 KB Output is correct
12 Correct 10 ms 14772 KB Output is correct
13 Correct 10 ms 14816 KB Output is correct
14 Correct 16 ms 14856 KB Output is correct
15 Correct 8 ms 14684 KB Output is correct
16 Correct 10 ms 14804 KB Output is correct
17 Correct 11 ms 14804 KB Output is correct
18 Correct 13 ms 14676 KB Output is correct
19 Correct 16 ms 14676 KB Output is correct
20 Correct 12 ms 14716 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 34268 KB Output is correct
2 Correct 228 ms 25188 KB Output is correct
3 Correct 262 ms 28904 KB Output is correct
4 Correct 158 ms 27968 KB Output is correct
5 Correct 1132 ms 83328 KB Output is correct
6 Correct 854 ms 72136 KB Output is correct
7 Correct 382 ms 52536 KB Output is correct
8 Correct 439 ms 49884 KB Output is correct
9 Correct 487 ms 49856 KB Output is correct
10 Correct 419 ms 49992 KB Output is correct
11 Correct 171 ms 39276 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14400 KB Output is correct
2 Correct 9 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14320 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 9 ms 14560 KB Output is correct
8 Correct 13 ms 14420 KB Output is correct
9 Correct 13 ms 15092 KB Output is correct
10 Correct 12 ms 14932 KB Output is correct
11 Correct 15 ms 14804 KB Output is correct
12 Correct 10 ms 14772 KB Output is correct
13 Correct 10 ms 14816 KB Output is correct
14 Correct 16 ms 14856 KB Output is correct
15 Correct 8 ms 14684 KB Output is correct
16 Correct 10 ms 14804 KB Output is correct
17 Correct 11 ms 14804 KB Output is correct
18 Correct 13 ms 14676 KB Output is correct
19 Correct 16 ms 14676 KB Output is correct
20 Correct 12 ms 14716 KB Output is correct
21 Correct 273 ms 34268 KB Output is correct
22 Correct 228 ms 25188 KB Output is correct
23 Correct 262 ms 28904 KB Output is correct
24 Correct 158 ms 27968 KB Output is correct
25 Correct 1132 ms 83328 KB Output is correct
26 Correct 854 ms 72136 KB Output is correct
27 Correct 382 ms 52536 KB Output is correct
28 Correct 439 ms 49884 KB Output is correct
29 Correct 487 ms 49856 KB Output is correct
30 Correct 419 ms 49992 KB Output is correct
31 Correct 171 ms 39276 KB Output is correct
32 Correct 227 ms 22836 KB Output is correct
33 Correct 321 ms 26640 KB Output is correct
34 Correct 616 ms 48272 KB Output is correct
35 Correct 423 ms 40484 KB Output is correct
36 Correct 359 ms 47200 KB Output is correct
37 Correct 421 ms 49216 KB Output is correct
38 Correct 422 ms 56576 KB Output is correct
39 Correct 224 ms 24548 KB Output is correct
40 Correct 434 ms 50008 KB Output is correct
41 Correct 510 ms 49956 KB Output is correct
42 Correct 629 ms 62452 KB Output is correct
43 Correct 298 ms 37148 KB Output is correct
44 Correct 617 ms 36580 KB Output is correct
45 Correct 376 ms 47580 KB Output is correct
46 Correct 303 ms 47832 KB Output is correct
47 Execution timed out 3055 ms 48988 KB Time limit exceeded
48 Halted 0 ms 0 KB -