oj.uz

Submission #48436

# Submission time Handle Problem Language Result Execution time Memory
48436 2018-05-13T12:10:28 Z aleksami Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 548 ms 75916 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define MAXN 100005
#define INF 1000000000000000
typedef pair<ll,ll> pii;
vector <pii> g[MAXN];
bool gotov[MAXN];
priority_queue <pii> pq;
int n,m;

void dijkstra(ll *d,int source)
{
	for(int i = 0; i < MAXN; i++)d[i]=INF,gotov[i]=false;
	d[source]=0;
	pq.push({-d[source],source});
	while(!pq.empty())
	{
		int v = pq.top().second;
		pq.pop();
		if(gotov[v])continue;
		gotov[v]=1;
		for(auto x:g[v])
		{
			int u = x.first;
			int c = x.second;
			if(d[u]>d[v]+c)d[u]=d[v]+c,pq.push({-d[u],u});
		}
	}
}
ll ds[MAXN];
ll dt[MAXN];
ll du[MAXN];
ll dv[MAXN];
ll d1[MAXN];
ll d2[MAXN];
int s,t;

void dijkstraa(ll *d,ll *dd)
{
	for(int i = 0; i < MAXN; i++)gotov[i]=false,dd[i]=d[i],pq.push({-dd[i],i});
	while(!pq.empty())
	{
		int v = pq.top().second;
		pq.pop();
		if(gotov[v])continue;
		gotov[v]=1;
		for(auto x:g[v])
		{
			int u = x.first;
			int c = x.second;
			if( ds[u]+c+dt[v]==ds[t] && dd[u]>dd[v])dd[u]=dd[v],pq.push({-dd[u],u});
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	int u,v;
	cin >> n >> m >> s >> t >> u >> v;
	for(int i = 0; i < m; i++)
	{
		int x,y,c;
		cin >> x >> y >> c;
		g[x].push_back({y,c});
		g[y].push_back({x,c});
	}
	dijkstra(ds,s);
	dijkstra(dt,t);
	dijkstra(du,u);
	dijkstra(dv,v);
	dijkstraa(dv,d1);
	dijkstraa(du,d2);
	ll ans = INF;
	for(int i = 1; i <= n; i++)
	{
		ans=min(ans,du[i]+d1[i]);
		ans=min(ans,dv[i]+d2[i]);
	}
	cout << ans;
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 19620 KB Output is correct
2 Correct 490 ms 19772 KB Output is correct
3 Correct 498 ms 19896 KB Output is correct
4 Correct 475 ms 19896 KB Output is correct
5 Correct 477 ms 19896 KB Output is correct
6 Correct 504 ms 19896 KB Output is correct
7 Correct 497 ms 19896 KB Output is correct
8 Correct 516 ms 19896 KB Output is correct
9 Correct 473 ms 19896 KB Output is correct
10 Correct 438 ms 24356 KB Output is correct
11 Correct 264 ms 24356 KB Output is correct
12 Correct 501 ms 30692 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 519 ms 30692 KB Output is correct
2 Correct 506 ms 30692 KB Output is correct
3 Correct 532 ms 30692 KB Output is correct
4 Correct 514 ms 30720 KB Output is correct
5 Correct 527 ms 30720 KB Output is correct
6 Correct 516 ms 30720 KB Output is correct
7 Correct 548 ms 30720 KB Output is correct
8 Correct 532 ms 30744 KB Output is correct
9 Correct 521 ms 30772 KB Output is correct
10 Correct 509 ms 30808 KB Output is correct
11 Correct 250 ms 30808 KB Output is correct
12 Correct 503 ms 34628 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 34628 KB Output is correct
2 Correct 36 ms 34628 KB Output is correct
3 Correct 36 ms 34628 KB Output is correct
4 Correct 55 ms 34628 KB Output is correct
5 Correct 46 ms 34628 KB Output is correct
6 Correct 37 ms 34628 KB Output is correct
7 Correct 38 ms 34628 KB Output is correct
8 Correct 42 ms 34628 KB Output is correct
9 Correct 39 ms 34628 KB Output is correct
10 Correct 46 ms 34628 KB Output is correct
11 Correct 36 ms 34628 KB Output is correct
12 Correct 36 ms 34628 KB Output is correct
13 Correct 36 ms 34628 KB Output is correct
14 Correct 36 ms 34628 KB Output is correct
15 Correct 36 ms 34628 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 19620 KB Output is correct
2 Correct 490 ms 19772 KB Output is correct
3 Correct 498 ms 19896 KB Output is correct
4 Correct 475 ms 19896 KB Output is correct
5 Correct 477 ms 19896 KB Output is correct
6 Correct 504 ms 19896 KB Output is correct
7 Correct 497 ms 19896 KB Output is correct
8 Correct 516 ms 19896 KB Output is correct
9 Correct 473 ms 19896 KB Output is correct
10 Correct 438 ms 24356 KB Output is correct
11 Correct 264 ms 24356 KB Output is correct
12 Correct 501 ms 30692 KB Output is correct
13 Correct 519 ms 30692 KB Output is correct
14 Correct 506 ms 30692 KB Output is correct
15 Correct 532 ms 30692 KB Output is correct
16 Correct 514 ms 30720 KB Output is correct
17 Correct 527 ms 30720 KB Output is correct
18 Correct 516 ms 30720 KB Output is correct
19 Correct 548 ms 30720 KB Output is correct
20 Correct 532 ms 30744 KB Output is correct
21 Correct 521 ms 30772 KB Output is correct
22 Correct 509 ms 30808 KB Output is correct
23 Correct 250 ms 30808 KB Output is correct
24 Correct 503 ms 34628 KB Output is correct
25 Correct 45 ms 34628 KB Output is correct
26 Correct 36 ms 34628 KB Output is correct
27 Correct 36 ms 34628 KB Output is correct
28 Correct 55 ms 34628 KB Output is correct
29 Correct 46 ms 34628 KB Output is correct
30 Correct 37 ms 34628 KB Output is correct
31 Correct 38 ms 34628 KB Output is correct
32 Correct 42 ms 34628 KB Output is correct
33 Correct 39 ms 34628 KB Output is correct
34 Correct 46 ms 34628 KB Output is correct
35 Correct 36 ms 34628 KB Output is correct
36 Correct 36 ms 34628 KB Output is correct
37 Correct 36 ms 34628 KB Output is correct
38 Correct 36 ms 34628 KB Output is correct
39 Correct 36 ms 34628 KB Output is correct
40 Correct 461 ms 39476 KB Output is correct
41 Correct 479 ms 44720 KB Output is correct
42 Correct 474 ms 49048 KB Output is correct
43 Correct 243 ms 49048 KB Output is correct
44 Correct 253 ms 49048 KB Output is correct
45 Correct 485 ms 56708 KB Output is correct
46 Correct 483 ms 59884 KB Output is correct
47 Correct 489 ms 63820 KB Output is correct
48 Correct 303 ms 63820 KB Output is correct
49 Correct 419 ms 68224 KB Output is correct
50 Correct 478 ms 72600 KB Output is correct
51 Correct 441 ms 75916 KB Output is correct