Submission #467807

# Submission time Handle Problem Language Result Execution time Memory
467807 2021-08-24T16:36:39 Z Autron Robot (JOI21_ho_t4) C++14
100 / 100
1361 ms 131648 KB
#include <bits/stdc++.h>
using namespace std;

#define int long long

int n, m;

struct edge{
	int to, c, p;
};

struct nod{
	unordered_map<int, vector<edge>> out;
	int dp;
	bool used;
	unordered_map<int, int> dpc;
	unordered_map<int, bool> usedc;
	unordered_map<int, int> sum;
};

struct elem{
	int cost, x, c;
	
	bool operator<(const elem &ot) const{
		return cost>ot.cost;
	}

};

vector<nod> g;


int32_t main(){
	cin>>n>>m;
	g.resize(n+1);
	for(int i=1;i<=m;++i){
		int a, b, c, p;
		cin>>a>>b>>c>>p;
		g[a].out[c].push_back({b, c, p});
		g[b].out[c].push_back({a, c, p});
		g[a].sum[c]+=p;
		g[b].sum[c]+=p;
	}

	priority_queue<elem> pq;
	for(int i=1;i<=n;++i) g[i].dp=1e18;
	g[1].dp=0;
	pq.push({0, 1, 0});
	while(!pq.empty()){
		elem x=pq.top();
		pq.pop();
		if(x.c){
			if(g[x.x].usedc.count(x.c)) continue;
			g[x.x].usedc[x.c]=1;
			for(auto it:g[x.x].out[x.c]){
				int cost=g[x.x].sum[x.c]-it.p+x.cost;	
				if(cost<g[it.to].dp){
					g[it.to].dp=cost;
					pq.push({g[it.to].dp, it.to, 0});
				}
			}
		}
		else{
			if(g[x.x].used) continue;
			g[x.x].used=1;		
			for(auto out:g[x.x].out){
				for(auto it:out.second){
					int cost=g[x.x].sum[it.c]-it.p+x.cost;	
					if(cost<g[it.to].dp){
						g[it.to].dp=cost;
						pq.push({g[it.to].dp, it.to, 0});
					}
					cost=it.p+x.cost;
					if(cost<g[it.to].dp){
						g[it.to].dp=cost;
						pq.push({g[it.to].dp, it.to, 0});
					}
					cost=x.cost;
					if((!g[it.to].dpc.count(it.c))||(cost<g[it.to].dpc[it.c])){
						g[it.to].dpc[it.c]=cost;
						pq.push({g[it.to].dpc[it.c], it.to, it.c});
					}
				}
			}
		}
	}
	int sol=g[n].dp;
	if(sol==1e18) sol=-1;
	cout<<sol<<"\n";

}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 1484 KB Output is correct
10 Correct 5 ms 1484 KB Output is correct
11 Correct 4 ms 1228 KB Output is correct
12 Correct 4 ms 1228 KB Output is correct
13 Correct 4 ms 1228 KB Output is correct
14 Correct 4 ms 1228 KB Output is correct
15 Correct 3 ms 1100 KB Output is correct
16 Correct 5 ms 1196 KB Output is correct
17 Correct 4 ms 1008 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 356 ms 32852 KB Output is correct
2 Correct 157 ms 18512 KB Output is correct
3 Correct 517 ms 26572 KB Output is correct
4 Correct 213 ms 27296 KB Output is correct
5 Correct 1262 ms 125844 KB Output is correct
6 Correct 989 ms 115116 KB Output is correct
7 Correct 722 ms 102100 KB Output is correct
8 Correct 805 ms 95284 KB Output is correct
9 Correct 824 ms 95320 KB Output is correct
10 Correct 531 ms 58228 KB Output is correct
11 Correct 250 ms 48964 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 1484 KB Output is correct
10 Correct 5 ms 1484 KB Output is correct
11 Correct 4 ms 1228 KB Output is correct
12 Correct 4 ms 1228 KB Output is correct
13 Correct 4 ms 1228 KB Output is correct
14 Correct 4 ms 1228 KB Output is correct
15 Correct 3 ms 1100 KB Output is correct
16 Correct 5 ms 1196 KB Output is correct
17 Correct 4 ms 1008 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
21 Correct 356 ms 32852 KB Output is correct
22 Correct 157 ms 18512 KB Output is correct
23 Correct 517 ms 26572 KB Output is correct
24 Correct 213 ms 27296 KB Output is correct
25 Correct 1262 ms 125844 KB Output is correct
26 Correct 989 ms 115116 KB Output is correct
27 Correct 722 ms 102100 KB Output is correct
28 Correct 805 ms 95284 KB Output is correct
29 Correct 824 ms 95320 KB Output is correct
30 Correct 531 ms 58228 KB Output is correct
31 Correct 250 ms 48964 KB Output is correct
32 Correct 346 ms 18700 KB Output is correct
33 Correct 388 ms 29912 KB Output is correct
34 Correct 707 ms 59556 KB Output is correct
35 Correct 584 ms 52748 KB Output is correct
36 Correct 556 ms 94816 KB Output is correct
37 Correct 616 ms 98156 KB Output is correct
38 Correct 671 ms 105700 KB Output is correct
39 Correct 398 ms 27172 KB Output is correct
40 Correct 883 ms 100552 KB Output is correct
41 Correct 875 ms 100864 KB Output is correct
42 Correct 849 ms 96540 KB Output is correct
43 Correct 377 ms 32504 KB Output is correct
44 Correct 808 ms 34892 KB Output is correct
45 Correct 590 ms 95628 KB Output is correct
46 Correct 539 ms 94804 KB Output is correct
47 Correct 635 ms 98368 KB Output is correct
48 Correct 1361 ms 131648 KB Output is correct