oj.uz

Submission #814324

# Submission time Handle Problem Language Result Execution time Memory
814324 2023-08-08T06:51:40 Z MohamedAhmed04 Robot (JOI21_ho_t4) C++14
24 / 100
 516 ms 41016 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])
		{
			if(dist[node] == dist[childd[1]] + childd[2])
				mp2[{node , childd[0]}] = max(mp2[{node , childd[0]}] , 1ll * childd[2]) ;
		}
		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
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 2772 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 2832 KB Output is correct
12 Incorrect 3 ms 2900 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 14352 KB Output is correct
2 Correct 47 ms 8808 KB Output is correct
3 Correct 120 ms 12244 KB Output is correct
4 Correct 65 ms 10600 KB Output is correct
5 Correct 516 ms 41016 KB Output is correct
6 Correct 459 ms 34628 KB Output is correct
7 Correct 241 ms 22952 KB Output is correct
8 Correct 466 ms 24012 KB Output is correct
9 Correct 391 ms 28044 KB Output is correct
10 Correct 234 ms 24212 KB Output is correct
11 Correct 81 ms 13816 KB Output is correct

Subtask #3
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 2772 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 2832 KB Output is correct
12 Incorrect 3 ms 2900 KB Output isn't correct
13 Halted 0 ms 0 KB -