oj.uz

Submission #518618

# Submission time Handle Problem Language Result Execution time Memory
518618 2022-01-24T09:53:21 Z KhoaHo Robot (JOI21_ho_t4) C++11
100 / 100
 192 ms 20248 KB 
    #include <bits/stdc++.h>
    #define fi first
    #define se second
    #define mp make_pair
    using namespace std;
    struct edge {
    	int v,c,cost;
    	edge(){}
    	edge(int _v, int _c, int _cost) {
    		v = _v;
    		c = _c;
    		cost = _cost;
    	}
    };
     
    const int N = 1e5 + 5;
    const int M = 2e5 + 5;
    const long long oo = 1e18;
     
    vector <edge> adj[N];
     
    long long dis[2 * N];
    long long sum[M];
    long long best[M];
     
    int n,m;
     
    template <typename T> 
    bool mini(T &a, T b) {
    	if (a > b) {
    		a = b;
    		return true;
    	}
    	return false;
    }
     
    int main() {
    	ios_base::sync_with_stdio(0);
    	cin.tie(0);
    	cin >> n >> m;
    	for (int i = 1; i <= m; i++) {
    		int u,v,c,w;
    		cin >> u >> v >> c >> w;
    		edge a = edge(v, c, w);
    		edge b = edge(u, c, w);
    		adj[u].push_back(a);
    		adj[v].push_back(b);
    	}
    	for (int i = 1; i <= n; i++)
    		dis[i] = oo;
    	
    	for (int i = 1; i <= m; i++)
    		best[i] = oo;
     
    	dis[1] = 0;
    	priority_queue <pair <long long, int>> heap;
    	heap.push(mp(0, 1));
    	while (heap.size()) {
    		int u = heap.top().se;
    		long long cur = -heap.top().fi;
    		heap.pop();
    		if (cur != dis[u])
    			continue;
     
    		for (edge e : adj[u]) {
    			sum[e.c] += e.cost;
    			best[e.c] = min(best[e.c], dis[e.v]);
    		}
     
    		for (edge e : adj[u]) {
    			int v = e.v;
    			int c = e.c;
    			int w = e.cost;
    			long long tmp = min(0LL + w, sum[c] - w);
    			if (mini(dis[v], cur + tmp)) 
    				heap.push(mp(-dis[v], v));
     
    			if (mini(dis[v], best[c] + sum[c] - w))
    				heap.push(mp(-dis[v], v));
    		}
     
    		for (edge e : adj[u]) {
    			sum[e.c] = 0;
    			best[e.c] = oo;
    		}
    	}
    	if (dis[n] == oo)
    		dis[n] = -1;
    	cout << dis[n];
    	return 0;
    }

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2680 KB Output is correct
9 Correct 2 ms 2892 KB Output is correct
10 Correct 3 ms 2808 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2812 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 3 ms 2732 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 2680 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 6972 KB Output is correct
2 Correct 26 ms 4684 KB Output is correct
3 Correct 64 ms 9720 KB Output is correct
4 Correct 36 ms 5812 KB Output is correct
5 Correct 112 ms 15208 KB Output is correct
6 Correct 120 ms 19228 KB Output is correct
7 Correct 121 ms 17584 KB Output is correct
8 Correct 130 ms 17092 KB Output is correct
9 Correct 118 ms 17032 KB Output is correct
10 Correct 89 ms 11896 KB Output is correct
11 Correct 44 ms 9764 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2680 KB Output is correct
9 Correct 2 ms 2892 KB Output is correct
10 Correct 3 ms 2808 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2812 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 3 ms 2732 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 2680 KB Output is correct
21 Correct 41 ms 6972 KB Output is correct
22 Correct 26 ms 4684 KB Output is correct
23 Correct 64 ms 9720 KB Output is correct
24 Correct 36 ms 5812 KB Output is correct
25 Correct 112 ms 15208 KB Output is correct
26 Correct 120 ms 19228 KB Output is correct
27 Correct 121 ms 17584 KB Output is correct
28 Correct 130 ms 17092 KB Output is correct
29 Correct 118 ms 17032 KB Output is correct
30 Correct 89 ms 11896 KB Output is correct
31 Correct 44 ms 9764 KB Output is correct
32 Correct 61 ms 13020 KB Output is correct
33 Correct 63 ms 11668 KB Output is correct
34 Correct 101 ms 14632 KB Output is correct
35 Correct 97 ms 12728 KB Output is correct
36 Correct 125 ms 12144 KB Output is correct
37 Correct 108 ms 14648 KB Output is correct
38 Correct 111 ms 17252 KB Output is correct
39 Correct 92 ms 15972 KB Output is correct
40 Correct 155 ms 18460 KB Output is correct
41 Correct 192 ms 18656 KB Output is correct
42 Correct 124 ms 17784 KB Output is correct
43 Correct 60 ms 10552 KB Output is correct
44 Correct 107 ms 17804 KB Output is correct
45 Correct 116 ms 14632 KB Output is correct
46 Correct 122 ms 13900 KB Output is correct
47 Correct 109 ms 14892 KB Output is correct
48 Correct 142 ms 20248 KB Output is correct