oj.uz

Submission #610971

# Submission time Handle Problem Language Result Execution time Memory
610971 2022-07-28T20:42:46 Z penguinhacker Robot (JOI21_ho_t4) C++17
100 / 100
 992 ms 82248 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=1e5;
const ll INF=1e18;
int n, m;
ll dp1[mxN]; // no changed edges leading to this node
map<int, ll> dp2[mxN]; // must use this color
map<int, vector<ar<int, 2>>> adj[mxN];
map<int, ll> mp[mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i=0; i<m; ++i) {
		int u, v, c, w;
		cin >> u >> v >> c >> w, --u, --v;
		adj[u][c].push_back({v, w});
		adj[v][c].push_back({u, w});
		mp[u][c]+=w;
		mp[v][c]+=w;
	}
	for (int i=0; i<n; ++i) {
		dp1[i]=INF;
		for (auto& x : adj[i])
			dp2[i][x.first]=INF;
	}
	dp1[0]=0;
	priority_queue<ar<ll, 3>, vector<ar<ll, 3>>, greater<ar<ll, 3>>> pq;
	pq.push({0, 0, -1});
	while(pq.size()) {
		ll d=pq.top()[0];
		int u=pq.top()[1], t=pq.top()[2];
		pq.pop();
		if (t==-1&&d^dp1[u]||~t&&d^dp2[u][t])
			continue;
		if (t==-1) {
			for (auto& x : adj[u]) {
				int c=x.first;
				for (ar<int, 2> v : x.second) {
					ll cur=min(d+mp[u][c]-v[1], d+v[1]);
					if (cur<dp1[v[0]])
						pq.push({dp1[v[0]]=cur, v[0], -1});
					// change this edge and force this color
					if (d<dp2[v[0]][c])
						pq.push({dp2[v[0]][c]=d, v[0], c});
				}
			}
		} else {
			for (ar<int, 2> v : adj[u][t]) {
				ll cur=d+mp[u][t]-v[1];
				if (cur<dp1[v[0]])
					pq.push({dp1[v[0]]=cur, v[0], -1});
			}
		}
	}
	cout << (dp1[n-1]^INF?dp1[n-1]:-1);
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:39:12: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   39 |   if (t==-1&&d^dp1[u]||~t&&d^dp2[u][t])
      |       ~~~~~^~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 10 ms 14408 KB Output is correct
5 Correct 7 ms 14404 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 14 ms 14932 KB Output is correct
10 Correct 10 ms 14932 KB Output is correct
11 Correct 11 ms 14804 KB Output is correct
12 Correct 11 ms 14676 KB Output is correct
13 Correct 9 ms 14796 KB Output is correct
14 Correct 8 ms 14804 KB Output is correct
15 Correct 8 ms 14548 KB Output is correct
16 Correct 9 ms 14680 KB Output is correct
17 Correct 9 ms 14740 KB Output is correct
18 Correct 8 ms 14548 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 10 ms 14676 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 32552 KB Output is correct
2 Correct 73 ms 23708 KB Output is correct
3 Correct 145 ms 27172 KB Output is correct
4 Correct 103 ms 26244 KB Output is correct
5 Correct 992 ms 76988 KB Output is correct
6 Correct 713 ms 69984 KB Output is correct
7 Correct 291 ms 51152 KB Output is correct
8 Correct 351 ms 46508 KB Output is correct
9 Correct 358 ms 46564 KB Output is correct
10 Correct 293 ms 48648 KB Output is correct
11 Correct 123 ms 35536 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 10 ms 14408 KB Output is correct
5 Correct 7 ms 14404 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 14 ms 14932 KB Output is correct
10 Correct 10 ms 14932 KB Output is correct
11 Correct 11 ms 14804 KB Output is correct
12 Correct 11 ms 14676 KB Output is correct
13 Correct 9 ms 14796 KB Output is correct
14 Correct 8 ms 14804 KB Output is correct
15 Correct 8 ms 14548 KB Output is correct
16 Correct 9 ms 14680 KB Output is correct
17 Correct 9 ms 14740 KB Output is correct
18 Correct 8 ms 14548 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 10 ms 14676 KB Output is correct
21 Correct 190 ms 32552 KB Output is correct
22 Correct 73 ms 23708 KB Output is correct
23 Correct 145 ms 27172 KB Output is correct
24 Correct 103 ms 26244 KB Output is correct
25 Correct 992 ms 76988 KB Output is correct
26 Correct 713 ms 69984 KB Output is correct
27 Correct 291 ms 51152 KB Output is correct
28 Correct 351 ms 46508 KB Output is correct
29 Correct 358 ms 46564 KB Output is correct
30 Correct 293 ms 48648 KB Output is correct
31 Correct 123 ms 35536 KB Output is correct
32 Correct 106 ms 24648 KB Output is correct
33 Correct 129 ms 28252 KB Output is correct
34 Correct 345 ms 49388 KB Output is correct
35 Correct 255 ms 41024 KB Output is correct
36 Correct 288 ms 43520 KB Output is correct
37 Correct 310 ms 46796 KB Output is correct
38 Correct 318 ms 57052 KB Output is correct
39 Correct 128 ms 27432 KB Output is correct
40 Correct 351 ms 47840 KB Output is correct
41 Correct 409 ms 48164 KB Output is correct
42 Correct 436 ms 61600 KB Output is correct
43 Correct 184 ms 37448 KB Output is correct
44 Correct 323 ms 39612 KB Output is correct
45 Correct 313 ms 44624 KB Output is correct
46 Correct 261 ms 44640 KB Output is correct
47 Correct 292 ms 46336 KB Output is correct
48 Correct 968 ms 82248 KB Output is correct