Submission #490135

# Submission time Handle Problem Language Result Execution time Memory
490135 2021-11-25T20:53:41 Z rainliofficial Robot (JOI21_ho_t4) C++17
100 / 100
860 ms 84296 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;
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 15068 KB Output is correct
2 Correct 7 ms 15180 KB Output is correct
3 Correct 8 ms 15180 KB Output is correct
4 Correct 7 ms 15180 KB Output is correct
5 Correct 7 ms 15216 KB Output is correct
6 Correct 7 ms 15180 KB Output is correct
7 Correct 8 ms 15268 KB Output is correct
8 Correct 7 ms 15180 KB Output is correct
9 Correct 10 ms 15736 KB Output is correct
10 Correct 10 ms 15692 KB Output is correct
11 Correct 11 ms 15436 KB Output is correct
12 Correct 13 ms 15464 KB Output is correct
13 Correct 9 ms 15436 KB Output is correct
14 Correct 10 ms 15540 KB Output is correct
15 Correct 8 ms 15436 KB Output is correct
16 Correct 9 ms 15512 KB Output is correct
17 Correct 9 ms 15436 KB Output is correct
18 Correct 8 ms 15244 KB Output is correct
19 Correct 9 ms 15380 KB Output is correct
20 Correct 10 ms 15436 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 167 ms 33620 KB Output is correct
2 Correct 73 ms 24600 KB Output is correct
3 Correct 180 ms 29788 KB Output is correct
4 Correct 104 ms 27312 KB Output is correct
5 Correct 860 ms 78828 KB Output is correct
6 Correct 614 ms 68128 KB Output is correct
7 Correct 297 ms 52292 KB Output is correct
8 Correct 367 ms 46756 KB Output is correct
9 Correct 390 ms 46916 KB Output is correct
10 Correct 282 ms 45820 KB Output is correct
11 Correct 117 ms 30952 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 15068 KB Output is correct
2 Correct 7 ms 15180 KB Output is correct
3 Correct 8 ms 15180 KB Output is correct
4 Correct 7 ms 15180 KB Output is correct
5 Correct 7 ms 15216 KB Output is correct
6 Correct 7 ms 15180 KB Output is correct
7 Correct 8 ms 15268 KB Output is correct
8 Correct 7 ms 15180 KB Output is correct
9 Correct 10 ms 15736 KB Output is correct
10 Correct 10 ms 15692 KB Output is correct
11 Correct 11 ms 15436 KB Output is correct
12 Correct 13 ms 15464 KB Output is correct
13 Correct 9 ms 15436 KB Output is correct
14 Correct 10 ms 15540 KB Output is correct
15 Correct 8 ms 15436 KB Output is correct
16 Correct 9 ms 15512 KB Output is correct
17 Correct 9 ms 15436 KB Output is correct
18 Correct 8 ms 15244 KB Output is correct
19 Correct 9 ms 15380 KB Output is correct
20 Correct 10 ms 15436 KB Output is correct
21 Correct 167 ms 33620 KB Output is correct
22 Correct 73 ms 24600 KB Output is correct
23 Correct 180 ms 29788 KB Output is correct
24 Correct 104 ms 27312 KB Output is correct
25 Correct 860 ms 78828 KB Output is correct
26 Correct 614 ms 68128 KB Output is correct
27 Correct 297 ms 52292 KB Output is correct
28 Correct 367 ms 46756 KB Output is correct
29 Correct 390 ms 46916 KB Output is correct
30 Correct 282 ms 45820 KB Output is correct
31 Correct 117 ms 30952 KB Output is correct
32 Correct 112 ms 25396 KB Output is correct
33 Correct 126 ms 26872 KB Output is correct
34 Correct 357 ms 46856 KB Output is correct
35 Correct 271 ms 38768 KB Output is correct
36 Correct 269 ms 44064 KB Output is correct
37 Correct 327 ms 45976 KB Output is correct
38 Correct 294 ms 51964 KB Output is correct
39 Correct 116 ms 27764 KB Output is correct
40 Correct 389 ms 46812 KB Output is correct
41 Correct 416 ms 46880 KB Output is correct
42 Correct 442 ms 56188 KB Output is correct
43 Correct 187 ms 35016 KB Output is correct
44 Correct 356 ms 38508 KB Output is correct
45 Correct 287 ms 43484 KB Output is correct
46 Correct 242 ms 44088 KB Output is correct
47 Correct 285 ms 45668 KB Output is correct
48 Correct 860 ms 84296 KB Output is correct