oj.uz

Submission #988068

# Submission time Handle Problem Language Result Execution time Memory
988068 2024-05-24T02:56:13 Z michified Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 120724 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
struct state_t {
	ll id, inc;
	ll cost, inw;
};
 
struct edge_t {
	ll 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);
	ll 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<ll, 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) {
			cout << cur.cost;
			return 0;
		}
		if (cur.cost > best[cur.id][(cur.inc << 32) + cur.inw]) 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, 0});
					best[e.to][0] = tmp;
				}
				tmp = cur.cost + e.cost;
				if (best[e.to].find((e.col << 32) + e.cost) == best[e.to].end() or best[e.to][(e.col << 32) + e.cost] > tmp) {
					pq.push({e.to, e.col, tmp, e.cost});
					best[e.to][(e.col << 32) + e.cost] = tmp;
				}
			}
		} else {
			if (best[cur.id].find(0) == best[cur.id].end() or best[cur.id][0] > cur.cost) {
				pq.push({cur.id, 0, cur.cost, 0});
				best[cur.id][0] = cur.cost;
			}
			for (edge_t& e : c2e[cur.id][cur.inc]) {
				ll tmp = cur.cost + coltot[cur.id][e.col] - e.cost - cur.inw;
				if (best[e.to].find(0) == best[e.to].end() or best[e.to][0] > tmp) {
					pq.push({e.to, 0, tmp, 0});
					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 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Correct 3 ms 1460 KB Output is correct
14 Correct 3 ms 1368 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 5 ms 1116 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 2 ms 856 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 281 ms 37860 KB Output is correct
2 Correct 98 ms 19332 KB Output is correct
3 Correct 141 ms 33620 KB Output is correct
4 Correct 117 ms 26536 KB Output is correct
5 Correct 1485 ms 120724 KB Output is correct
6 Correct 1000 ms 112420 KB Output is correct
7 Correct 421 ms 94304 KB Output is correct
8 Correct 724 ms 93008 KB Output is correct
9 Correct 635 ms 93008 KB Output is correct
10 Correct 560 ms 61788 KB Output is correct
11 Correct 188 ms 52816 KB Output is correct

Subtask #3
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 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Correct 3 ms 1460 KB Output is correct
14 Correct 3 ms 1368 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 5 ms 1116 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 2 ms 856 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 281 ms 37860 KB Output is correct
22 Correct 98 ms 19332 KB Output is correct
23 Correct 141 ms 33620 KB Output is correct
24 Correct 117 ms 26536 KB Output is correct
25 Correct 1485 ms 120724 KB Output is correct
26 Correct 1000 ms 112420 KB Output is correct
27 Correct 421 ms 94304 KB Output is correct
28 Correct 724 ms 93008 KB Output is correct
29 Correct 635 ms 93008 KB Output is correct
30 Correct 560 ms 61788 KB Output is correct
31 Correct 188 ms 52816 KB Output is correct
32 Correct 330 ms 58800 KB Output is correct
33 Correct 306 ms 47340 KB Output is correct
34 Correct 468 ms 67248 KB Output is correct
35 Correct 376 ms 59324 KB Output is correct
36 Correct 461 ms 93724 KB Output is correct
37 Correct 766 ms 96188 KB Output is correct
38 Correct 531 ms 96008 KB Output is correct
39 Correct 984 ms 61864 KB Output is correct
40 Correct 1058 ms 113088 KB Output is correct
41 Correct 1151 ms 113220 KB Output is correct
42 Correct 1372 ms 106376 KB Output is correct
43 Correct 428 ms 42680 KB Output is correct
44 Correct 338 ms 50140 KB Output is correct
45 Correct 924 ms 97072 KB Output is correct
46 Correct 617 ms 88908 KB Output is correct
47 Execution timed out 3081 ms 81572 KB Time limit exceeded
48 Halted 0 ms 0 KB -