oj.uz

Submission #500279

# Submission time Handle Problem Language Result Execution time Memory
500279 2021-12-30T15:15:07 Z couplefire Robot (JOI21_ho_t4) C++17
100 / 100
 163 ms 20332 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];
}

Subtask #1
34.0 / 34.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 7004 KB Output is correct
2 Correct 21 ms 5316 KB Output is correct
3 Correct 71 ms 12080 KB Output is correct
4 Correct 31 ms 6724 KB Output is correct
5 Correct 122 ms 19040 KB Output is correct
6 Correct 139 ms 19460 KB Output is correct
7 Correct 130 ms 17544 KB Output is correct
8 Correct 126 ms 17092 KB Output is correct
9 Correct 148 ms 17044 KB Output is correct
10 Correct 71 ms 11876 KB Output is correct
11 Correct 44 ms 9836 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 1 ms 2636 KB Output is correct
7 Correct 2 ms 2680 KB Output is correct
8 Correct 1 ms 2636 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 3 ms 2756 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 2 ms 2808 KB Output is correct
13 Correct 3 ms 2716 KB Output is correct
14 Correct 3 ms 2804 KB Output is correct
15 Correct 3 ms 2636 KB Output is correct
16 Correct 3 ms 2712 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 4 ms 2764 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 39 ms 7004 KB Output is correct
22 Correct 21 ms 5316 KB Output is correct
23 Correct 71 ms 12080 KB Output is correct
24 Correct 31 ms 6724 KB Output is correct
25 Correct 122 ms 19040 KB Output is correct
26 Correct 139 ms 19460 KB Output is correct
27 Correct 130 ms 17544 KB Output is correct
28 Correct 126 ms 17092 KB Output is correct
29 Correct 148 ms 17044 KB Output is correct
30 Correct 71 ms 11876 KB Output is correct
31 Correct 44 ms 9836 KB Output is correct
32 Correct 70 ms 12988 KB Output is correct
33 Correct 73 ms 11692 KB Output is correct
34 Correct 96 ms 14592 KB Output is correct
35 Correct 86 ms 12700 KB Output is correct
36 Correct 118 ms 12204 KB Output is correct
37 Correct 113 ms 14684 KB Output is correct
38 Correct 127 ms 17184 KB Output is correct
39 Correct 89 ms 16040 KB Output is correct
40 Correct 163 ms 18452 KB Output is correct
41 Correct 158 ms 18872 KB Output is correct
42 Correct 132 ms 17756 KB Output is correct
43 Correct 59 ms 10588 KB Output is correct
44 Correct 116 ms 17908 KB Output is correct
45 Correct 111 ms 14584 KB Output is correct
46 Correct 88 ms 13860 KB Output is correct
47 Correct 113 ms 14884 KB Output is correct
48 Correct 137 ms 20332 KB Output is correct