oj.uz

Submission #916320

# Submission time Handle Problem Language Result Execution time Memory
916320 2024-01-25T16:22:11 Z EJIC_B_KEDAX Robot (JOI21_ho_t4) C++17
100 / 100
 388 ms 45648 KB 
#include <bits/stdc++.h>

#define x first
#define y second

using ll = long long;

using namespace std;

struct triple {
	int x, y;
	ll z;
};

struct four {
	int x, y;
	ll z, t;
};

int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<four>> g(n);
	vector<vector<triple>> g1(n);
	for (int i = 0; i < m; i++) {
		int u, v, c;
		ll p;
		cin >> u >> v >> c >> p; u--; v--; c--;
		g1[u].push_back({v, c, p});
		g1[v].push_back({u, c, p});
	}
	vector<int> cnt(m, 0);
	vector<ll> sum(m, 0);
	for (int i = 0; i < n; i++) {
		for (auto [u, c, p] : g1[i]) {
			cnt[c]++;
			sum[c] += p;
		}
		for (auto [u, c, p] : g1[i]) {
			if (cnt[c] > 1) {
				g[i].push_back({u, c, p, sum[c] - p});
			} else {
				g[i].push_back({u, c, p, 0});
			}
		}
		for (auto [u, c, p] : g1[i]) {
			cnt[c]--;
			sum[c] -= p;
		}
	}
	set<pair<ll, int>> st;
	vector<ll> dist(n, INT64_MAX / 2), dist2(m, INT64_MAX / 2);
	vector<int> used(n, 0);
	dist[0] = 0;
	for (int i = 0; i < n; i++) {
		st.emplace(dist[i], i);
	}
	while (!st.empty()) {
		auto [d, s] = *st.begin();
		st.erase(st.begin());
		for (auto [i, c, p, w] : g[s]) {
			if (used[i]) {
				dist2[c] = min(dist[i], dist2[c]);
			}
		}
		used[s] = 1;
		for (auto [i, c, p, w] : g[s]) {
			if (!used[i]) {
				st.erase({dist[i], i});
				dist[i] = min(dist[i], min({d + w, dist2[c] + w, d + p}));
				st.emplace(dist[i], i);
			}
		}
		for (auto [i, c, p, w] : g[s]) {
			if (used[i]) {
				dist2[c] = INT64_MAX / 2;
			}
		}
	}
	if (dist[n - 1] == INT64_MAX / 2) {
		cout << "-1\n";
	} else {
		cout << dist[n - 1] << "\n";
	}
}

Subtask #1
34.0 / 34.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 14164 KB Output is correct
2 Correct 47 ms 6992 KB Output is correct
3 Correct 165 ms 20392 KB Output is correct
4 Correct 74 ms 10516 KB Output is correct
5 Correct 271 ms 35640 KB Output is correct
6 Correct 306 ms 40740 KB Output is correct
7 Correct 289 ms 40112 KB Output is correct
8 Correct 340 ms 43860 KB Output is correct
9 Correct 337 ms 43856 KB Output is correct
10 Correct 183 ms 25376 KB Output is correct
11 Correct 156 ms 25344 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 808 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 2 ms 704 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 108 ms 14164 KB Output is correct
22 Correct 47 ms 6992 KB Output is correct
23 Correct 165 ms 20392 KB Output is correct
24 Correct 74 ms 10516 KB Output is correct
25 Correct 271 ms 35640 KB Output is correct
26 Correct 306 ms 40740 KB Output is correct
27 Correct 289 ms 40112 KB Output is correct
28 Correct 340 ms 43860 KB Output is correct
29 Correct 337 ms 43856 KB Output is correct
30 Correct 183 ms 25376 KB Output is correct
31 Correct 156 ms 25344 KB Output is correct
32 Correct 170 ms 22608 KB Output is correct
33 Correct 188 ms 20732 KB Output is correct
34 Correct 228 ms 27748 KB Output is correct
35 Correct 193 ms 23892 KB Output is correct
36 Correct 225 ms 31040 KB Output is correct
37 Correct 264 ms 36640 KB Output is correct
38 Correct 276 ms 39340 KB Output is correct
39 Correct 223 ms 30940 KB Output is correct
40 Correct 352 ms 45136 KB Output is correct
41 Correct 388 ms 45648 KB Output is correct
42 Correct 362 ms 40020 KB Output is correct
43 Correct 141 ms 18260 KB Output is correct
44 Correct 254 ms 34644 KB Output is correct
45 Correct 278 ms 36692 KB Output is correct
46 Correct 292 ms 35648 KB Output is correct
47 Correct 266 ms 34224 KB Output is correct
48 Correct 332 ms 40996 KB Output is correct