oj.uz

Submission #937748

# Submission time Handle Problem Language Result Execution time Memory
937748 2024-03-04T12:34:39 Z MMihalev Robot (JOI21_ho_t4) C++17
100 / 100
 876 ms 84520 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 4 ms 15192 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 4 ms 15192 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 4 ms 15196 KB Output is correct
7 Correct 4 ms 15448 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 7 ms 15840 KB Output is correct
10 Correct 6 ms 15708 KB Output is correct
11 Correct 5 ms 15708 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15708 KB Output is correct
14 Correct 6 ms 15708 KB Output is correct
15 Correct 6 ms 15704 KB Output is correct
16 Correct 5 ms 15448 KB Output is correct
17 Correct 5 ms 15708 KB Output is correct
18 Correct 4 ms 15448 KB Output is correct
19 Correct 5 ms 15452 KB Output is correct
20 Correct 5 ms 15452 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 35072 KB Output is correct
2 Correct 59 ms 25448 KB Output is correct
3 Correct 139 ms 32152 KB Output is correct
4 Correct 87 ms 28328 KB Output is correct
5 Correct 876 ms 82588 KB Output is correct
6 Correct 591 ms 72100 KB Output is correct
7 Correct 291 ms 57476 KB Output is correct
8 Correct 312 ms 50912 KB Output is correct
9 Correct 354 ms 51044 KB Output is correct
10 Correct 281 ms 48248 KB Output is correct
11 Correct 82 ms 32848 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15192 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 4 ms 15192 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 4 ms 15196 KB Output is correct
7 Correct 4 ms 15448 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 7 ms 15840 KB Output is correct
10 Correct 6 ms 15708 KB Output is correct
11 Correct 5 ms 15708 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15708 KB Output is correct
14 Correct 6 ms 15708 KB Output is correct
15 Correct 6 ms 15704 KB Output is correct
16 Correct 5 ms 15448 KB Output is correct
17 Correct 5 ms 15708 KB Output is correct
18 Correct 4 ms 15448 KB Output is correct
19 Correct 5 ms 15452 KB Output is correct
20 Correct 5 ms 15452 KB Output is correct
21 Correct 147 ms 35072 KB Output is correct
22 Correct 59 ms 25448 KB Output is correct
23 Correct 139 ms 32152 KB Output is correct
24 Correct 87 ms 28328 KB Output is correct
25 Correct 876 ms 82588 KB Output is correct
26 Correct 591 ms 72100 KB Output is correct
27 Correct 291 ms 57476 KB Output is correct
28 Correct 312 ms 50912 KB Output is correct
29 Correct 354 ms 51044 KB Output is correct
30 Correct 281 ms 48248 KB Output is correct
31 Correct 82 ms 32848 KB Output is correct
32 Correct 85 ms 29140 KB Output is correct
33 Correct 93 ms 29844 KB Output is correct
34 Correct 295 ms 50680 KB Output is correct
35 Correct 217 ms 42136 KB Output is correct
36 Correct 252 ms 46968 KB Output is correct
37 Correct 302 ms 50944 KB Output is correct
38 Correct 261 ms 57684 KB Output is correct
39 Correct 92 ms 32592 KB Output is correct
40 Correct 331 ms 52220 KB Output is correct
41 Correct 366 ms 52580 KB Output is correct
42 Correct 396 ms 61064 KB Output is correct
43 Correct 153 ms 37420 KB Output is correct
44 Correct 280 ms 43560 KB Output is correct
45 Correct 254 ms 47696 KB Output is correct
46 Correct 225 ms 47900 KB Output is correct
47 Correct 275 ms 50584 KB Output is correct
48 Correct 851 ms 84520 KB Output is correct