oj.uz

Submission #385540

# Submission time Handle Problem Language Result Execution time Memory
385540 2021-04-04T14:42:01 Z ngpin04 Robot (JOI21_ho_t4) C++14
100 / 100
 191 ms 20376 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 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 4 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 3 ms 2668 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 4 ms 2796 KB Output is correct
9 Correct 4 ms 2796 KB Output is correct
10 Correct 4 ms 2924 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 4 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct
16 Correct 4 ms 2924 KB Output is correct
17 Correct 4 ms 2796 KB Output is correct
18 Correct 3 ms 2796 KB Output is correct
19 Correct 4 ms 2924 KB Output is correct
20 Correct 4 ms 2796 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 8588 KB Output is correct
2 Correct 24 ms 5484 KB Output is correct
3 Correct 76 ms 12268 KB Output is correct
4 Correct 37 ms 6764 KB Output is correct
5 Correct 167 ms 19156 KB Output is correct
6 Correct 152 ms 19216 KB Output is correct
7 Correct 130 ms 17620 KB Output is correct
8 Correct 177 ms 17260 KB Output is correct
9 Correct 181 ms 17260 KB Output is correct
10 Correct 112 ms 12012 KB Output is correct
11 Correct 62 ms 9836 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 4 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 3 ms 2668 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 4 ms 2796 KB Output is correct
9 Correct 4 ms 2796 KB Output is correct
10 Correct 4 ms 2924 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 4 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct
16 Correct 4 ms 2924 KB Output is correct
17 Correct 4 ms 2796 KB Output is correct
18 Correct 3 ms 2796 KB Output is correct
19 Correct 4 ms 2924 KB Output is correct
20 Correct 4 ms 2796 KB Output is correct
21 Correct 55 ms 8588 KB Output is correct
22 Correct 24 ms 5484 KB Output is correct
23 Correct 76 ms 12268 KB Output is correct
24 Correct 37 ms 6764 KB Output is correct
25 Correct 167 ms 19156 KB Output is correct
26 Correct 152 ms 19216 KB Output is correct
27 Correct 130 ms 17620 KB Output is correct
28 Correct 177 ms 17260 KB Output is correct
29 Correct 181 ms 17260 KB Output is correct
30 Correct 112 ms 12012 KB Output is correct
31 Correct 62 ms 9836 KB Output is correct
32 Correct 77 ms 13152 KB Output is correct
33 Correct 78 ms 11760 KB Output is correct
34 Correct 120 ms 14700 KB Output is correct
35 Correct 93 ms 12780 KB Output is correct
36 Correct 110 ms 12256 KB Output is correct
37 Correct 126 ms 14684 KB Output is correct
38 Correct 134 ms 17364 KB Output is correct
39 Correct 116 ms 16236 KB Output is correct
40 Correct 191 ms 18488 KB Output is correct
41 Correct 190 ms 18668 KB Output is correct
42 Correct 179 ms 17900 KB Output is correct
43 Correct 69 ms 10600 KB Output is correct
44 Correct 121 ms 17896 KB Output is correct
45 Correct 134 ms 14700 KB Output is correct
46 Correct 139 ms 14060 KB Output is correct
47 Correct 140 ms 15096 KB Output is correct
48 Correct 180 ms 20376 KB Output is correct