oj.uz

Submission #961688

# Submission time Handle Problem Language Result Execution time Memory
961688 2024-04-12T10:18:29 Z happy_node Robot (JOI21_ho_t4) C++17
100 / 100
 952 ms 133280 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX=5e5+5;
int N,M;
ll dist[MX];
vector<array<int,3>> adj[MX];

map<int,int> id[MX];
map<int,ll> sum[MX];
int rev[MX];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin>>N>>M;

	priority_queue<pair<ll,ll>> pq;
	int z=N+1;
	for(int i=1;i<=M;i++) {
		int a,b,c,p;
		cin>>a>>b>>c>>p;
		
		sum[a][c]+=p;
		sum[b][c]+=p;
		
		if(!id[b].count(c)) {
			rev[z]=b;
			id[b][c]=z++;
		}

		if(!id[a].count(c)) {
			rev[z]=a;
			id[a][c]=z++;
		}

		adj[a].push_back({b,c,p});
		adj[b].push_back({a,c,p});

		adj[id[a][c]].push_back({b,c,p});
		adj[b].push_back({id[a][c],c,p});

		adj[id[b][c]].push_back({a,c,p});
		adj[a].push_back({id[b][c],c,p});

		adj[id[a][c]].push_back({id[b][c],c,p});
		adj[id[b][c]].push_back({id[a][c],c,p});
	}

	for(int i=1;i<z;i++) {
		dist[i]=1e18;
	}

	pq.push({0,1});
	dist[1]=0;
	while(!pq.empty()) {
		auto [d,v]=pq.top(); pq.pop();
		d=-d;
		if(d>dist[v]) continue;
		
		if(v>N) {
			for(auto [u,c,p]:adj[v]) {
				ll cost=sum[rev[v]][c]-p;
				if(dist[u]>dist[v]+cost) {
					dist[u]=dist[v]+cost;
					pq.push({-dist[u],u});
				}
			}
		} else {
			for(auto [u,c,p]:adj[v]) {
				if(dist[u]>dist[v]+p) {
					dist[u]=dist[v]+p;
					pq.push({-dist[u],u});
				}	
			}

			for(auto [u,c,p]:adj[v]) {
				if(u>N) {
					if(dist[u]>dist[v]) {
						dist[u]=dist[v];
						pq.push({-dist[u],u});
					}
				} else {
					ll cost=sum[v][c]-p;
					if(dist[u]>dist[v]+cost) {
						dist[u]=dist[v]+cost;
						pq.push({-dist[u],u});
					}
				}	
			}
		}
	}

	cout<<(dist[N]==1e18?-1:dist[N])<<'\n';
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 62020 KB Output is correct
2 Correct 12 ms 62024 KB Output is correct
3 Correct 13 ms 61932 KB Output is correct
4 Correct 12 ms 61784 KB Output is correct
5 Correct 13 ms 62044 KB Output is correct
6 Correct 14 ms 61788 KB Output is correct
7 Correct 14 ms 62044 KB Output is correct
8 Correct 13 ms 62044 KB Output is correct
9 Correct 17 ms 62468 KB Output is correct
10 Correct 16 ms 62556 KB Output is correct
11 Correct 15 ms 62300 KB Output is correct
12 Correct 15 ms 62300 KB Output is correct
13 Correct 14 ms 62556 KB Output is correct
14 Correct 15 ms 62556 KB Output is correct
15 Correct 17 ms 62268 KB Output is correct
16 Correct 15 ms 62300 KB Output is correct
17 Correct 15 ms 62300 KB Output is correct
18 Correct 13 ms 62044 KB Output is correct
19 Correct 15 ms 62300 KB Output is correct
20 Correct 14 ms 62300 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 82320 KB Output is correct
2 Correct 71 ms 71760 KB Output is correct
3 Correct 158 ms 88676 KB Output is correct
4 Correct 105 ms 75152 KB Output is correct
5 Correct 896 ms 128316 KB Output is correct
6 Correct 750 ms 119716 KB Output is correct
7 Correct 270 ms 108732 KB Output is correct
8 Correct 404 ms 104588 KB Output is correct
9 Correct 398 ms 104480 KB Output is correct
10 Correct 279 ms 95952 KB Output is correct
11 Correct 133 ms 85404 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 62020 KB Output is correct
2 Correct 12 ms 62024 KB Output is correct
3 Correct 13 ms 61932 KB Output is correct
4 Correct 12 ms 61784 KB Output is correct
5 Correct 13 ms 62044 KB Output is correct
6 Correct 14 ms 61788 KB Output is correct
7 Correct 14 ms 62044 KB Output is correct
8 Correct 13 ms 62044 KB Output is correct
9 Correct 17 ms 62468 KB Output is correct
10 Correct 16 ms 62556 KB Output is correct
11 Correct 15 ms 62300 KB Output is correct
12 Correct 15 ms 62300 KB Output is correct
13 Correct 14 ms 62556 KB Output is correct
14 Correct 15 ms 62556 KB Output is correct
15 Correct 17 ms 62268 KB Output is correct
16 Correct 15 ms 62300 KB Output is correct
17 Correct 15 ms 62300 KB Output is correct
18 Correct 13 ms 62044 KB Output is correct
19 Correct 15 ms 62300 KB Output is correct
20 Correct 14 ms 62300 KB Output is correct
21 Correct 163 ms 82320 KB Output is correct
22 Correct 71 ms 71760 KB Output is correct
23 Correct 158 ms 88676 KB Output is correct
24 Correct 105 ms 75152 KB Output is correct
25 Correct 896 ms 128316 KB Output is correct
26 Correct 750 ms 119716 KB Output is correct
27 Correct 270 ms 108732 KB Output is correct
28 Correct 404 ms 104588 KB Output is correct
29 Correct 398 ms 104480 KB Output is correct
30 Correct 279 ms 95952 KB Output is correct
31 Correct 133 ms 85404 KB Output is correct
32 Correct 122 ms 90296 KB Output is correct
33 Correct 128 ms 90416 KB Output is correct
34 Correct 346 ms 104704 KB Output is correct
35 Correct 261 ms 95284 KB Output is correct
36 Correct 254 ms 98348 KB Output is correct
37 Correct 323 ms 107140 KB Output is correct
38 Correct 300 ms 113260 KB Output is correct
39 Correct 128 ms 97224 KB Output is correct
40 Correct 411 ms 109832 KB Output is correct
41 Correct 429 ms 110196 KB Output is correct
42 Correct 451 ms 114280 KB Output is correct
43 Correct 182 ms 88196 KB Output is correct
44 Correct 340 ms 111036 KB Output is correct
45 Correct 301 ms 99904 KB Output is correct
46 Correct 259 ms 99424 KB Output is correct
47 Correct 276 ms 102504 KB Output is correct
48 Correct 952 ms 133280 KB Output is correct