oj.uz

Submission #768829

# Submission time Handle Problem Language Result Execution time Memory
768829 2023-06-28T17:36:03 Z LeoChen112358 Robot (JOI21_ho_t4) C++14
100 / 100
 841 ms 81736 KB 
#include <bits/stdc++.h>
using namespace std;

const int Nlim=1e5,Mlim=2e5,Vlim=1e9;
const long INF=(long)Vlim*Mlim+1;
#define pii pair<long,pair<int,int>>
int N,M;
struct edge{
	int node,color,price;
	edge(int nn,int cc,int pp){
		node=nn;
		color=cc;
		price=pp;
	}
};
map<int,vector<edge>>conn[Nlim];
//cost = min(recolor you, recolor neighbors)
//cost to get to i
long dp1[Nlim];
//cost to get to i with a c-edge and will go thru another c-edge (so we'll recolor later)
//applies only when we are to recolor neighbors originally (gets affected)
map<int,long>dp2[Nlim],sum[Nlim];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>N>>M;
	for(int i=0; i<M; i++){
		int a,b,c,p;
		cin>>a>>b>>c>>p;
		a--,b--,c--;
		conn[a][c].push_back(edge(b,c,p));
		conn[b][c].push_back(edge(a,c,p));//undirected
		sum[a][c]+=p;
		sum[b][c]+=p;
	}
	for(int i=0; i<N; i++)
		dp1[i]=INF;
	priority_queue<pii,vector<pii>,greater<pii>>PQ;
	PQ.push({0,{0,-1}});//cost,node,color
	dp1[0]=0;
	while(!PQ.empty()){
		long prc=PQ.top().first,node=PQ.top().second.first,col=PQ.top().second.second;
		PQ.pop();
		if(col==-1){//no need to recolor neighbor stuff (normal way)
			if(dp1[node]!=prc)continue;
			for(auto stuff:conn[node]){//each color
				for(auto i:stuff.second){
					//1. recolor this edge
					long v1=prc+i.price;
					if(v1<dp1[i.node]){
						dp1[i.node]=v1;
						PQ.push({dp1[i.node],{i.node,-1}});
					}
					//2. recolor neighbors
					long v2=prc+sum[node][i.color]-i.price;
					if(v2<dp1[i.node]){
						dp1[i.node]=v2;
						PQ.push({dp1[i.node],{i.node,-1}});
					}
					//3. recolor at next step (virtual transition)
					if(dp2[i.node].count(i.color)==0 or prc<dp2[i.node][i.color]){
						dp2[i.node][i.color]=prc;
						PQ.push({prc,{i.node,i.color}});
					}
				}
			}
		}
		else{//need to recolor neighbor stuff (special case)
			if(dp2[node][col]!=prc)continue;
			for(auto i:conn[node][col]){
				long val=sum[node][col];
				if(prc+val-i.price<dp1[i.node]){
					dp1[i.node]=prc+val-i.price;
					PQ.push({dp1[i.node],{i.node,-1}});
				}
			}
		}
	}
	if(dp1[N-1]==INF)cout<<-1<<'\n';
	else cout<<dp1[N-1]<<'\n';
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14548 KB Output is correct
8 Correct 7 ms 14432 KB Output is correct
9 Correct 9 ms 15060 KB Output is correct
10 Correct 8 ms 14932 KB Output is correct
11 Correct 8 ms 14688 KB Output is correct
12 Correct 8 ms 14676 KB Output is correct
13 Correct 8 ms 14692 KB Output is correct
14 Correct 8 ms 14716 KB Output is correct
15 Correct 8 ms 14684 KB Output is correct
16 Correct 8 ms 14676 KB Output is correct
17 Correct 8 ms 14796 KB Output is correct
18 Correct 8 ms 14532 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 7 ms 14676 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 31908 KB Output is correct
2 Correct 60 ms 24180 KB Output is correct
3 Correct 110 ms 29840 KB Output is correct
4 Correct 75 ms 27076 KB Output is correct
5 Correct 778 ms 80020 KB Output is correct
6 Correct 677 ms 68952 KB Output is correct
7 Correct 245 ms 49316 KB Output is correct
8 Correct 289 ms 48484 KB Output is correct
9 Correct 299 ms 48408 KB Output is correct
10 Correct 235 ms 46464 KB Output is correct
11 Correct 91 ms 31500 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14548 KB Output is correct
8 Correct 7 ms 14432 KB Output is correct
9 Correct 9 ms 15060 KB Output is correct
10 Correct 8 ms 14932 KB Output is correct
11 Correct 8 ms 14688 KB Output is correct
12 Correct 8 ms 14676 KB Output is correct
13 Correct 8 ms 14692 KB Output is correct
14 Correct 8 ms 14716 KB Output is correct
15 Correct 8 ms 14684 KB Output is correct
16 Correct 8 ms 14676 KB Output is correct
17 Correct 8 ms 14796 KB Output is correct
18 Correct 8 ms 14532 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 7 ms 14676 KB Output is correct
21 Correct 151 ms 31908 KB Output is correct
22 Correct 60 ms 24180 KB Output is correct
23 Correct 110 ms 29840 KB Output is correct
24 Correct 75 ms 27076 KB Output is correct
25 Correct 778 ms 80020 KB Output is correct
26 Correct 677 ms 68952 KB Output is correct
27 Correct 245 ms 49316 KB Output is correct
28 Correct 289 ms 48484 KB Output is correct
29 Correct 299 ms 48408 KB Output is correct
30 Correct 235 ms 46464 KB Output is correct
31 Correct 91 ms 31500 KB Output is correct
32 Correct 86 ms 26376 KB Output is correct
33 Correct 88 ms 28052 KB Output is correct
34 Correct 306 ms 48356 KB Output is correct
35 Correct 229 ms 39984 KB Output is correct
36 Correct 228 ms 43156 KB Output is correct
37 Correct 266 ms 45824 KB Output is correct
38 Correct 258 ms 52936 KB Output is correct
39 Correct 91 ms 29344 KB Output is correct
40 Correct 279 ms 49696 KB Output is correct
41 Correct 343 ms 49884 KB Output is correct
42 Correct 375 ms 58616 KB Output is correct
43 Correct 147 ms 35784 KB Output is correct
44 Correct 260 ms 40276 KB Output is correct
45 Correct 232 ms 45792 KB Output is correct
46 Correct 217 ms 45660 KB Output is correct
47 Correct 240 ms 45368 KB Output is correct
48 Correct 841 ms 81736 KB Output is correct