oj.uz

Submission #388318

# Submission time Handle Problem Language Result Execution time Memory
388318 2021-04-10T22:36:30 Z Kepha Robot (JOI21_ho_t4) C++11
100 / 100
 1284 ms 79212 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 dp[MX + 1];
map<int, ll> dp2[MX + 1], sum[MX + 1];

int main() {;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v, c;
		ll p;
		cin >> u >> v >> c >> p;
		adj[u][c].push_back(Edge(c, v, p));
		adj[v][c].push_back(Edge(c, u, p));
		sum[u][c] += p;
		sum[v][c] += p;
	}

	fill(dp + 1, dp + 1 + n, INF);
	dp[1] = 0;
	priority_queue<tuple<ll, int, int>> pq;
	pq.push({0, 1, 0});
	while (pq.size()) {
		ll cost;
		int node, c;
		tie(cost, node, c) = pq.top();
		pq.pop();

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

	cout << (dp[n] >= INF ? -1 : dp[n]);
	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14396 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 8 ms 14380 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 14560 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 13 ms 14924 KB Output is correct
10 Correct 13 ms 14876 KB Output is correct
11 Correct 11 ms 14668 KB Output is correct
12 Correct 11 ms 14796 KB Output is correct
13 Correct 11 ms 14664 KB Output is correct
14 Correct 11 ms 14668 KB Output is correct
15 Correct 10 ms 14668 KB Output is correct
16 Correct 12 ms 14680 KB Output is correct
17 Correct 11 ms 14716 KB Output is correct
18 Correct 9 ms 14540 KB Output is correct
19 Correct 11 ms 14540 KB Output is correct
20 Correct 11 ms 14612 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 33108 KB Output is correct
2 Correct 113 ms 23996 KB Output is correct
3 Correct 350 ms 29028 KB Output is correct
4 Correct 169 ms 26812 KB Output is correct
5 Correct 1199 ms 78912 KB Output is correct
6 Correct 936 ms 68132 KB Output is correct
7 Correct 536 ms 52244 KB Output is correct
8 Correct 593 ms 46732 KB Output is correct
9 Correct 648 ms 46940 KB Output is correct
10 Correct 448 ms 45364 KB Output is correct
11 Correct 219 ms 30812 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14396 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14284 KB Output is correct
4 Correct 8 ms 14380 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 14560 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 13 ms 14924 KB Output is correct
10 Correct 13 ms 14876 KB Output is correct
11 Correct 11 ms 14668 KB Output is correct
12 Correct 11 ms 14796 KB Output is correct
13 Correct 11 ms 14664 KB Output is correct
14 Correct 11 ms 14668 KB Output is correct
15 Correct 10 ms 14668 KB Output is correct
16 Correct 12 ms 14680 KB Output is correct
17 Correct 11 ms 14716 KB Output is correct
18 Correct 9 ms 14540 KB Output is correct
19 Correct 11 ms 14540 KB Output is correct
20 Correct 11 ms 14612 KB Output is correct
21 Correct 289 ms 33108 KB Output is correct
22 Correct 113 ms 23996 KB Output is correct
23 Correct 350 ms 29028 KB Output is correct
24 Correct 169 ms 26812 KB Output is correct
25 Correct 1199 ms 78912 KB Output is correct
26 Correct 936 ms 68132 KB Output is correct
27 Correct 536 ms 52244 KB Output is correct
28 Correct 593 ms 46732 KB Output is correct
29 Correct 648 ms 46940 KB Output is correct
30 Correct 448 ms 45364 KB Output is correct
31 Correct 219 ms 30812 KB Output is correct
32 Correct 270 ms 24616 KB Output is correct
33 Correct 281 ms 26332 KB Output is correct
34 Correct 571 ms 46420 KB Output is correct
35 Correct 436 ms 38320 KB Output is correct
36 Correct 447 ms 44172 KB Output is correct
37 Correct 520 ms 45976 KB Output is correct
38 Correct 531 ms 51920 KB Output is correct
39 Correct 309 ms 27148 KB Output is correct
40 Correct 646 ms 46760 KB Output is correct
41 Correct 714 ms 46996 KB Output is correct
42 Correct 702 ms 56068 KB Output is correct
43 Correct 324 ms 34348 KB Output is correct
44 Correct 658 ms 37892 KB Output is correct
45 Correct 489 ms 43548 KB Output is correct
46 Correct 431 ms 44260 KB Output is correct
47 Correct 533 ms 45608 KB Output is correct
48 Correct 1284 ms 79212 KB Output is correct