oj.uz

Submission #490134

# Submission time Handle Problem Language Result Execution time Memory
490134 2021-11-25T20:50:48 Z rainliofficial Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 93336 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 int MAXN = 2e5+5, MAXM = 4e5+5;
int n, m;
map<int, vector<Edge>> arr[MAXN];
map<int, ll> recolor[MAXN];
ll dp[MAXN];
int edge_color[MAXN], edge_cost[MAXN];
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] = 1e18;
	}
	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 == 1e18) ans = -1;
	cout << ans << "\n";
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28432 KB Output is correct
2 Correct 14 ms 28472 KB Output is correct
3 Correct 14 ms 28512 KB Output is correct
4 Correct 15 ms 28492 KB Output is correct
5 Correct 14 ms 28492 KB Output is correct
6 Correct 14 ms 28432 KB Output is correct
7 Correct 15 ms 28620 KB Output is correct
8 Correct 20 ms 28492 KB Output is correct
9 Correct 17 ms 29132 KB Output is correct
10 Correct 16 ms 29004 KB Output is correct
11 Correct 16 ms 28836 KB Output is correct
12 Correct 15 ms 28832 KB Output is correct
13 Correct 15 ms 28844 KB Output is correct
14 Correct 16 ms 28844 KB Output is correct
15 Correct 15 ms 28796 KB Output is correct
16 Correct 16 ms 28748 KB Output is correct
17 Correct 16 ms 28876 KB Output is correct
18 Correct 15 ms 28592 KB Output is correct
19 Correct 16 ms 28748 KB Output is correct
20 Correct 16 ms 28708 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 47676 KB Output is correct
2 Correct 79 ms 38248 KB Output is correct
3 Correct 202 ms 44468 KB Output is correct
4 Correct 118 ms 41232 KB Output is correct
5 Correct 760 ms 93336 KB Output is correct
6 Correct 612 ms 86668 KB Output is correct
7 Correct 297 ms 69252 KB Output is correct
8 Correct 379 ms 66580 KB Output is correct
9 Correct 395 ms 66520 KB Output is correct
10 Correct 309 ms 62704 KB Output is correct
11 Correct 119 ms 47428 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28432 KB Output is correct
2 Correct 14 ms 28472 KB Output is correct
3 Correct 14 ms 28512 KB Output is correct
4 Correct 15 ms 28492 KB Output is correct
5 Correct 14 ms 28492 KB Output is correct
6 Correct 14 ms 28432 KB Output is correct
7 Correct 15 ms 28620 KB Output is correct
8 Correct 20 ms 28492 KB Output is correct
9 Correct 17 ms 29132 KB Output is correct
10 Correct 16 ms 29004 KB Output is correct
11 Correct 16 ms 28836 KB Output is correct
12 Correct 15 ms 28832 KB Output is correct
13 Correct 15 ms 28844 KB Output is correct
14 Correct 16 ms 28844 KB Output is correct
15 Correct 15 ms 28796 KB Output is correct
16 Correct 16 ms 28748 KB Output is correct
17 Correct 16 ms 28876 KB Output is correct
18 Correct 15 ms 28592 KB Output is correct
19 Correct 16 ms 28748 KB Output is correct
20 Correct 16 ms 28708 KB Output is correct
21 Correct 202 ms 47676 KB Output is correct
22 Correct 79 ms 38248 KB Output is correct
23 Correct 202 ms 44468 KB Output is correct
24 Correct 118 ms 41232 KB Output is correct
25 Correct 760 ms 93336 KB Output is correct
26 Correct 612 ms 86668 KB Output is correct
27 Correct 297 ms 69252 KB Output is correct
28 Correct 379 ms 66580 KB Output is correct
29 Correct 395 ms 66520 KB Output is correct
30 Correct 309 ms 62704 KB Output is correct
31 Correct 119 ms 47428 KB Output is correct
32 Correct 216 ms 43880 KB Output is correct
33 Correct 254 ms 45200 KB Output is correct
34 Correct 475 ms 65800 KB Output is correct
35 Correct 357 ms 56844 KB Output is correct
36 Correct 264 ms 61996 KB Output is correct
37 Correct 330 ms 64808 KB Output is correct
38 Correct 332 ms 75400 KB Output is correct
39 Correct 189 ms 47776 KB Output is correct
40 Correct 393 ms 67784 KB Output is correct
41 Correct 471 ms 68112 KB Output is correct
42 Correct 540 ms 76616 KB Output is correct
43 Correct 243 ms 51888 KB Output is correct
44 Correct 511 ms 58748 KB Output is correct
45 Correct 299 ms 62832 KB Output is correct
46 Correct 259 ms 63036 KB Output is correct
47 Execution timed out 3084 ms 64408 KB Time limit exceeded
48 Halted 0 ms 0 KB -