oj.uz

Submission #490138

# Submission time Handle Problem Language Result Execution time Memory
490138 2021-11-25T21:00:37 Z rainliofficial Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 79164 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;


struct Edge{
	int to, c, p, id;
};
struct State{
	int node, prevEdge, colorLater;
	ll cost;
};
bool cmp(const State& a, const State& b){
	return a.cost > b.cost;
}

const ll INF = 1e18;
const int MAXN = 1e5 + 5, MAXM = 2e5 + 5;
int n, m;
map<int, vector<Edge>> arr[MAXN];
map<int, ll> recolor[MAXN];
ll dp[MAXN];
int edge_color[MAXM], edge_cost[MAXM];
map<int, ll> dp2[MAXN];

int main(){
	cin.tie(0)->sync_with_stdio(0);
	// freopen("file.in", "r", stdin);
	// freopen("file.out", "w", stdout);
	cin >> n >> m;
	for (int i=0; i<m; i++){
		int s, e, c, p;
		cin >> s >> e >> c >> p;
		s--; e--;
		recolor[s][c] += p;
		recolor[e][c] += p;
		arr[s][c].push_back({e, c, p, i});
		arr[e][c].push_back({s, c, p, i});
		edge_color[i] = c;
		edge_cost[i] = p;
	}
	for (int i=0; i<n; i++){
		dp[i] = INF;
	}
	priority_queue<State, vector<State>, decltype(&cmp)> pq(cmp);
	pq.push({0, -1, 0, 0});
	dp[0] = 0;
	while (!pq.empty()){
		State curr = pq.top();
		pq.pop();
		// cout << curr.cost << "\n";
		if (curr.colorLater == 1){
			if (dp2[curr.node][edge_color[curr.prevEdge]] != curr.cost){
				continue;
			}
			for (Edge e : arr[curr.node][edge_color[curr.prevEdge]]){
				if (e.id == curr.prevEdge){
                    continue;
                }
                ll nc = curr.cost + recolor[curr.node][e.c] - e.p;
                if (nc < dp[e.to]){
                    pq.push({e.to, e.id, 0, nc});
                    dp[e.to] = nc;
                }
			}
		}else{
			for (auto& s : arr[curr.node]){
				for (Edge e : s.second){
					if (e.id == curr.prevEdge){
						continue;
					}
					// Recolor edge e, but we don't plan to go through another edge of color e.c (explore all possibilities)
                    ll case1 = curr.cost + e.p;
                    if (case1 < dp[e.to]){
                        dp[e.to] = case1;
                        pq.push({e.to, e.id, 0, case1});
                    }   
                    // Recolor all other edges
                    ll case2 = curr.cost + recolor[curr.node][e.c] - e.p;
                    if (case2 < dp[e.to]){
                        dp[e.to] = case2;
                        pq.push({e.to, e.id, 0, case2});
                    }
                    // Recolor edge e, and we will go through another edge of color e.c. We will recolor edge e when we get
                    // to e.to, by recoloring all other edges of color e.c (since we will go through another edge of e.c).
                    ll case3 = curr.cost;
                    if (!dp2[e.to].count(e.c) || case3 < dp2[e.to][e.c]){
                        dp2[e.to][e.c] = case3;
                        pq.push({e.to, e.id, 1, case3});
                    }
				}
			}
		}
	}
	ll ans = dp[n-1];
	if (ans == INF) ans = -1;
	cout << ans << "\n";
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14412 KB Output is correct
2 Correct 7 ms 14412 KB Output is correct
3 Correct 7 ms 14376 KB Output is correct
4 Correct 8 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 8 ms 14520 KB Output is correct
8 Correct 7 ms 14412 KB Output is correct
9 Correct 10 ms 15052 KB Output is correct
10 Correct 10 ms 14976 KB Output is correct
11 Correct 10 ms 14796 KB Output is correct
12 Correct 9 ms 14672 KB Output is correct
13 Correct 9 ms 14796 KB Output is correct
14 Correct 9 ms 14768 KB Output is correct
15 Correct 8 ms 14668 KB Output is correct
16 Correct 9 ms 14668 KB Output is correct
17 Correct 9 ms 14668 KB Output is correct
18 Correct 8 ms 14540 KB Output is correct
19 Correct 9 ms 14640 KB Output is correct
20 Correct 8 ms 14668 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 33496 KB Output is correct
2 Correct 73 ms 24184 KB Output is correct
3 Correct 197 ms 30404 KB Output is correct
4 Correct 122 ms 27104 KB Output is correct
5 Correct 764 ms 79164 KB Output is correct
6 Correct 586 ms 68708 KB Output is correct
7 Correct 315 ms 51088 KB Output is correct
8 Correct 352 ms 48308 KB Output is correct
9 Correct 413 ms 48400 KB Output is correct
10 Correct 308 ms 46216 KB Output is correct
11 Correct 110 ms 31496 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14412 KB Output is correct
2 Correct 7 ms 14412 KB Output is correct
3 Correct 7 ms 14376 KB Output is correct
4 Correct 8 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 8 ms 14520 KB Output is correct
8 Correct 7 ms 14412 KB Output is correct
9 Correct 10 ms 15052 KB Output is correct
10 Correct 10 ms 14976 KB Output is correct
11 Correct 10 ms 14796 KB Output is correct
12 Correct 9 ms 14672 KB Output is correct
13 Correct 9 ms 14796 KB Output is correct
14 Correct 9 ms 14768 KB Output is correct
15 Correct 8 ms 14668 KB Output is correct
16 Correct 9 ms 14668 KB Output is correct
17 Correct 9 ms 14668 KB Output is correct
18 Correct 8 ms 14540 KB Output is correct
19 Correct 9 ms 14640 KB Output is correct
20 Correct 8 ms 14668 KB Output is correct
21 Correct 197 ms 33496 KB Output is correct
22 Correct 73 ms 24184 KB Output is correct
23 Correct 197 ms 30404 KB Output is correct
24 Correct 122 ms 27104 KB Output is correct
25 Correct 764 ms 79164 KB Output is correct
26 Correct 586 ms 68708 KB Output is correct
27 Correct 315 ms 51088 KB Output is correct
28 Correct 352 ms 48308 KB Output is correct
29 Correct 413 ms 48400 KB Output is correct
30 Correct 308 ms 46216 KB Output is correct
31 Correct 110 ms 31496 KB Output is correct
32 Correct 201 ms 26136 KB Output is correct
33 Correct 197 ms 28196 KB Output is correct
34 Correct 460 ms 47996 KB Output is correct
35 Correct 344 ms 39756 KB Output is correct
36 Correct 267 ms 45088 KB Output is correct
37 Correct 328 ms 47500 KB Output is correct
38 Correct 330 ms 57632 KB Output is correct
39 Correct 219 ms 29024 KB Output is correct
40 Correct 419 ms 48292 KB Output is correct
41 Correct 449 ms 48400 KB Output is correct
42 Correct 551 ms 57728 KB Output is correct
43 Correct 236 ms 35336 KB Output is correct
44 Correct 546 ms 39716 KB Output is correct
45 Correct 311 ms 44744 KB Output is correct
46 Correct 251 ms 45308 KB Output is correct
47 Execution timed out 3070 ms 46796 KB Time limit exceeded
48 Halted 0 ms 0 KB -