oj.uz

답안 #684855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684855 2023-01-22T17:04:43 Z NK_ Robot (JOI21_ho_t4) C++17
100 / 100
 540 ms 51284 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define mp make_pair
#define f first
#define s second

using pi = pair<int, int>;
using ll = long long;

using T = array<ll, 3>;

const ll INFL = ll(1e18) + 1008;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, M; cin >> N >> M;

	vector<int> C(M), U(M), V(M); vector<ll> P(M);
	vector<vector<vector<pi>>> adj(N);
	vector<vector<int>> co(N, {-1});

	for(int i = 0; i < M; i++) {
		cin >> U[i] >> V[i] >> C[i] >> P[i]; --U[i], --V[i], --C[i];
		co[U[i]].push_back(C[i]);
		co[V[i]].push_back(C[i]);
	}

	vector<vector<ll>> dst(N);
	vector<vector<bool>> vis(N);
	for(int u = 0; u < N; u++) {
		sort(begin(co[u]), end(co[u]));
		co[u].erase(unique(begin(co[u]), end(co[u])), end(co[u]));
		dst[u].assign(size(co[u]) + 1, INFL);
		vis[u].assign(size(co[u]) + 1, 0);
		adj[u].assign(size(co[u]) + 1, {});
	}

	auto get = [&](int x, int c) { return lower_bound(begin(co[x]), end(co[x]), c) - begin(co[x]); };

	for(int i = 0; i < M; i++) {
		adj[U[i]][get(U[i], C[i])].push_back(mp(V[i], i));
		adj[V[i]][get(V[i], C[i])].push_back(mp(U[i], i));
	}


	priority_queue<T, vector<T>, greater<T>> q; 
	q.push({dst[0][0] = 0, 0, -1});


	while(size(q) > 0) {
		auto [d, u, c] = q.top(); q.pop();

		int CO = (c == -1 ? 0 : get(u, c));
		if (vis[u][CO]) continue;
		vis[u][CO] = 1;

		if (CO == 0) {
			for(int x = 1; x < int(size(co[u])); x++) {
				ll S = 0;
				for(auto e : adj[u][x]) S += P[e.s];
				
				for(auto e : adj[u][x]) {
					int v, i; tie(v, i) = e;
					int cv = get(v, co[u][x]);
					ll w = min(S - P[i], P[i]);

					if (dst[v][cv] > dst[u][CO]) q.push({dst[v][cv] = dst[u][CO], v, co[u][x]});
					if (dst[v][0] > (dst[u][CO]+w)) q.push({dst[v][0] = (dst[u][CO]+w), v, -1});
				} 
			}
		} else {

			ll S = 0;
			for(auto e : adj[u][CO]) S += P[e.s];

			for(auto e : adj[u][CO]) {
				int v, i; tie(v, i) = e;
				ll w = S - P[i];

				if (dst[v][0] > (dst[u][CO]+w)) q.push({dst[v][0] = (dst[u][CO]+w), v, -1});
			}
		}
	}


	cout << (dst[N-1][0] == INFL ? -1 : dst[N-1][0]) << nl;
	
    return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 596 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 15768 KB Output is correct
2 Correct 59 ms 8488 KB Output is correct
3 Correct 161 ms 15584 KB Output is correct
4 Correct 102 ms 12588 KB Output is correct
5 Correct 479 ms 49484 KB Output is correct
6 Correct 436 ms 46896 KB Output is correct
7 Correct 331 ms 45040 KB Output is correct
8 Correct 381 ms 40184 KB Output is correct
9 Correct 393 ms 40268 KB Output is correct
10 Correct 243 ms 27608 KB Output is correct
11 Correct 138 ms 29504 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 130 ms 15768 KB Output is correct
22 Correct 59 ms 8488 KB Output is correct
23 Correct 161 ms 15584 KB Output is correct
24 Correct 102 ms 12588 KB Output is correct
25 Correct 479 ms 49484 KB Output is correct
26 Correct 436 ms 46896 KB Output is correct
27 Correct 331 ms 45040 KB Output is correct
28 Correct 381 ms 40184 KB Output is correct
29 Correct 393 ms 40268 KB Output is correct
30 Correct 243 ms 27608 KB Output is correct
31 Correct 138 ms 29504 KB Output is correct
32 Correct 103 ms 10772 KB Output is correct
33 Correct 149 ms 16196 KB Output is correct
34 Correct 285 ms 26772 KB Output is correct
35 Correct 252 ms 24560 KB Output is correct
36 Correct 275 ms 36636 KB Output is correct
37 Correct 302 ms 40664 KB Output is correct
38 Correct 376 ms 51284 KB Output is correct
39 Correct 134 ms 15440 KB Output is correct
40 Correct 390 ms 40164 KB Output is correct
41 Correct 384 ms 40480 KB Output is correct
42 Correct 419 ms 43940 KB Output is correct
43 Correct 133 ms 15992 KB Output is correct
44 Correct 216 ms 18688 KB Output is correct
45 Correct 319 ms 37340 KB Output is correct
46 Correct 266 ms 36284 KB Output is correct
47 Correct 307 ms 39396 KB Output is correct
48 Correct 540 ms 49360 KB Output is correct