oj.uz

Submission #388324

# Submission time Handle Problem Language Result Execution time Memory
388324 2021-04-10T22:48:47 Z Kepha Robot (JOI21_ho_t4) C++11
100 / 100
 1101 ms 79260 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;
    }
};

struct Node {
    ll dist;
    int color, cur;

    Node (ll _dist = 0, int _color = 0, int _cur = 0) {
        dist = _dist, color = _color, cur = _cur;
    }

    bool operator<(const Node& x) const { return dist > x.dist; }
};

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

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;
	q.push(Node(0, 0, 1));

	while (q.size()) {
		ll cost = q.top().dist;
		int node = q.top().cur, color = q.top().color;
		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(Node(dist1[edge.next], 0, edge.next));
				}
			}
		}
		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(Node(dist1[edge.next], 0, edge.next));
					}
					// 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(Node(dist1[edge.next], 0, edge.next));
					}
					// 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(Node(dist2[edge.next][edge.color], edge.color, edge.next));
					}
				}
			}
		}
	}

	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 14288 KB Output is correct
2 Correct 8 ms 14284 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 9 ms 14284 KB Output is correct
5 Correct 10 ms 14328 KB Output is correct
6 Correct 9 ms 14284 KB Output is correct
7 Correct 10 ms 14540 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 14932 KB Output is correct
11 Correct 11 ms 14668 KB Output is correct
12 Correct 10 ms 14668 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 14668 KB Output is correct
16 Correct 11 ms 14708 KB Output is correct
17 Correct 11 ms 14668 KB Output is correct
18 Correct 9 ms 14540 KB Output is correct
19 Correct 11 ms 14628 KB Output is correct
20 Correct 10 ms 14668 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 32940 KB Output is correct
2 Correct 129 ms 23968 KB Output is correct
3 Correct 303 ms 29060 KB Output is correct
4 Correct 165 ms 26608 KB Output is correct
5 Correct 1101 ms 78712 KB Output is correct
6 Correct 878 ms 68352 KB Output is correct
7 Correct 503 ms 52224 KB Output is correct
8 Correct 598 ms 46768 KB Output is correct
9 Correct 652 ms 46844 KB Output is correct
10 Correct 430 ms 45464 KB Output is correct
11 Correct 220 ms 30732 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 8 ms 14284 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 9 ms 14284 KB Output is correct
5 Correct 10 ms 14328 KB Output is correct
6 Correct 9 ms 14284 KB Output is correct
7 Correct 10 ms 14540 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 14932 KB Output is correct
11 Correct 11 ms 14668 KB Output is correct
12 Correct 10 ms 14668 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 14668 KB Output is correct
16 Correct 11 ms 14708 KB Output is correct
17 Correct 11 ms 14668 KB Output is correct
18 Correct 9 ms 14540 KB Output is correct
19 Correct 11 ms 14628 KB Output is correct
20 Correct 10 ms 14668 KB Output is correct
21 Correct 273 ms 32940 KB Output is correct
22 Correct 129 ms 23968 KB Output is correct
23 Correct 303 ms 29060 KB Output is correct
24 Correct 165 ms 26608 KB Output is correct
25 Correct 1101 ms 78712 KB Output is correct
26 Correct 878 ms 68352 KB Output is correct
27 Correct 503 ms 52224 KB Output is correct
28 Correct 598 ms 46768 KB Output is correct
29 Correct 652 ms 46844 KB Output is correct
30 Correct 430 ms 45464 KB Output is correct
31 Correct 220 ms 30732 KB Output is correct
32 Correct 309 ms 24588 KB Output is correct
33 Correct 269 ms 26304 KB Output is correct
34 Correct 581 ms 46408 KB Output is correct
35 Correct 434 ms 38252 KB Output is correct
36 Correct 424 ms 44044 KB Output is correct
37 Correct 493 ms 45908 KB Output is correct
38 Correct 493 ms 51932 KB Output is correct
39 Correct 317 ms 27236 KB Output is correct
40 Correct 634 ms 46860 KB Output is correct
41 Correct 667 ms 46904 KB Output is correct
42 Correct 782 ms 55932 KB Output is correct
43 Correct 316 ms 34348 KB Output is correct
44 Correct 629 ms 37780 KB Output is correct
45 Correct 471 ms 43580 KB Output is correct
46 Correct 434 ms 44296 KB Output is correct
47 Correct 480 ms 45704 KB Output is correct
48 Correct 1067 ms 79260 KB Output is correct