oj.uz

Submission #988079

# Submission time Handle Problem Language Result Execution time Memory
988079 2024-05-24T04:13:03 Z michified Robot (JOI21_ho_t4) C++17
100 / 100
 1436 ms 112004 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
struct state_t {
	int id, inc;
	ll cost;
};
 
struct edge_t {
	int to, col;
	ll cost;
};
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
 
	auto cmp = [](const state_t& a, const state_t& b){return a.cost > b.cost;};
	priority_queue<state_t, vector<state_t>, decltype(cmp)> pq(cmp);
	int n, m, i, tu, tv, tw, tc;
	cin >> n >> m;
	vector<vector<edge_t>> adj(n + 1);
	vector<unordered_map<int, ll>> coltot(n + 1);
	vector<unordered_map<int, vector<edge_t>>> c2e(n + 1);
	for (i = 0; i < m; i++) {
		cin >> tu >> tv >> tc >> tw;
		adj[tu].push_back({tv, tc, tw});
		adj[tv].push_back({tu, tc, tw});
		coltot[tu][tc] += tw;
		coltot[tv][tc] += tw;
		c2e[tu][tc].push_back({tv, tc, tw});
		c2e[tv][tc].push_back({tu, tc, tw});
	}
	vector<map<int, ll>> best(n + 1);
	pq.push({1, 0, 0});
	best[1][0] = 0;
	while (not pq.empty()) {
		state_t cur = pq.top();
		pq.pop();
		if (cur.id == n and cur.inc == 0) {
			cout << cur.cost;
			return 0;
		}
		if (cur.cost > best[cur.id][cur.inc]) continue;
		if (cur.inc == 0) {
			for (edge_t& e : adj[cur.id]) {
				ll tmp = cur.cost + coltot[cur.id][e.col] - e.cost;
				if (best[e.to].find(0) == best[e.to].end() or best[e.to][0] > tmp) {
					pq.push({e.to, 0, tmp});
					best[e.to][0] = tmp;
				}
				tmp = cur.cost;
				if (best[e.to].find(e.col) == best[e.to].end() or best[e.to][e.col] > tmp) {
					pq.push({e.to, e.col, tmp});
					best[e.to][e.col] = tmp;
				}
				tmp = cur.cost + e.cost;
				if (best[e.to].find(0) == best[e.to].end() or best[e.to][0] > tmp) {
					pq.push({e.to, 0, tmp});
					best[e.to][0] = tmp;
				}
			}
		} else {
			for (edge_t& e : c2e[cur.id][cur.inc]) {
				ll tmp = cur.cost + coltot[cur.id][e.col] - e.cost;
				if (best[e.to].find(0) == best[e.to].end() or best[e.to][0] > tmp) {
					pq.push({e.to, 0, tmp});
					best[e.to][0] = tmp;
				}
			}
		}
	}
	cout << -1;
	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 1524 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 29544 KB Output is correct
2 Correct 77 ms 16328 KB Output is correct
3 Correct 193 ms 25304 KB Output is correct
4 Correct 104 ms 22320 KB Output is correct
5 Correct 1187 ms 106592 KB Output is correct
6 Correct 1085 ms 97284 KB Output is correct
7 Correct 456 ms 85648 KB Output is correct
8 Correct 812 ms 81804 KB Output is correct
9 Correct 764 ms 81608 KB Output is correct
10 Correct 489 ms 52572 KB Output is correct
11 Correct 215 ms 47620 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 1524 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 266 ms 29544 KB Output is correct
22 Correct 77 ms 16328 KB Output is correct
23 Correct 193 ms 25304 KB Output is correct
24 Correct 104 ms 22320 KB Output is correct
25 Correct 1187 ms 106592 KB Output is correct
26 Correct 1085 ms 97284 KB Output is correct
27 Correct 456 ms 85648 KB Output is correct
28 Correct 812 ms 81804 KB Output is correct
29 Correct 764 ms 81608 KB Output is correct
30 Correct 489 ms 52572 KB Output is correct
31 Correct 215 ms 47620 KB Output is correct
32 Correct 108 ms 21344 KB Output is correct
33 Correct 173 ms 28876 KB Output is correct
34 Correct 390 ms 52932 KB Output is correct
35 Correct 379 ms 45856 KB Output is correct
36 Correct 543 ms 77612 KB Output is correct
37 Correct 685 ms 83336 KB Output is correct
38 Correct 496 ms 88824 KB Output is correct
39 Correct 140 ms 30152 KB Output is correct
40 Correct 844 ms 87160 KB Output is correct
41 Correct 841 ms 87204 KB Output is correct
42 Correct 794 ms 85328 KB Output is correct
43 Correct 234 ms 31764 KB Output is correct
44 Correct 301 ms 36852 KB Output is correct
45 Correct 574 ms 79820 KB Output is correct
46 Correct 589 ms 80240 KB Output is correct
47 Correct 540 ms 81928 KB Output is correct
48 Correct 1436 ms 112004 KB Output is correct