oj.uz

Submission #388317

# Submission time Handle Problem Language Result Execution time Memory
388317 2021-04-10T22:32:15 Z Kepha Robot (JOI21_ho_t4) C++11
100 / 100
 1103 ms 79140 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 8 ms 15180 KB Output is correct
2 Correct 9 ms 15180 KB Output is correct
3 Correct 8 ms 15144 KB Output is correct
4 Correct 8 ms 15192 KB Output is correct
5 Correct 9 ms 15228 KB Output is correct
6 Correct 9 ms 15180 KB Output is correct
7 Correct 10 ms 15308 KB Output is correct
8 Correct 9 ms 15180 KB Output is correct
9 Correct 12 ms 15820 KB Output is correct
10 Correct 12 ms 15668 KB Output is correct
11 Correct 10 ms 15544 KB Output is correct
12 Correct 12 ms 15436 KB Output is correct
13 Correct 11 ms 15440 KB Output is correct
14 Correct 10 ms 15436 KB Output is correct
15 Correct 9 ms 15436 KB Output is correct
16 Correct 11 ms 15436 KB Output is correct
17 Correct 10 ms 15436 KB Output is correct
18 Correct 9 ms 15308 KB Output is correct
19 Correct 10 ms 15308 KB Output is correct
20 Correct 11 ms 15436 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 33596 KB Output is correct
2 Correct 90 ms 24776 KB Output is correct
3 Correct 282 ms 29788 KB Output is correct
4 Correct 133 ms 27328 KB Output is correct
5 Correct 1051 ms 78920 KB Output is correct
6 Correct 784 ms 68224 KB Output is correct
7 Correct 409 ms 52244 KB Output is correct
8 Correct 453 ms 46816 KB Output is correct
9 Correct 484 ms 46788 KB Output is correct
10 Correct 362 ms 45824 KB Output is correct
11 Correct 148 ms 30924 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15180 KB Output is correct
2 Correct 9 ms 15180 KB Output is correct
3 Correct 8 ms 15144 KB Output is correct
4 Correct 8 ms 15192 KB Output is correct
5 Correct 9 ms 15228 KB Output is correct
6 Correct 9 ms 15180 KB Output is correct
7 Correct 10 ms 15308 KB Output is correct
8 Correct 9 ms 15180 KB Output is correct
9 Correct 12 ms 15820 KB Output is correct
10 Correct 12 ms 15668 KB Output is correct
11 Correct 10 ms 15544 KB Output is correct
12 Correct 12 ms 15436 KB Output is correct
13 Correct 11 ms 15440 KB Output is correct
14 Correct 10 ms 15436 KB Output is correct
15 Correct 9 ms 15436 KB Output is correct
16 Correct 11 ms 15436 KB Output is correct
17 Correct 10 ms 15436 KB Output is correct
18 Correct 9 ms 15308 KB Output is correct
19 Correct 10 ms 15308 KB Output is correct
20 Correct 11 ms 15436 KB Output is correct
21 Correct 212 ms 33596 KB Output is correct
22 Correct 90 ms 24776 KB Output is correct
23 Correct 282 ms 29788 KB Output is correct
24 Correct 133 ms 27328 KB Output is correct
25 Correct 1051 ms 78920 KB Output is correct
26 Correct 784 ms 68224 KB Output is correct
27 Correct 409 ms 52244 KB Output is correct
28 Correct 453 ms 46816 KB Output is correct
29 Correct 484 ms 46788 KB Output is correct
30 Correct 362 ms 45824 KB Output is correct
31 Correct 148 ms 30924 KB Output is correct
32 Correct 146 ms 25416 KB Output is correct
33 Correct 175 ms 26880 KB Output is correct
34 Correct 456 ms 46776 KB Output is correct
35 Correct 330 ms 38696 KB Output is correct
36 Correct 348 ms 44036 KB Output is correct
37 Correct 411 ms 45920 KB Output is correct
38 Correct 384 ms 51864 KB Output is correct
39 Correct 163 ms 27792 KB Output is correct
40 Correct 477 ms 46912 KB Output is correct
41 Correct 497 ms 46848 KB Output is correct
42 Correct 552 ms 55980 KB Output is correct
43 Correct 248 ms 35064 KB Output is correct
44 Correct 467 ms 38516 KB Output is correct
45 Correct 369 ms 43520 KB Output is correct
46 Correct 308 ms 44192 KB Output is correct
47 Correct 370 ms 45680 KB Output is correct
48 Correct 1103 ms 79140 KB Output is correct