oj.uz

Submission #925318

# Submission time Handle Problem Language Result Execution time Memory
925318 2024-02-11T11:52:06 Z crafticat Robot (JOI21_ho_t4) C++17
100 / 100
 872 ms 84632 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll INF = 1e18;

struct Edge {
	int to, c;
	ll p;
};

map<int, vector<Edge>> graph[100001];
ll dp[100001];
map<int, ll> dp2[100001], psum[100001];

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v, c;
		ll p;
		cin >> u >> v >> c >> p;
		graph[u][c].push_back({v, c, p});
		graph[v][c].push_back({u, c, p});
		psum[u][c] += p;
		psum[v][c] += p;
	}

	memset(dp, 0x3f, sizeof dp);
	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 : graph[node][c]) {
				// We can't flip i in this case
				ll case1 = psum[node][c] - i.p;
				if (case1 - cost < dp[i.to]) {
					dp[i.to] = case1 - cost;
					pq.push({-dp[i.to], i.to, 0});
				}
			}
		} else {
			if (dp[node] != -cost) continue;
			for (auto &i : graph[node]) {
				for (Edge j : i.second) {
					// Case 1: We don't flip j
					ll case1 = psum[node][j.c] - j.p - cost;
					if (case1 < dp[j.to]) {
						dp[j.to] = case1;
						pq.push({-dp[j.to], j.to, 0});
					}
					// Case 2: We flip j but not another edge of the same colour
					ll case2 = j.p - cost;
					if (case2 < dp[j.to]) {
						dp[j.to] = case2;
						pq.push({-dp[j.to], j.to, 0});
					}
					// Case 3: We flip j and another edge of the same colour
					ll case3 = -cost;
					if (!dp2[j.to].count(j.c) || case3 < dp2[j.to][j.c]) {
						dp2[j.to][j.c] = case3;
						pq.push({-dp2[j.to][j.c], j.to, j.c});
					}
				}
			}
		}
	}
	cout << (dp[n] > INF ? -1 : dp[n]);
	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 4 ms 15448 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15368 KB Output is correct
6 Correct 3 ms 15448 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15352 KB Output is correct
9 Correct 7 ms 15792 KB Output is correct
10 Correct 5 ms 15708 KB Output is correct
11 Correct 4 ms 15448 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 4 ms 15544 KB Output is correct
15 Correct 4 ms 15452 KB Output is correct
16 Correct 4 ms 15448 KB Output is correct
17 Correct 4 ms 15448 KB Output is correct
18 Correct 3 ms 15288 KB Output is correct
19 Correct 4 ms 15380 KB Output is correct
20 Correct 4 ms 15448 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 33672 KB Output is correct
2 Correct 52 ms 24776 KB Output is correct
3 Correct 113 ms 29892 KB Output is correct
4 Correct 80 ms 27400 KB Output is correct
5 Correct 785 ms 78880 KB Output is correct
6 Correct 577 ms 71940 KB Output is correct
7 Correct 282 ms 58580 KB Output is correct
8 Correct 336 ms 51032 KB Output is correct
9 Correct 316 ms 51024 KB Output is correct
10 Correct 241 ms 48240 KB Output is correct
11 Correct 92 ms 32852 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 4 ms 15448 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15368 KB Output is correct
6 Correct 3 ms 15448 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15352 KB Output is correct
9 Correct 7 ms 15792 KB Output is correct
10 Correct 5 ms 15708 KB Output is correct
11 Correct 4 ms 15448 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 4 ms 15544 KB Output is correct
15 Correct 4 ms 15452 KB Output is correct
16 Correct 4 ms 15448 KB Output is correct
17 Correct 4 ms 15448 KB Output is correct
18 Correct 3 ms 15288 KB Output is correct
19 Correct 4 ms 15380 KB Output is correct
20 Correct 4 ms 15448 KB Output is correct
21 Correct 149 ms 33672 KB Output is correct
22 Correct 52 ms 24776 KB Output is correct
23 Correct 113 ms 29892 KB Output is correct
24 Correct 80 ms 27400 KB Output is correct
25 Correct 785 ms 78880 KB Output is correct
26 Correct 577 ms 71940 KB Output is correct
27 Correct 282 ms 58580 KB Output is correct
28 Correct 336 ms 51032 KB Output is correct
29 Correct 316 ms 51024 KB Output is correct
30 Correct 241 ms 48240 KB Output is correct
31 Correct 92 ms 32852 KB Output is correct
32 Correct 83 ms 29140 KB Output is correct
33 Correct 87 ms 29896 KB Output is correct
34 Correct 306 ms 50620 KB Output is correct
35 Correct 264 ms 41904 KB Output is correct
36 Correct 240 ms 46948 KB Output is correct
37 Correct 303 ms 51128 KB Output is correct
38 Correct 287 ms 57268 KB Output is correct
39 Correct 89 ms 32692 KB Output is correct
40 Correct 333 ms 52520 KB Output is correct
41 Correct 343 ms 52824 KB Output is correct
42 Correct 383 ms 61148 KB Output is correct
43 Correct 159 ms 37572 KB Output is correct
44 Correct 289 ms 43336 KB Output is correct
45 Correct 245 ms 47536 KB Output is correct
46 Correct 207 ms 48036 KB Output is correct
47 Correct 247 ms 49908 KB Output is correct
48 Correct 872 ms 84632 KB Output is correct