oj.uz

Submission #546094

# Submission time Handle Problem Language Result Execution time Memory
546094 2022-04-06T10:44:09 Z someone Robot (JOI21_ho_t4) C++14
100 / 100
 1212 ms 127576 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
struct Arc {
    int nex, pds, col;
};
 
struct Sit {
    int i, col, t;
    
    bool operator <(const Sit& other) const {
        return t > other.t;
    }
};
 
const int N = 1e5 + 42, M = 4e5 + 42, INF = 1e18 + 42;
 
int n, m, id = 0;
priority_queue<Sit> q;
vector<Arc> adj[N], adjCol[M];
unordered_map<int, int> idAdj[N];
unordered_map<int, int> tot[N], dist[N];
 
void Dijkstra() {
    while(!q.empty()) {
        Sit sit = q.top();
        q.pop();
        int i = sit.i, col = sit.col, t = sit.t;
        if(t == dist[i][col]) {
            if(col == 0) {
                for(Arc arc : adj[i]) {
                    if(dist[arc.nex][0] > t + min(arc.pds, tot[i][arc.col] - arc.pds)) {
                        dist[arc.nex][0] = t + min(arc.pds, tot[i][arc.col] - arc.pds);
                        q.push({arc.nex, 0, dist[arc.nex][0]});
                    }
                    if(dist[arc.nex][arc.col] > t) {
                        dist[arc.nex][arc.col] = t;
                        q.push({arc.nex, arc.col, t});
                    }
                }
            } else {
                t += tot[i][col];
                int j = idAdj[i][col];
                for(Arc arc : adjCol[j])
                    if(dist[arc.nex][0] > t - arc.pds) {
                        dist[arc.nex][0] = t - arc.pds;
                        q.push({arc.nex, 0, t - arc.pds});
                    }
            }
        }
    }
}
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b, col, pds;
        cin >> a >> b >> col >> pds;
        a--, b--;
        tot[a][col] += pds;
        tot[b][col] += pds;
        adj[a].push_back({b, pds, col});
        adj[b].push_back({a, pds, col});
        dist[a][col] = dist[b][col] = INF;
        if(idAdj[a].find(col) == idAdj[a].end())
            idAdj[a][col] = id++;
        if(idAdj[b].find(col) == idAdj[b].end())
            idAdj[b][col] = id++;
        adjCol[idAdj[a][col]].push_back({b, pds, col});
        adjCol[idAdj[b][col]].push_back({a, pds, col});
    }
    for(int i = 0; i < n; i++)
        dist[i][0] = INF;
    
    for(auto p : dist[0]) {
        q.push({0, p.first, 0});
        dist[0][p.first] = 0;
    }
    
    Dijkstra();
    
    if(dist[n-1][0] == INF)
        cout << -1;
    else
        cout << dist[n-1][0];
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 16 ms 28444 KB Output is correct
3 Correct 15 ms 28500 KB Output is correct
4 Correct 15 ms 28500 KB Output is correct
5 Correct 16 ms 28488 KB Output is correct
6 Correct 18 ms 28436 KB Output is correct
7 Correct 20 ms 28628 KB Output is correct
8 Correct 16 ms 28540 KB Output is correct
9 Correct 20 ms 29452 KB Output is correct
10 Correct 18 ms 29416 KB Output is correct
11 Correct 19 ms 29280 KB Output is correct
12 Correct 18 ms 29140 KB Output is correct
13 Correct 18 ms 29364 KB Output is correct
14 Correct 20 ms 29292 KB Output is correct
15 Correct 18 ms 29012 KB Output is correct
16 Correct 21 ms 29264 KB Output is correct
17 Correct 19 ms 29140 KB Output is correct
18 Correct 18 ms 28884 KB Output is correct
19 Correct 21 ms 28968 KB Output is correct
20 Correct 20 ms 29196 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 56764 KB Output is correct
2 Correct 147 ms 43148 KB Output is correct
3 Correct 381 ms 61944 KB Output is correct
4 Correct 230 ms 50224 KB Output is correct
5 Correct 1110 ms 127576 KB Output is correct
6 Correct 1029 ms 117920 KB Output is correct
7 Correct 640 ms 106004 KB Output is correct
8 Correct 841 ms 104964 KB Output is correct
9 Correct 827 ms 105036 KB Output is correct
10 Correct 547 ms 79372 KB Output is correct
11 Correct 382 ms 78412 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 16 ms 28444 KB Output is correct
3 Correct 15 ms 28500 KB Output is correct
4 Correct 15 ms 28500 KB Output is correct
5 Correct 16 ms 28488 KB Output is correct
6 Correct 18 ms 28436 KB Output is correct
7 Correct 20 ms 28628 KB Output is correct
8 Correct 16 ms 28540 KB Output is correct
9 Correct 20 ms 29452 KB Output is correct
10 Correct 18 ms 29416 KB Output is correct
11 Correct 19 ms 29280 KB Output is correct
12 Correct 18 ms 29140 KB Output is correct
13 Correct 18 ms 29364 KB Output is correct
14 Correct 20 ms 29292 KB Output is correct
15 Correct 18 ms 29012 KB Output is correct
16 Correct 21 ms 29264 KB Output is correct
17 Correct 19 ms 29140 KB Output is correct
18 Correct 18 ms 28884 KB Output is correct
19 Correct 21 ms 28968 KB Output is correct
20 Correct 20 ms 29196 KB Output is correct
21 Correct 337 ms 56764 KB Output is correct
22 Correct 147 ms 43148 KB Output is correct
23 Correct 381 ms 61944 KB Output is correct
24 Correct 230 ms 50224 KB Output is correct
25 Correct 1110 ms 127576 KB Output is correct
26 Correct 1029 ms 117920 KB Output is correct
27 Correct 640 ms 106004 KB Output is correct
28 Correct 841 ms 104964 KB Output is correct
29 Correct 827 ms 105036 KB Output is correct
30 Correct 547 ms 79372 KB Output is correct
31 Correct 382 ms 78412 KB Output is correct
32 Correct 198 ms 57156 KB Output is correct
33 Correct 344 ms 60964 KB Output is correct
34 Correct 639 ms 79632 KB Output is correct
35 Correct 548 ms 72664 KB Output is correct
36 Correct 591 ms 94680 KB Output is correct
37 Correct 718 ms 101468 KB Output is correct
38 Correct 659 ms 111992 KB Output is correct
39 Correct 347 ms 67456 KB Output is correct
40 Correct 894 ms 106228 KB Output is correct
41 Correct 924 ms 106428 KB Output is correct
42 Correct 853 ms 107724 KB Output is correct
43 Correct 361 ms 60196 KB Output is correct
44 Correct 648 ms 75280 KB Output is correct
45 Correct 757 ms 97796 KB Output is correct
46 Correct 568 ms 96440 KB Output is correct
47 Correct 592 ms 97872 KB Output is correct
48 Correct 1212 ms 127300 KB Output is correct