oj.uz

Submission #814344

# Submission time Handle Problem Language Result Execution time Memory
814344 2023-08-08T06:58:33 Z MohamedAhmed04 Robot (JOI21_ho_t4) C++14
100 / 100
 637 ms 46952 KB 
#include <bits/stdc++.h>

using namespace std ;

const long long inf = 1e18 ;
const int MAX = 1e5 + 10 ;

int arr[MAX] ;
int n , m ;

vector< vector< array<int , 3> > >adj(MAX) ;

long long dist[MAX] ;

map< pair<int , int> , long long>mp , mp2 ;

void dijkstra(int src)
{
	for(int i = 1 ; i <= n ; ++i)
		dist[i] = inf ;
	priority_queue< pair<long long , int> , vector< pair<long long , int> > , greater< pair<long long , int> > >q ;
	dist[src] = 0 ;
	q.push({0 , src}) ;
	while(!q.empty())
	{
		pair<long long , int>p = q.top() ;
		q.pop() ;
		int node = p.second ;
		long long cost = p.first ;
		if(dist[node] < cost)
			continue ;
		for(auto &childd : adj[node])
		{
			mp2[{node , childd[0]}] = max(mp2[{node , childd[0]}] , 1ll * childd[2] - (dist[childd[1]] + childd[2] - dist[node])) ;
		}
		for(auto &childd : adj[node])
		{
			int child2 = childd[1] ;
			long long cost2 = cost + min(1ll * childd[2] , mp[{node , childd[0]}] - childd[2] - mp2[{node , childd[0]}]) ;
			if(cost2 < dist[child2])
			{
				dist[child2] = cost2 ;
				q.push({cost2 , child2}) ;
			}
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	for(int i = 0 ; i < m ; ++i)
	{
		int x , y , c , w ;
		cin>>x>>y>>c>>w ;
		adj[x].push_back({c , y , w}) ;
		adj[y].push_back({c , x , w}) ;
		mp[{x , c}] += w , mp[{y , c}] += w ;
	}
	dijkstra(1) ;
	if(dist[n] == inf)
		dist[n] = -1 ;
	return cout<<dist[n]<<"\n" , 0 ;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2752 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 3 ms 2900 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 4 ms 2900 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 3 ms 2772 KB Output is correct
20 Correct 3 ms 2836 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 14404 KB Output is correct
2 Correct 67 ms 8776 KB Output is correct
3 Correct 132 ms 12248 KB Output is correct
4 Correct 80 ms 10572 KB Output is correct
5 Correct 586 ms 40960 KB Output is correct
6 Correct 465 ms 34444 KB Output is correct
7 Correct 289 ms 22916 KB Output is correct
8 Correct 382 ms 24036 KB Output is correct
9 Correct 436 ms 24012 KB Output is correct
10 Correct 205 ms 21864 KB Output is correct
11 Correct 85 ms 12032 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2752 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 3 ms 2900 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 4 ms 2900 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 3 ms 2772 KB Output is correct
20 Correct 3 ms 2836 KB Output is correct
21 Correct 142 ms 14404 KB Output is correct
22 Correct 67 ms 8776 KB Output is correct
23 Correct 132 ms 12248 KB Output is correct
24 Correct 80 ms 10572 KB Output is correct
25 Correct 586 ms 40960 KB Output is correct
26 Correct 465 ms 34444 KB Output is correct
27 Correct 289 ms 22916 KB Output is correct
28 Correct 382 ms 24036 KB Output is correct
29 Correct 436 ms 24012 KB Output is correct
30 Correct 205 ms 21864 KB Output is correct
31 Correct 85 ms 12032 KB Output is correct
32 Correct 121 ms 12816 KB Output is correct
33 Correct 123 ms 12984 KB Output is correct
34 Correct 268 ms 26796 KB Output is correct
35 Correct 227 ms 20976 KB Output is correct
36 Correct 214 ms 22808 KB Output is correct
37 Correct 258 ms 24396 KB Output is correct
38 Correct 232 ms 26640 KB Output is correct
39 Correct 159 ms 15608 KB Output is correct
40 Correct 422 ms 29484 KB Output is correct
41 Correct 436 ms 29712 KB Output is correct
42 Correct 384 ms 33476 KB Output is correct
43 Correct 153 ms 17144 KB Output is correct
44 Correct 251 ms 23008 KB Output is correct
45 Correct 308 ms 26076 KB Output is correct
46 Correct 286 ms 25616 KB Output is correct
47 Correct 272 ms 24416 KB Output is correct
48 Correct 637 ms 46952 KB Output is correct