oj.uz

Submission #650161

# Submission time Handle Problem Language Result Execution time Memory
650161 2022-10-12T16:10:45 Z HaYoungJoon Robot (JOI21_ho_t4) C++14
100 / 100
 904 ms 82824 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 15188 KB Output is correct
2 Correct 9 ms 15136 KB Output is correct
3 Correct 8 ms 15192 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 8 ms 15188 KB Output is correct
6 Correct 8 ms 15188 KB Output is correct
7 Correct 10 ms 15364 KB Output is correct
8 Correct 9 ms 15188 KB Output is correct
9 Correct 12 ms 15748 KB Output is correct
10 Correct 13 ms 15700 KB Output is correct
11 Correct 10 ms 15444 KB Output is correct
12 Correct 11 ms 15508 KB Output is correct
13 Correct 9 ms 15572 KB Output is correct
14 Correct 10 ms 15572 KB Output is correct
15 Correct 8 ms 15444 KB Output is correct
16 Correct 9 ms 15444 KB Output is correct
17 Correct 9 ms 15572 KB Output is correct
18 Correct 9 ms 15260 KB Output is correct
19 Correct 10 ms 15432 KB Output is correct
20 Correct 10 ms 15444 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 33544 KB Output is correct
2 Correct 86 ms 24696 KB Output is correct
3 Correct 176 ms 29672 KB Output is correct
4 Correct 140 ms 27372 KB Output is correct
5 Correct 871 ms 78800 KB Output is correct
6 Correct 717 ms 71912 KB Output is correct
7 Correct 339 ms 56236 KB Output is correct
8 Correct 378 ms 50884 KB Output is correct
9 Correct 452 ms 51020 KB Output is correct
10 Correct 290 ms 48164 KB Output is correct
11 Correct 125 ms 32804 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 9 ms 15136 KB Output is correct
3 Correct 8 ms 15192 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 8 ms 15188 KB Output is correct
6 Correct 8 ms 15188 KB Output is correct
7 Correct 10 ms 15364 KB Output is correct
8 Correct 9 ms 15188 KB Output is correct
9 Correct 12 ms 15748 KB Output is correct
10 Correct 13 ms 15700 KB Output is correct
11 Correct 10 ms 15444 KB Output is correct
12 Correct 11 ms 15508 KB Output is correct
13 Correct 9 ms 15572 KB Output is correct
14 Correct 10 ms 15572 KB Output is correct
15 Correct 8 ms 15444 KB Output is correct
16 Correct 9 ms 15444 KB Output is correct
17 Correct 9 ms 15572 KB Output is correct
18 Correct 9 ms 15260 KB Output is correct
19 Correct 10 ms 15432 KB Output is correct
20 Correct 10 ms 15444 KB Output is correct
21 Correct 199 ms 33544 KB Output is correct
22 Correct 86 ms 24696 KB Output is correct
23 Correct 176 ms 29672 KB Output is correct
24 Correct 140 ms 27372 KB Output is correct
25 Correct 871 ms 78800 KB Output is correct
26 Correct 717 ms 71912 KB Output is correct
27 Correct 339 ms 56236 KB Output is correct
28 Correct 378 ms 50884 KB Output is correct
29 Correct 452 ms 51020 KB Output is correct
30 Correct 290 ms 48164 KB Output is correct
31 Correct 125 ms 32804 KB Output is correct
32 Correct 150 ms 29076 KB Output is correct
33 Correct 144 ms 29860 KB Output is correct
34 Correct 382 ms 50432 KB Output is correct
35 Correct 311 ms 41784 KB Output is correct
36 Correct 279 ms 46896 KB Output is correct
37 Correct 393 ms 49312 KB Output is correct
38 Correct 302 ms 55620 KB Output is correct
39 Correct 133 ms 31544 KB Output is correct
40 Correct 422 ms 50408 KB Output is correct
41 Correct 424 ms 50604 KB Output is correct
42 Correct 466 ms 59704 KB Output is correct
43 Correct 208 ms 37520 KB Output is correct
44 Correct 416 ms 42096 KB Output is correct
45 Correct 309 ms 47192 KB Output is correct
46 Correct 254 ms 47832 KB Output is correct
47 Correct 316 ms 49108 KB Output is correct
48 Correct 904 ms 82824 KB Output is correct