Submission #953549

# Submission time Handle Problem Language Result Execution time Memory
953549 2024-03-26T07:06:12 Z Trisanu_Das Robot (JOI21_ho_t4) C++17
100 / 100
859 ms 84372 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]) {
				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) {
					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});
					}
					ll case2 = j.p - cost;
					if (case2 < dp[j.to]) {
						dp[j.to] = case2;
						pq.push({-dp[j.to], j.to, 0});
					}
					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 5 ms 15192 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 4 ms 15296 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 9 ms 15196 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 7 ms 15972 KB Output is correct
10 Correct 6 ms 15708 KB Output is correct
11 Correct 5 ms 15704 KB Output is correct
12 Correct 4 ms 15628 KB Output is correct
13 Correct 4 ms 15632 KB Output is correct
14 Correct 5 ms 15452 KB Output is correct
15 Correct 5 ms 15452 KB Output is correct
16 Correct 5 ms 15652 KB Output is correct
17 Correct 5 ms 15452 KB Output is correct
18 Correct 5 ms 15452 KB Output is correct
19 Correct 5 ms 15376 KB Output is correct
20 Correct 4 ms 15448 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 169 ms 33728 KB Output is correct
2 Correct 68 ms 24672 KB Output is correct
3 Correct 141 ms 29812 KB Output is correct
4 Correct 98 ms 27540 KB Output is correct
5 Correct 815 ms 78924 KB Output is correct
6 Correct 612 ms 72120 KB Output is correct
7 Correct 282 ms 57416 KB Output is correct
8 Correct 300 ms 51036 KB Output is correct
9 Correct 331 ms 51268 KB Output is correct
10 Correct 251 ms 48228 KB Output is correct
11 Correct 89 ms 32836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 15192 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 4 ms 15296 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 9 ms 15196 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 7 ms 15972 KB Output is correct
10 Correct 6 ms 15708 KB Output is correct
11 Correct 5 ms 15704 KB Output is correct
12 Correct 4 ms 15628 KB Output is correct
13 Correct 4 ms 15632 KB Output is correct
14 Correct 5 ms 15452 KB Output is correct
15 Correct 5 ms 15452 KB Output is correct
16 Correct 5 ms 15652 KB Output is correct
17 Correct 5 ms 15452 KB Output is correct
18 Correct 5 ms 15452 KB Output is correct
19 Correct 5 ms 15376 KB Output is correct
20 Correct 4 ms 15448 KB Output is correct
21 Correct 169 ms 33728 KB Output is correct
22 Correct 68 ms 24672 KB Output is correct
23 Correct 141 ms 29812 KB Output is correct
24 Correct 98 ms 27540 KB Output is correct
25 Correct 815 ms 78924 KB Output is correct
26 Correct 612 ms 72120 KB Output is correct
27 Correct 282 ms 57416 KB Output is correct
28 Correct 300 ms 51036 KB Output is correct
29 Correct 331 ms 51268 KB Output is correct
30 Correct 251 ms 48228 KB Output is correct
31 Correct 89 ms 32836 KB Output is correct
32 Correct 81 ms 29136 KB Output is correct
33 Correct 92 ms 29872 KB Output is correct
34 Correct 360 ms 50592 KB Output is correct
35 Correct 265 ms 41780 KB Output is correct
36 Correct 271 ms 46952 KB Output is correct
37 Correct 314 ms 49700 KB Output is correct
38 Correct 268 ms 57492 KB Output is correct
39 Correct 87 ms 32668 KB Output is correct
40 Correct 367 ms 52336 KB Output is correct
41 Correct 328 ms 52556 KB Output is correct
42 Correct 389 ms 60768 KB Output is correct
43 Correct 135 ms 37576 KB Output is correct
44 Correct 288 ms 43464 KB Output is correct
45 Correct 254 ms 47504 KB Output is correct
46 Correct 198 ms 47952 KB Output is correct
47 Correct 262 ms 49728 KB Output is correct
48 Correct 859 ms 84372 KB Output is correct