oj.uz

Submission #450520

# Submission time Handle Problem Language Result Execution time Memory
450520 2021-08-03T00:45:20 Z SirCovidThe19th Robot (JOI21_ho_t4) C++17
100 / 100
 1498 ms 86792 KB 
#include <bits/stdc++.h>
using namespace std; 

#define ll long long

const int mx = 1e5+5;

int n, m; map<int, vector<tuple<int, int>>> adj[mx]; 
map<int, ll> tot[mx], dst[mx];
priority_queue<tuple<ll, int, int>> pq;

void add(int b, int c, ll val){
    if (val < dst[b][c]) dst[b][c] = val, pq.push({-val, b, c});
}

int main(){
    cin >> n >> m;
    for (int i = 0; i < m; i++){
        int a, b, c, w; cin >> a >> b >> c >> w;
        adj[a][c].push_back({b, w});
        adj[b][c].push_back({a, w});
        tot[a][c] += w; tot[b][c] += w;
        dst[a][c] = dst[b][c] = 1e18;
    }for (int i = 1; i <= n; i++) dst[i][0] = 1e18;
	dst[1][0] = 0; pq.push({0, 1, 0});
    while (!pq.empty()){
        ll cst; int A, C; tie(cst, A, C) = pq.top(); cst *= -1; pq.pop();
        if (cst != dst[A][C]) continue;
        if (C){
            for (auto [b, w] : adj[A][C])
                add(b, 0, tot[A][C] - w + cst);
        }else{
            for (auto c : adj[A]) for (auto [b, w] : c.second){ 
                add(b, 0, tot[A][c.first] - w + cst);
                add(b, 0, w + cst);
                add(b, c.first, cst);
            }
        }
    }cout<<(dst[n][0] == 1e18 ? -1 : dst[n][0])<<endl;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14356 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 9 ms 14284 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14284 KB Output is correct
7 Correct 11 ms 14452 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 14 ms 15032 KB Output is correct
10 Correct 15 ms 14988 KB Output is correct
11 Correct 12 ms 14796 KB Output is correct
12 Correct 12 ms 14752 KB Output is correct
13 Correct 12 ms 14736 KB Output is correct
14 Correct 12 ms 14796 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 13 ms 14672 KB Output is correct
17 Correct 12 ms 14704 KB Output is correct
18 Correct 11 ms 14652 KB Output is correct
19 Correct 13 ms 14540 KB Output is correct
20 Correct 12 ms 14668 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 33436 KB Output is correct
2 Correct 140 ms 24600 KB Output is correct
3 Correct 383 ms 27608 KB Output is correct
4 Correct 243 ms 27768 KB Output is correct
5 Correct 1421 ms 81480 KB Output is correct
6 Correct 1159 ms 70320 KB Output is correct
7 Correct 663 ms 54876 KB Output is correct
8 Correct 643 ms 48000 KB Output is correct
9 Correct 675 ms 47940 KB Output is correct
10 Correct 552 ms 48700 KB Output is correct
11 Correct 264 ms 38212 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14356 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 9 ms 14284 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14284 KB Output is correct
7 Correct 11 ms 14452 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 14 ms 15032 KB Output is correct
10 Correct 15 ms 14988 KB Output is correct
11 Correct 12 ms 14796 KB Output is correct
12 Correct 12 ms 14752 KB Output is correct
13 Correct 12 ms 14736 KB Output is correct
14 Correct 12 ms 14796 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 13 ms 14672 KB Output is correct
17 Correct 12 ms 14704 KB Output is correct
18 Correct 11 ms 14652 KB Output is correct
19 Correct 13 ms 14540 KB Output is correct
20 Correct 12 ms 14668 KB Output is correct
21 Correct 341 ms 33436 KB Output is correct
22 Correct 140 ms 24600 KB Output is correct
23 Correct 383 ms 27608 KB Output is correct
24 Correct 243 ms 27768 KB Output is correct
25 Correct 1421 ms 81480 KB Output is correct
26 Correct 1159 ms 70320 KB Output is correct
27 Correct 663 ms 54876 KB Output is correct
28 Correct 643 ms 48000 KB Output is correct
29 Correct 675 ms 47940 KB Output is correct
30 Correct 552 ms 48700 KB Output is correct
31 Correct 264 ms 38212 KB Output is correct
32 Correct 295 ms 24932 KB Output is correct
33 Correct 361 ms 28532 KB Output is correct
34 Correct 733 ms 50640 KB Output is correct
35 Correct 549 ms 42352 KB Output is correct
36 Correct 555 ms 49592 KB Output is correct
37 Correct 665 ms 52812 KB Output is correct
38 Correct 660 ms 58448 KB Output is correct
39 Correct 371 ms 27700 KB Output is correct
40 Correct 687 ms 53268 KB Output is correct
41 Correct 755 ms 53564 KB Output is correct
42 Correct 856 ms 65584 KB Output is correct
43 Correct 416 ms 39024 KB Output is correct
44 Correct 765 ms 39616 KB Output is correct
45 Correct 579 ms 50100 KB Output is correct
46 Correct 493 ms 50176 KB Output is correct
47 Correct 637 ms 52944 KB Output is correct
48 Correct 1498 ms 86792 KB Output is correct