oj.uz

Submission #371330

# Submission time Handle Problem Language Result Execution time Memory
371330 2021-02-26T13:38:21 Z cheissmart Robot (JOI21_ho_t4) C++14
100 / 100
 984 ms 76380 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
// #define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << endl

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

void DBG() {
	cerr << "]" << endl;
}
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}

#define debug(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)

const int INF = 1e9 + 7, N = 1e5 + 7;

V<array<int, 3>> G[N]; // (to, color, cost)
unordered_map<int, V<array<int, 3>>> g[N]; // (to, color, cost)
unordered_map<int, ll> csum[N];
ll d[N];
unordered_map<int, ll> d2[N];

signed main()
{
	IO_OP;

	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int u, v, c, p;
		cin >> u >> v >> c >> p;
		G[u].PB({v, c, p});
		G[v].PB({u, c, p});
		g[u][c].PB({v, c, p});
		g[v][c].PB({u, c, p});
		csum[u][c] += p;
		csum[v][c] += p;
	}
	memset(d, 0x3f, sizeof d);
	d[1] = 0;
	priority_queue<pair<ll, pi>, V<pair<ll, pi>>, greater<pair<ll, pi>>> pq;
	pq.push(MP(d[1], MP(1, 0)));
	while(pq.size()) {
		auto p = pq.top(); pq.pop();
		int u = p.S.F, c = p.S.S;
		if(c) {
			if(p.F > d2[u][c]) continue;
			for(auto e:g[u][c]) {
				int v = e[0], ec = e[1], cost = e[2];
				if(d2[u][c] + csum[u][ec] - cost < d[v]) {
					d[v] = d2[u][c] + csum[u][ec] - cost;
					pq.push(MP(d[v], MP(v, 0)));
				}
			}
		} else {
			if(p.F > d[u]) continue;
			for(auto e:G[u]) {
				int v = e[0], ec = e[1], cost = e[2];
				if(d[u] + csum[u][ec] - cost < d[v]) {
					d[v] = d[u] + csum[u][ec] - cost;
					pq.push(MP(d[v], MP(v, 0)));
				}
				if(d2[v].count(ec) == 0 || d[u] < d2[v][ec]) {
					d2[v][ec] = d[u];
					pq.push(MP(d2[v][ec], MP(v, ec)));
				}
				if(d[u] + cost < d[v]) {
					d[v] = d[u] + cost;
					pq.push(MP(d[v], MP(v, 0)));
				}
			}
		}
	}

	ll ans = d[n];
	if(ans > 1e17) ans = -1;
	cout << ans << '\n';

}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19948 KB Output is correct
2 Correct 17 ms 19948 KB Output is correct
3 Correct 17 ms 19948 KB Output is correct
4 Correct 16 ms 19948 KB Output is correct
5 Correct 16 ms 20096 KB Output is correct
6 Correct 14 ms 19948 KB Output is correct
7 Correct 15 ms 20076 KB Output is correct
8 Correct 17 ms 19948 KB Output is correct
9 Correct 17 ms 20460 KB Output is correct
10 Correct 18 ms 20460 KB Output is correct
11 Correct 17 ms 20332 KB Output is correct
12 Correct 15 ms 20204 KB Output is correct
13 Correct 19 ms 20272 KB Output is correct
14 Correct 17 ms 20332 KB Output is correct
15 Correct 15 ms 20204 KB Output is correct
16 Correct 16 ms 20332 KB Output is correct
17 Correct 17 ms 20204 KB Output is correct
18 Correct 14 ms 20076 KB Output is correct
19 Correct 17 ms 20204 KB Output is correct
20 Correct 16 ms 20332 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 37096 KB Output is correct
2 Correct 140 ms 28752 KB Output is correct
3 Correct 414 ms 35844 KB Output is correct
4 Correct 228 ms 31520 KB Output is correct
5 Correct 955 ms 76148 KB Output is correct
6 Correct 940 ms 70032 KB Output is correct
7 Correct 504 ms 58616 KB Output is correct
8 Correct 685 ms 55152 KB Output is correct
9 Correct 717 ms 55088 KB Output is correct
10 Correct 516 ms 48544 KB Output is correct
11 Correct 240 ms 37996 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19948 KB Output is correct
2 Correct 17 ms 19948 KB Output is correct
3 Correct 17 ms 19948 KB Output is correct
4 Correct 16 ms 19948 KB Output is correct
5 Correct 16 ms 20096 KB Output is correct
6 Correct 14 ms 19948 KB Output is correct
7 Correct 15 ms 20076 KB Output is correct
8 Correct 17 ms 19948 KB Output is correct
9 Correct 17 ms 20460 KB Output is correct
10 Correct 18 ms 20460 KB Output is correct
11 Correct 17 ms 20332 KB Output is correct
12 Correct 15 ms 20204 KB Output is correct
13 Correct 19 ms 20272 KB Output is correct
14 Correct 17 ms 20332 KB Output is correct
15 Correct 15 ms 20204 KB Output is correct
16 Correct 16 ms 20332 KB Output is correct
17 Correct 17 ms 20204 KB Output is correct
18 Correct 14 ms 20076 KB Output is correct
19 Correct 17 ms 20204 KB Output is correct
20 Correct 16 ms 20332 KB Output is correct
21 Correct 381 ms 37096 KB Output is correct
22 Correct 140 ms 28752 KB Output is correct
23 Correct 414 ms 35844 KB Output is correct
24 Correct 228 ms 31520 KB Output is correct
25 Correct 955 ms 76148 KB Output is correct
26 Correct 940 ms 70032 KB Output is correct
27 Correct 504 ms 58616 KB Output is correct
28 Correct 685 ms 55152 KB Output is correct
29 Correct 717 ms 55088 KB Output is correct
30 Correct 516 ms 48544 KB Output is correct
31 Correct 240 ms 37996 KB Output is correct
32 Correct 238 ms 33000 KB Output is correct
33 Correct 309 ms 34408 KB Output is correct
34 Correct 650 ms 49636 KB Output is correct
35 Correct 535 ms 42592 KB Output is correct
36 Correct 497 ms 49428 KB Output is correct
37 Correct 577 ms 52180 KB Output is correct
38 Correct 526 ms 58360 KB Output is correct
39 Correct 295 ms 37092 KB Output is correct
40 Correct 686 ms 55148 KB Output is correct
41 Correct 754 ms 55148 KB Output is correct
42 Correct 795 ms 59228 KB Output is correct
43 Correct 332 ms 38068 KB Output is correct
44 Correct 753 ms 44516 KB Output is correct
45 Correct 550 ms 51764 KB Output is correct
46 Correct 498 ms 50648 KB Output is correct
47 Correct 516 ms 51332 KB Output is correct
48 Correct 984 ms 76380 KB Output is correct