Submission #41072

# Submission time Handle Problem Language Result Execution time Memory
41072 2018-02-12T12:17:02 Z zscoder Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
543 ms 21668 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

vector<ii> adj[111111];
int n,m; 

vector<ll> dijkstra(int s)
{
	priority_queue<ii,vector<ii>,greater<ii> > pq;
	vector<ll> d(n, ll(1e18));
	pq.push(mp(0,s)); d[s] = 0;
	while(!pq.empty())
	{
		ll dist=pq.top().fi; int u=pq.top().se; pq.pop();
		for(ii x:adj[u])
		{
			ll d2 = dist + x.se;
			if(d[x.fi] > d2)
			{
				d[x.fi] = d2;
				pq.push(mp(d2, x.fi));
			}
		}
	}
	return d;
}

ll dp[111111];
ll dp2[111111];
ll dist[111111];
ll dist2[111111];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m;
	int s,e,s2,e2; cin>>s>>e>>s2>>e2;
	s--; e--; s2--; e2--;
	for(int i=0;i<m;i++)
	{
		int u,v,c; cin>>u>>v>>c; u--; v--;
		adj[u].pb(mp(v,c)); adj[v].pb(mp(u,c));
	}
	vector<ll> d1 = dijkstra(s2);
	vector<ll> d2 = dijkstra(e2);
	ll ans = d1[e2];
	priority_queue<ii,vector<ii>,greater<ii> > pq;
	for(int i=0;i<n;i++) dist[i]=dist2[i]=dp[i]=dp2[i]=ll(1e18);
	dist[s] = 0; dp[s] = d2[s]; pq.push(mp(0,s));
	while(!pq.empty())
	{
		ll d=pq.top().fi; int u=pq.top().se; pq.pop(); ll pre = dp[u];
		for(ii x:adj[u])
		{
			ll dt = d + x.se; int v = x.fi;
			if(dist[v] > dt)
			{
				dp[v] = min(pre, d2[v]);
				dist[v] = dt;
				pq.push(mp(dt,v));
			}
			else if(dist[v] == dt)
			{
				dp[v] = min(dp[v], min(pre, d2[v]));
			}
		}
	}
	dist2[e] = 0; dp2[e] = d2[e]; pq.push(mp(0,e));
	while(!pq.empty())
	{
		ll d=pq.top().fi; int u=pq.top().se; pq.pop(); ll pre = dp2[u];
		for(ii x:adj[u])
		{
			ll dt = d + x.se; int v = x.fi;
			if(dist2[v] > dt)
			{
				dp2[v] = min(pre, d2[v]);
				dist2[v] = dt;
				pq.push(mp(dt,v));
			}
			else if(dist2[v] == dt)
			{
				dp2[v] = min(dp2[v], min(pre, d2[v]));
			}
		}
	}
	ll shortestori = dist[e];
	for(int i=0;i<n;i++)
	{
		if(dist[i]+dist2[i]==shortestori)
		{
			ans = min(ans, min(dp[i], dp2[i]) + d1[i]);
		}
	}
	cout<<ans<<'\n';
}
# Verdict Execution time Memory Grader output
1 Correct 454 ms 21192 KB Output is correct
2 Correct 512 ms 21192 KB Output is correct
3 Correct 438 ms 21192 KB Output is correct
4 Correct 450 ms 21192 KB Output is correct
5 Correct 471 ms 21192 KB Output is correct
6 Correct 495 ms 21668 KB Output is correct
7 Correct 543 ms 21668 KB Output is correct
8 Correct 512 ms 21668 KB Output is correct
9 Correct 504 ms 21668 KB Output is correct
10 Correct 454 ms 21668 KB Output is correct
11 Correct 197 ms 21668 KB Output is correct
12 Correct 483 ms 21668 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 487 ms 21668 KB Output is correct
2 Correct 513 ms 21668 KB Output is correct
3 Correct 524 ms 21668 KB Output is correct
4 Correct 457 ms 21668 KB Output is correct
5 Correct 460 ms 21668 KB Output is correct
6 Correct 413 ms 21668 KB Output is correct
7 Correct 454 ms 21668 KB Output is correct
8 Correct 459 ms 21668 KB Output is correct
9 Correct 460 ms 21668 KB Output is correct
10 Correct 464 ms 21668 KB Output is correct
11 Correct 114 ms 21668 KB Output is correct
12 Correct 417 ms 21668 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 21668 KB Output is correct
2 Correct 4 ms 21668 KB Output is correct
3 Correct 4 ms 21668 KB Output is correct
4 Correct 21 ms 21668 KB Output is correct
5 Correct 14 ms 21668 KB Output is correct
6 Correct 4 ms 21668 KB Output is correct
7 Correct 5 ms 21668 KB Output is correct
8 Correct 6 ms 21668 KB Output is correct
9 Correct 4 ms 21668 KB Output is correct
10 Correct 14 ms 21668 KB Output is correct
11 Correct 4 ms 21668 KB Output is correct
12 Correct 4 ms 21668 KB Output is correct
13 Correct 4 ms 21668 KB Output is correct
14 Correct 5 ms 21668 KB Output is correct
15 Correct 4 ms 21668 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 454 ms 21192 KB Output is correct
2 Correct 512 ms 21192 KB Output is correct
3 Correct 438 ms 21192 KB Output is correct
4 Correct 450 ms 21192 KB Output is correct
5 Correct 471 ms 21192 KB Output is correct
6 Correct 495 ms 21668 KB Output is correct
7 Correct 543 ms 21668 KB Output is correct
8 Correct 512 ms 21668 KB Output is correct
9 Correct 504 ms 21668 KB Output is correct
10 Correct 454 ms 21668 KB Output is correct
11 Correct 197 ms 21668 KB Output is correct
12 Correct 483 ms 21668 KB Output is correct
13 Correct 487 ms 21668 KB Output is correct
14 Correct 513 ms 21668 KB Output is correct
15 Correct 524 ms 21668 KB Output is correct
16 Correct 457 ms 21668 KB Output is correct
17 Correct 460 ms 21668 KB Output is correct
18 Correct 413 ms 21668 KB Output is correct
19 Correct 454 ms 21668 KB Output is correct
20 Correct 459 ms 21668 KB Output is correct
21 Correct 460 ms 21668 KB Output is correct
22 Correct 464 ms 21668 KB Output is correct
23 Correct 114 ms 21668 KB Output is correct
24 Correct 417 ms 21668 KB Output is correct
25 Correct 14 ms 21668 KB Output is correct
26 Correct 4 ms 21668 KB Output is correct
27 Correct 4 ms 21668 KB Output is correct
28 Correct 21 ms 21668 KB Output is correct
29 Correct 14 ms 21668 KB Output is correct
30 Correct 4 ms 21668 KB Output is correct
31 Correct 5 ms 21668 KB Output is correct
32 Correct 6 ms 21668 KB Output is correct
33 Correct 4 ms 21668 KB Output is correct
34 Correct 14 ms 21668 KB Output is correct
35 Correct 4 ms 21668 KB Output is correct
36 Correct 4 ms 21668 KB Output is correct
37 Correct 4 ms 21668 KB Output is correct
38 Correct 5 ms 21668 KB Output is correct
39 Correct 4 ms 21668 KB Output is correct
40 Correct 401 ms 21668 KB Output is correct
41 Correct 385 ms 21668 KB Output is correct
42 Correct 440 ms 21668 KB Output is correct
43 Correct 150 ms 21668 KB Output is correct
44 Correct 193 ms 21668 KB Output is correct
45 Correct 433 ms 21668 KB Output is correct
46 Correct 372 ms 21668 KB Output is correct
47 Correct 422 ms 21668 KB Output is correct
48 Correct 166 ms 21668 KB Output is correct
49 Correct 337 ms 21668 KB Output is correct
50 Correct 395 ms 21668 KB Output is correct
51 Correct 356 ms 21668 KB Output is correct