oj.uz

Submission #227056

# Submission time Handle Problem Language Result Execution time Memory
227056 2020-04-25T23:27:57 Z MohamedAhmed04 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 441 ms 30048 KB 
#include <bits/stdc++.h>

using namespace std ;

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

bool vis[MAX] , mark[MAX] ;
long long dist[3][MAX] , dp1[MAX] , dp2[MAX] ;
int n , m , s , t , u , v ;

vector< vector< pair<int , long long> > >adj(MAX) ;
vector< vector<int> >adj2(MAX) ;

void dijkstra(int src , int a)
{
	for(int i = 0 ; i < MAX ; ++i)
		dist[a][i] = inf ;
	priority_queue< pair<long long , int> , vector< pair<long long , int> > , greater< pair<long long , int> > >q; 
	dist[a][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(cost > dist[a][node])
			continue ;
		for(auto &child : adj[node])
		{
			int nnode = child.first ;
			long long ncost = child.second + cost ;
			if(ncost < dist[a][nnode])
			{
				dist[a][nnode] = ncost ;
				q.push({ncost , nnode}) ;
			}
		}
	}
	return ;
}

long long ans ;

void dfs(int node)
{
	vis[node] = 1 ;
	mark[node] = 1 ;
	for(auto &child : adj[node])
	{
		if(dist[0][node] + child.second == dist[0][child.first])
		{
			if(!vis[child.first])
				dfs(child.first) ;
			adj2[node].push_back(child.first) ;
		}
	}
	mark[node] = 0 ;
	return ;
}

void dfs2(int node)
{
	vis[node] = 1 ;
	dp1[node] = dp2[node] = inf ;
	for(auto &child : adj2[node])
	{
		if(!vis[child])
			dfs2(child) ;
		dp1[node] = min(dp1[node] , dp1[child]) ;
		dp2[node] = min(dp2[node] , dp2[child]) ; ;
		if((dp1[child] == inf || dp2[child] == inf) && child != t)
			continue ;
		dp1[node] = min(dp1[node], dist[1][child]) ;
		dp2[node] = min(dp2[node], dist[2][child]) ;
	}
	ans = min(ans, dist[2][node] + dp1[node]) ;
	ans = min(ans, dist[1][node] + dp2[node]) ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	cin>>s>>t ;
	cin>>u>>v ;
	for(int i = 0 ; i < m ; ++i)
	{
		int x , y ;
		long long z ;
		cin>>x>>y>>z ;
		adj[x].emplace_back(y , z) ;
		adj[y].emplace_back(x , z) ;
	}
	dijkstra(s , 0) ;
	dijkstra(u , 1) ;
	dijkstra(v , 2) ;
	ans = dist[1][v] ;
	dfs(s) ;
	memset(vis , 0 , sizeof(vis)) ;
	dfs2(s) ;
	return cout<<ans<<"\n" , 0 ;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 24868 KB Output is correct
2 Correct 389 ms 25140 KB Output is correct
3 Correct 335 ms 28880 KB Output is correct
4 Correct 354 ms 24736 KB Output is correct
5 Correct 373 ms 25596 KB Output is correct
6 Correct 359 ms 24816 KB Output is correct
7 Correct 441 ms 25572 KB Output is correct
8 Correct 425 ms 25636 KB Output is correct
9 Correct 325 ms 25200 KB Output is correct
10 Correct 290 ms 24912 KB Output is correct
11 Correct 155 ms 22008 KB Output is correct
12 Correct 353 ms 25860 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 26996 KB Output is correct
2 Correct 376 ms 26848 KB Output is correct
3 Correct 356 ms 26988 KB Output is correct
4 Correct 378 ms 26968 KB Output is correct
5 Correct 362 ms 26844 KB Output is correct
6 Correct 342 ms 28580 KB Output is correct
7 Correct 354 ms 30048 KB Output is correct
8 Correct 360 ms 26940 KB Output is correct
9 Correct 359 ms 26952 KB Output is correct
10 Correct 372 ms 27124 KB Output is correct
11 Correct 164 ms 22264 KB Output is correct
12 Correct 429 ms 28912 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9216 KB Output is correct
2 Correct 9 ms 7552 KB Output is correct
3 Correct 10 ms 7552 KB Output is correct
4 Correct 25 ms 11008 KB Output is correct
5 Correct 18 ms 9216 KB Output is correct
6 Correct 10 ms 7680 KB Output is correct
7 Correct 11 ms 7680 KB Output is correct
8 Correct 10 ms 7808 KB Output is correct
9 Correct 9 ms 7680 KB Output is correct
10 Correct 19 ms 9216 KB Output is correct
11 Correct 9 ms 7552 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 9 ms 7552 KB Output is correct
14 Correct 9 ms 7552 KB Output is correct
15 Correct 10 ms 7552 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 24868 KB Output is correct
2 Correct 389 ms 25140 KB Output is correct
3 Correct 335 ms 28880 KB Output is correct
4 Correct 354 ms 24736 KB Output is correct
5 Correct 373 ms 25596 KB Output is correct
6 Correct 359 ms 24816 KB Output is correct
7 Correct 441 ms 25572 KB Output is correct
8 Correct 425 ms 25636 KB Output is correct
9 Correct 325 ms 25200 KB Output is correct
10 Correct 290 ms 24912 KB Output is correct
11 Correct 155 ms 22008 KB Output is correct
12 Correct 353 ms 25860 KB Output is correct
13 Correct 363 ms 26996 KB Output is correct
14 Correct 376 ms 26848 KB Output is correct
15 Correct 356 ms 26988 KB Output is correct
16 Correct 378 ms 26968 KB Output is correct
17 Correct 362 ms 26844 KB Output is correct
18 Correct 342 ms 28580 KB Output is correct
19 Correct 354 ms 30048 KB Output is correct
20 Correct 360 ms 26940 KB Output is correct
21 Correct 359 ms 26952 KB Output is correct
22 Correct 372 ms 27124 KB Output is correct
23 Correct 164 ms 22264 KB Output is correct
24 Correct 429 ms 28912 KB Output is correct
25 Correct 17 ms 9216 KB Output is correct
26 Correct 9 ms 7552 KB Output is correct
27 Correct 10 ms 7552 KB Output is correct
28 Correct 25 ms 11008 KB Output is correct
29 Correct 18 ms 9216 KB Output is correct
30 Correct 10 ms 7680 KB Output is correct
31 Correct 11 ms 7680 KB Output is correct
32 Correct 10 ms 7808 KB Output is correct
33 Correct 9 ms 7680 KB Output is correct
34 Correct 19 ms 9216 KB Output is correct
35 Correct 9 ms 7552 KB Output is correct
36 Correct 10 ms 7552 KB Output is correct
37 Correct 9 ms 7552 KB Output is correct
38 Correct 9 ms 7552 KB Output is correct
39 Correct 10 ms 7552 KB Output is correct
40 Correct 297 ms 24740 KB Output is correct
41 Correct 336 ms 24728 KB Output is correct
42 Correct 327 ms 24820 KB Output is correct
43 Correct 216 ms 21620 KB Output is correct
44 Correct 222 ms 21624 KB Output is correct
45 Correct 429 ms 25664 KB Output is correct
46 Correct 327 ms 25276 KB Output is correct
47 Correct 432 ms 25004 KB Output is correct
48 Correct 156 ms 19576 KB Output is correct
49 Correct 263 ms 24320 KB Output is correct
50 Correct 310 ms 25296 KB Output is correct
51 Correct 306 ms 25660 KB Output is correct