oj.uz

Submission #949384

# Submission time Handle Problem Language Result Execution time Memory
949384 2024-03-19T07:40:37 Z IBory Robot (JOI21_ho_t4) C++17
100 / 100
 533 ms 94508 KB 
#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const int MAX = 200007;
vector<pii> G[MAX];
map<int, vector<pii>> CS[MAX];
ll D[MAX], C[MAX], P[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, M;
	cin >> N >> M;
	for (int i = 1; i <= M; ++i) {
		int a, b;
		cin >> a >> b >> C[i] >> P[i];
		G[a].emplace_back(b, P[i]);
		G[b].emplace_back(a, P[i]);
		CS[a][C[i]].emplace_back(P[i], b);
		CS[b][C[i]].emplace_back(P[i], a);
	}

	for (int i = 1; i <= N; ++i) {
		for (auto& [c, v] : CS[i]) {
			sort(v.begin(), v.end(), greater<pii>());
			ll all = 0;
			for (auto [s, next] : v) all += s;
			for (auto [s, next] : v) G[i].emplace_back(next, all - s);
			for (int a = 0; a < v.size(); ++a) {
				for (int b = 0; b < min(3, (int)v.size()); ++b) {
					if (a == b) continue;
					// a 바꾸고, b를 complement로 이동
					G[v[a].second].emplace_back(v[b].second, v[a].first + (all - v[a].first - v[b].first));
				}
			}
		}
	}

	memset(D, 0x3f, sizeof(D));
	D[1] = 0;
	priority_queue<pii, vector<pii>, greater<pii>> PQ;
	PQ.emplace(D[1] = 0, 1);
	while (!PQ.empty()) {
		auto [cd, cur] = PQ.top(); PQ.pop();
		if (cd > D[cur]) continue;
		for (auto [next, nd] : G[cur]) {
			assert(nd >= 0);
			if (D[next] <= cd + nd) continue;
			PQ.emplace(D[next] = cd + nd, next);
		}
	}

	ll ans = (D[N] > 1E18 ? -1 : D[N]);
	cout << ans << '\n';
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:30:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |    for (int a = 0; a < v.size(); ++a) {
      |                    ~~^~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19032 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 5 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 5 ms 19036 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 5 ms 19284 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 6 ms 19548 KB Output is correct
10 Correct 6 ms 19792 KB Output is correct
11 Correct 5 ms 19600 KB Output is correct
12 Correct 6 ms 19548 KB Output is correct
13 Correct 5 ms 19548 KB Output is correct
14 Correct 6 ms 19548 KB Output is correct
15 Correct 5 ms 19292 KB Output is correct
16 Correct 8 ms 19804 KB Output is correct
17 Correct 6 ms 19548 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 6 ms 19548 KB Output is correct
20 Correct 5 ms 19548 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 46592 KB Output is correct
2 Correct 42 ms 31068 KB Output is correct
3 Correct 122 ms 67724 KB Output is correct
4 Correct 68 ms 37328 KB Output is correct
5 Correct 475 ms 89908 KB Output is correct
6 Correct 447 ms 88420 KB Output is correct
7 Correct 252 ms 85628 KB Output is correct
8 Correct 354 ms 91256 KB Output is correct
9 Correct 389 ms 91232 KB Output is correct
10 Correct 200 ms 60368 KB Output is correct
11 Correct 158 ms 51164 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19032 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 5 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 5 ms 19036 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 5 ms 19284 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 6 ms 19548 KB Output is correct
10 Correct 6 ms 19792 KB Output is correct
11 Correct 5 ms 19600 KB Output is correct
12 Correct 6 ms 19548 KB Output is correct
13 Correct 5 ms 19548 KB Output is correct
14 Correct 6 ms 19548 KB Output is correct
15 Correct 5 ms 19292 KB Output is correct
16 Correct 8 ms 19804 KB Output is correct
17 Correct 6 ms 19548 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 6 ms 19548 KB Output is correct
20 Correct 5 ms 19548 KB Output is correct
21 Correct 113 ms 46592 KB Output is correct
22 Correct 42 ms 31068 KB Output is correct
23 Correct 122 ms 67724 KB Output is correct
24 Correct 68 ms 37328 KB Output is correct
25 Correct 475 ms 89908 KB Output is correct
26 Correct 447 ms 88420 KB Output is correct
27 Correct 252 ms 85628 KB Output is correct
28 Correct 354 ms 91256 KB Output is correct
29 Correct 389 ms 91232 KB Output is correct
30 Correct 200 ms 60368 KB Output is correct
31 Correct 158 ms 51164 KB Output is correct
32 Correct 113 ms 72788 KB Output is correct
33 Correct 142 ms 61896 KB Output is correct
34 Correct 232 ms 69560 KB Output is correct
35 Correct 191 ms 61384 KB Output is correct
36 Correct 215 ms 60192 KB Output is correct
37 Correct 247 ms 71380 KB Output is correct
38 Correct 240 ms 86360 KB Output is correct
39 Correct 138 ms 86868 KB Output is correct
40 Correct 362 ms 93900 KB Output is correct
41 Correct 407 ms 94292 KB Output is correct
42 Correct 376 ms 81972 KB Output is correct
43 Correct 125 ms 53648 KB Output is correct
44 Correct 208 ms 87244 KB Output is correct
45 Correct 282 ms 71248 KB Output is correct
46 Correct 276 ms 69700 KB Output is correct
47 Correct 267 ms 67252 KB Output is correct
48 Correct 533 ms 94508 KB Output is correct