oj.uz

Submission #814347

# Submission time Handle Problem Language Result Execution time Memory
814347 2023-08-08T06:59:09 Z MohamedAhmed04 Robot (JOI21_ho_t4) C++14
100 / 100
 671 ms 41804 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 7 ms 2588 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2784 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 3 ms 2772 KB Output is correct
12 Correct 3 ms 2772 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 3 ms 2900 KB Output is correct
17 Correct 3 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 2888 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 14400 KB Output is correct
2 Correct 55 ms 8780 KB Output is correct
3 Correct 128 ms 12188 KB Output is correct
4 Correct 72 ms 10528 KB Output is correct
5 Correct 671 ms 41004 KB Output is correct
6 Correct 448 ms 34656 KB Output is correct
7 Correct 251 ms 22984 KB Output is correct
8 Correct 368 ms 24016 KB Output is correct
9 Correct 408 ms 24016 KB Output is correct
10 Correct 200 ms 21864 KB Output is correct
11 Correct 86 ms 11940 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 7 ms 2588 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2784 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 3 ms 2772 KB Output is correct
12 Correct 3 ms 2772 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 3 ms 2900 KB Output is correct
17 Correct 3 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 2888 KB Output is correct
21 Correct 137 ms 14400 KB Output is correct
22 Correct 55 ms 8780 KB Output is correct
23 Correct 128 ms 12188 KB Output is correct
24 Correct 72 ms 10528 KB Output is correct
25 Correct 671 ms 41004 KB Output is correct
26 Correct 448 ms 34656 KB Output is correct
27 Correct 251 ms 22984 KB Output is correct
28 Correct 368 ms 24016 KB Output is correct
29 Correct 408 ms 24016 KB Output is correct
30 Correct 200 ms 21864 KB Output is correct
31 Correct 86 ms 11940 KB Output is correct
32 Correct 118 ms 9164 KB Output is correct
33 Correct 133 ms 10016 KB Output is correct
34 Correct 272 ms 22948 KB Output is correct
35 Correct 198 ms 17928 KB Output is correct
36 Correct 230 ms 20144 KB Output is correct
37 Correct 231 ms 21128 KB Output is correct
38 Correct 222 ms 23004 KB Output is correct
39 Correct 145 ms 10924 KB Output is correct
40 Correct 450 ms 23964 KB Output is correct
41 Correct 361 ms 24000 KB Output is correct
42 Correct 447 ms 28820 KB Output is correct
43 Correct 135 ms 14804 KB Output is correct
44 Correct 255 ms 18116 KB Output is correct
45 Correct 323 ms 22140 KB Output is correct
46 Correct 302 ms 21940 KB Output is correct
47 Correct 296 ms 21004 KB Output is correct
48 Correct 614 ms 41804 KB Output is correct