Submission #372224

# Submission time Handle Problem Language Result Execution time Memory
372224 2021-02-27T09:43:48 Z dolphingarlic Robot (JOI21_ho_t4) C++14
100 / 100
1290 ms 79340 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 11 ms 15212 KB Output is correct
2 Correct 10 ms 15212 KB Output is correct
3 Correct 12 ms 15212 KB Output is correct
4 Correct 13 ms 15212 KB Output is correct
5 Correct 14 ms 15212 KB Output is correct
6 Correct 11 ms 15212 KB Output is correct
7 Correct 12 ms 15340 KB Output is correct
8 Correct 11 ms 15212 KB Output is correct
9 Correct 15 ms 15852 KB Output is correct
10 Correct 13 ms 15724 KB Output is correct
11 Correct 13 ms 15596 KB Output is correct
12 Correct 13 ms 15596 KB Output is correct
13 Correct 13 ms 15724 KB Output is correct
14 Correct 12 ms 15596 KB Output is correct
15 Correct 11 ms 15468 KB Output is correct
16 Correct 14 ms 15468 KB Output is correct
17 Correct 12 ms 15596 KB Output is correct
18 Correct 11 ms 15340 KB Output is correct
19 Correct 12 ms 15468 KB Output is correct
20 Correct 13 ms 15468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 250 ms 33732 KB Output is correct
2 Correct 93 ms 24676 KB Output is correct
3 Correct 263 ms 30072 KB Output is correct
4 Correct 159 ms 27488 KB Output is correct
5 Correct 1168 ms 78928 KB Output is correct
6 Correct 846 ms 68352 KB Output is correct
7 Correct 406 ms 52424 KB Output is correct
8 Correct 475 ms 46832 KB Output is correct
9 Correct 513 ms 46976 KB Output is correct
10 Correct 432 ms 45920 KB Output is correct
11 Correct 151 ms 30956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 15212 KB Output is correct
2 Correct 10 ms 15212 KB Output is correct
3 Correct 12 ms 15212 KB Output is correct
4 Correct 13 ms 15212 KB Output is correct
5 Correct 14 ms 15212 KB Output is correct
6 Correct 11 ms 15212 KB Output is correct
7 Correct 12 ms 15340 KB Output is correct
8 Correct 11 ms 15212 KB Output is correct
9 Correct 15 ms 15852 KB Output is correct
10 Correct 13 ms 15724 KB Output is correct
11 Correct 13 ms 15596 KB Output is correct
12 Correct 13 ms 15596 KB Output is correct
13 Correct 13 ms 15724 KB Output is correct
14 Correct 12 ms 15596 KB Output is correct
15 Correct 11 ms 15468 KB Output is correct
16 Correct 14 ms 15468 KB Output is correct
17 Correct 12 ms 15596 KB Output is correct
18 Correct 11 ms 15340 KB Output is correct
19 Correct 12 ms 15468 KB Output is correct
20 Correct 13 ms 15468 KB Output is correct
21 Correct 250 ms 33732 KB Output is correct
22 Correct 93 ms 24676 KB Output is correct
23 Correct 263 ms 30072 KB Output is correct
24 Correct 159 ms 27488 KB Output is correct
25 Correct 1168 ms 78928 KB Output is correct
26 Correct 846 ms 68352 KB Output is correct
27 Correct 406 ms 52424 KB Output is correct
28 Correct 475 ms 46832 KB Output is correct
29 Correct 513 ms 46976 KB Output is correct
30 Correct 432 ms 45920 KB Output is correct
31 Correct 151 ms 30956 KB Output is correct
32 Correct 158 ms 25584 KB Output is correct
33 Correct 190 ms 26976 KB Output is correct
34 Correct 509 ms 46912 KB Output is correct
35 Correct 418 ms 38876 KB Output is correct
36 Correct 375 ms 44116 KB Output is correct
37 Correct 432 ms 46036 KB Output is correct
38 Correct 404 ms 52048 KB Output is correct
39 Correct 240 ms 27900 KB Output is correct
40 Correct 506 ms 46956 KB Output is correct
41 Correct 516 ms 47084 KB Output is correct
42 Correct 563 ms 56160 KB Output is correct
43 Correct 271 ms 35132 KB Output is correct
44 Correct 593 ms 38496 KB Output is correct
45 Correct 407 ms 43628 KB Output is correct
46 Correct 320 ms 44268 KB Output is correct
47 Correct 394 ms 45772 KB Output is correct
48 Correct 1290 ms 79340 KB Output is correct