oj.uz

Submission #946159

# Submission time Handle Problem Language Result Execution time Memory
946159 2024-03-14T11:15:14 Z AverageAmogusEnjoyer Robot (JOI21_ho_t4) C++17
100 / 100
 422 ms 41620 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> bool cmin(T &i, T j) { return i > j ? i=j,true:false; }
template<class T> bool cmax(T &i, T j) { return i < j ? i=j,true:false; }

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<map<int,vector<pair<int,int>>>> adj(n);
    for (int i=0,u,v,c,w;i<m;i++) {
        cin >> u >> v >> c >> w;
        --u,--v;
        adj[u][c].emplace_back(v,w);
        adj[v][c].emplace_back(u,w);
    }
    const ll inf = 1e18;
    vector<ll> dist(n,inf);
    dist[0] = 0;
    set<pair<ll,int>> q;
    q.emplace(0,0);
    while(!q.empty()) {
        int x=(*q.begin()).second;q.erase(q.begin());
        for (auto &edges: adj[x]) {
            if (edges.second.size()==1) {
                for (auto &[y,w]: edges.second) {
                    ll p=dist[y];
                    if (cmin(dist[y],dist[x])) {
                        q.erase(make_pair(p,y));
                        q.emplace(dist[y],y);
                    }
                }
                continue;
            }
            multiset<ll> dists;
            ll sum=0;
            for (auto &[y,w]: edges.second) {
                dists.insert(dist[y]);
                sum+=w;
            }
            for (auto &[y,w]: edges.second) {
                dists.erase(dists.find(dist[y]));
                ll d=min({dist[x]+w,
                            *dists.begin()+sum-w,
                                dist[x]+sum-w});
                ll p=dist[y];
                if (cmin(dist[y],d)) {
                    q.erase(make_pair(p,y));
                    q.emplace(d,y);
                }
                dists.insert(dist[y]);
            }
        }
    }
    cout << (dist[n-1]==inf?-1:dist[n-1]) << endl;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 632 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 12108 KB Output is correct
2 Correct 25 ms 6316 KB Output is correct
3 Correct 89 ms 11092 KB Output is correct
4 Correct 61 ms 8532 KB Output is correct
5 Correct 378 ms 40228 KB Output is correct
6 Correct 310 ms 35904 KB Output is correct
7 Correct 219 ms 33320 KB Output is correct
8 Correct 221 ms 24892 KB Output is correct
9 Correct 191 ms 24656 KB Output is correct
10 Correct 115 ms 21060 KB Output is correct
11 Correct 50 ms 15956 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 632 KB Output is correct
21 Correct 73 ms 12108 KB Output is correct
22 Correct 25 ms 6316 KB Output is correct
23 Correct 89 ms 11092 KB Output is correct
24 Correct 61 ms 8532 KB Output is correct
25 Correct 378 ms 40228 KB Output is correct
26 Correct 310 ms 35904 KB Output is correct
27 Correct 219 ms 33320 KB Output is correct
28 Correct 221 ms 24892 KB Output is correct
29 Correct 191 ms 24656 KB Output is correct
30 Correct 115 ms 21060 KB Output is correct
31 Correct 50 ms 15956 KB Output is correct
32 Correct 104 ms 9296 KB Output is correct
33 Correct 91 ms 10320 KB Output is correct
34 Correct 157 ms 21588 KB Output is correct
35 Correct 139 ms 17236 KB Output is correct
36 Correct 167 ms 22860 KB Output is correct
37 Correct 178 ms 26316 KB Output is correct
38 Correct 222 ms 33040 KB Output is correct
39 Correct 123 ms 11668 KB Output is correct
40 Correct 228 ms 26196 KB Output is correct
41 Correct 216 ms 26192 KB Output is correct
42 Correct 248 ms 30548 KB Output is correct
43 Correct 84 ms 14164 KB Output is correct
44 Correct 167 ms 17236 KB Output is correct
45 Correct 157 ms 22932 KB Output is correct
46 Correct 132 ms 22696 KB Output is correct
47 Correct 180 ms 26436 KB Output is correct
48 Correct 422 ms 41620 KB Output is correct