oj.uz

Submission #388322

# Submission time Handle Problem Language Result Execution time Memory
388322 2021-04-10T22:41:34 Z Kepha Robot (JOI21_ho_t4) C++11
100 / 100
 1252 ms 79408 KB 
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f3f3f3f3f
#define MX 100000
#define ll long long
using namespace std;

struct Edge {
    int color, next;
    ll price;

    Edge (int _color = 0, int _next = 0, ll _price = 0) {
        color = _color, next = _next, price = _price;
    }
};

int N, M;
map<int, vector<Edge>> adj[MX + 1];
ll dist1[MX + 1];
map<int, ll> dist2[MX + 1], sum[MX + 1];

int main() {;
	cin >> N >> M;
	for (int i = 1; i <= M; i++) {
		int a, b, c;
		ll d;
		cin >> a >> b >> c >> d;
		adj[a][c].push_back(Edge(c, b, d));
		adj[b][c].push_back(Edge(c, a, d));
		sum[a][c] += d;
		sum[b][c] += d;
	}

	fill(dist1 + 1, dist1 + 1 + N, INF);
	dist1[1] = 0;
	priority_queue<tuple<ll, int, int>> q;
	q.push({0, 1, 0});

	while (q.size()) {
		ll cost;
		int node, color;
		tie(cost, node, color) = q.top();
		q.pop();

		if (color) {
			if (dist2[node][color] != -cost) continue;
			for (Edge edge : adj[node][color]) {
				// We can't flip i in this case
				ll case1 = sum[node][color] - edge.price;
				if (case1 - cost < dist1[edge.next]) {
					dist1[edge.next] = case1 - cost;
					q.push({-dist1[edge.next], edge.next, 0});
				}
			}
		}
		else {
			if (dist1[node] != -cost) continue;
			for (auto& c : adj[node]) {
				for (Edge edge : c.second) {
					// Case 1: We don't flip j
					ll case1 = sum[node][edge.color] - edge.price - cost;
					if (case1 < dist1[edge.next]) {
						dist1[edge.next] = case1;
						q.push({-dist1[edge.next], edge.next, 0});
					}
					// Case 2: We flip j but not another edge of the same colour
					ll case2 = edge.price - cost;
					if (case2 < dist1[edge.next]) {
						dist1[edge.next] = case2;
						q.push({-dist1[edge.next], edge.next, 0});
					}
					// Case 3: We flip j and another edge of the same colour
					ll case3 = -cost;
					if (!dist2[edge.next].count(edge.color) || case3 < dist2[edge.next][edge.color]) {
						dist2[edge.next][edge.color] = case3;
						q.push({-dist2[edge.next][edge.color], edge.next, edge.color});
					}
				}
			}
		}
	}

	if (dist1[N] >= INF) cout << "-1\n";
	else cout << dist1[N] << "\n";

	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14284 KB Output is correct
3 Correct 8 ms 14284 KB Output is correct
4 Correct 8 ms 14284 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 8 ms 14284 KB Output is correct
7 Correct 10 ms 14484 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 13 ms 14924 KB Output is correct
10 Correct 12 ms 14852 KB Output is correct
11 Correct 12 ms 14668 KB Output is correct
12 Correct 11 ms 14712 KB Output is correct
13 Correct 11 ms 14668 KB Output is correct
14 Correct 11 ms 14668 KB Output is correct
15 Correct 10 ms 14540 KB Output is correct
16 Correct 11 ms 14668 KB Output is correct
17 Correct 11 ms 14688 KB Output is correct
18 Correct 9 ms 14512 KB Output is correct
19 Correct 14 ms 14540 KB Output is correct
20 Correct 11 ms 14592 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 32996 KB Output is correct
2 Correct 108 ms 23960 KB Output is correct
3 Correct 302 ms 29056 KB Output is correct
4 Correct 161 ms 26680 KB Output is correct
5 Correct 1162 ms 78884 KB Output is correct
6 Correct 903 ms 68124 KB Output is correct
7 Correct 526 ms 52252 KB Output is correct
8 Correct 589 ms 46820 KB Output is correct
9 Correct 608 ms 46940 KB Output is correct
10 Correct 436 ms 45560 KB Output is correct
11 Correct 217 ms 30768 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14284 KB Output is correct
3 Correct 8 ms 14284 KB Output is correct
4 Correct 8 ms 14284 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 8 ms 14284 KB Output is correct
7 Correct 10 ms 14484 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 13 ms 14924 KB Output is correct
10 Correct 12 ms 14852 KB Output is correct
11 Correct 12 ms 14668 KB Output is correct
12 Correct 11 ms 14712 KB Output is correct
13 Correct 11 ms 14668 KB Output is correct
14 Correct 11 ms 14668 KB Output is correct
15 Correct 10 ms 14540 KB Output is correct
16 Correct 11 ms 14668 KB Output is correct
17 Correct 11 ms 14688 KB Output is correct
18 Correct 9 ms 14512 KB Output is correct
19 Correct 14 ms 14540 KB Output is correct
20 Correct 11 ms 14592 KB Output is correct
21 Correct 260 ms 32996 KB Output is correct
22 Correct 108 ms 23960 KB Output is correct
23 Correct 302 ms 29056 KB Output is correct
24 Correct 161 ms 26680 KB Output is correct
25 Correct 1162 ms 78884 KB Output is correct
26 Correct 903 ms 68124 KB Output is correct
27 Correct 526 ms 52252 KB Output is correct
28 Correct 589 ms 46820 KB Output is correct
29 Correct 608 ms 46940 KB Output is correct
30 Correct 436 ms 45560 KB Output is correct
31 Correct 217 ms 30768 KB Output is correct
32 Correct 283 ms 24760 KB Output is correct
33 Correct 258 ms 26260 KB Output is correct
34 Correct 558 ms 46500 KB Output is correct
35 Correct 422 ms 38320 KB Output is correct
36 Correct 435 ms 44080 KB Output is correct
37 Correct 511 ms 45868 KB Output is correct
38 Correct 509 ms 51912 KB Output is correct
39 Correct 315 ms 27180 KB Output is correct
40 Correct 644 ms 46848 KB Output is correct
41 Correct 667 ms 46784 KB Output is correct
42 Correct 701 ms 55992 KB Output is correct
43 Correct 307 ms 34356 KB Output is correct
44 Correct 637 ms 37728 KB Output is correct
45 Correct 480 ms 43588 KB Output is correct
46 Correct 423 ms 44100 KB Output is correct
47 Correct 512 ms 45720 KB Output is correct
48 Correct 1252 ms 79408 KB Output is correct