oj.uz

Submission #866105

# Submission time Handle Problem Language Result Execution time Memory
866105 2023-10-25T12:24:47 Z 20163070 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 375 ms 30052 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int inf=1e15,N=2e5+10;

struct heap
{
	int node;
	int len;
	bool operator < (const heap&x)const
	{
		return x.len<len;
	}
};

priority_queue<heap> q;

struct Edge
{
	int to,next,len;
}edge[N<<1];

int num,head[N],vis[N],n,m,s,t,u,v;
int du[N],dv[N],ds[N],dt[N],f[N],g[N],ans;

void add(int x,int y,int z)
{
	edge[++num]=(Edge){y,head[x],z},head[x]=num;
}

void dijk(int st,int *dis)
{
	for(int i=1;i<=n;i++)
	{
		vis[i]=0;
		dis[i]=inf;
	}
	dis[st]=0;
	q.push((heap){st,0});
	while(q.size())
	{
		int u=q.top().node;
		q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(int i=head[u];i;i=edge[i].next)
		{
			int v=edge[i].to;
			if(dis[v]>dis[u]+edge[i].len)
			{
				dis[v]=dis[u]+edge[i].len;
				if(!vis[v]) q.push((heap){v,dis[v]});
			}
		}
	}
}

void dfs(int u)
{
	if(vis[u]) return;
	vis[u]=1;
	f[u]=dv[u],g[u]=du[u];
	for(int i=head[u];i;i=edge[i].next)
	{
		int v=edge[i].to;
		if(ds[u]+dt[v]+edge[i].len>ds[t]) continue;
		dfs(v);
		f[u]=min(f[u],f[v]);
		g[u]=min(g[u],g[v]);
	}
	ans=min(ans,min(f[u]+du[u],g[u]+dv[u]));
}

signed main()
{
	cin>>n>>m;
	cin>>s>>t>>u>>v;
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		cin>>x>>y>>z;
		add(x,y,z),add(y,x,z);
	}
	dijk(s,ds);
	dijk(t,dt);
	dijk(u,du);
	dijk(v,dv);
	ans=du[v];
	for(int i=1;i<=n;i++) vis[i]=0;
	dfs(s);
	cout<<ans;
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 25732 KB Output is correct
2 Correct 238 ms 25792 KB Output is correct
3 Correct 259 ms 29956 KB Output is correct
4 Correct 334 ms 25760 KB Output is correct
5 Correct 323 ms 25288 KB Output is correct
6 Correct 247 ms 26056 KB Output is correct
7 Correct 305 ms 25636 KB Output is correct
8 Correct 234 ms 25608 KB Output is correct
9 Correct 324 ms 26108 KB Output is correct
10 Correct 306 ms 26096 KB Output is correct
11 Correct 91 ms 22168 KB Output is correct
12 Correct 360 ms 25844 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 27524 KB Output is correct
2 Correct 274 ms 27528 KB Output is correct
3 Correct 258 ms 27368 KB Output is correct
4 Correct 295 ms 27176 KB Output is correct
5 Correct 259 ms 27640 KB Output is correct
6 Correct 312 ms 29388 KB Output is correct
7 Correct 268 ms 29640 KB Output is correct
8 Correct 256 ms 27332 KB Output is correct
9 Correct 305 ms 27620 KB Output is correct
10 Correct 255 ms 27104 KB Output is correct
11 Correct 96 ms 23744 KB Output is correct
12 Correct 263 ms 30052 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12376 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 32 ms 15300 KB Output is correct
5 Correct 16 ms 11868 KB Output is correct
6 Correct 2 ms 10584 KB Output is correct
7 Correct 4 ms 10840 KB Output is correct
8 Correct 4 ms 11100 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 20 ms 11976 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10732 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 25732 KB Output is correct
2 Correct 238 ms 25792 KB Output is correct
3 Correct 259 ms 29956 KB Output is correct
4 Correct 334 ms 25760 KB Output is correct
5 Correct 323 ms 25288 KB Output is correct
6 Correct 247 ms 26056 KB Output is correct
7 Correct 305 ms 25636 KB Output is correct
8 Correct 234 ms 25608 KB Output is correct
9 Correct 324 ms 26108 KB Output is correct
10 Correct 306 ms 26096 KB Output is correct
11 Correct 91 ms 22168 KB Output is correct
12 Correct 360 ms 25844 KB Output is correct
13 Correct 287 ms 27524 KB Output is correct
14 Correct 274 ms 27528 KB Output is correct
15 Correct 258 ms 27368 KB Output is correct
16 Correct 295 ms 27176 KB Output is correct
17 Correct 259 ms 27640 KB Output is correct
18 Correct 312 ms 29388 KB Output is correct
19 Correct 268 ms 29640 KB Output is correct
20 Correct 256 ms 27332 KB Output is correct
21 Correct 305 ms 27620 KB Output is correct
22 Correct 255 ms 27104 KB Output is correct
23 Correct 96 ms 23744 KB Output is correct
24 Correct 263 ms 30052 KB Output is correct
25 Correct 19 ms 12376 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 32 ms 15300 KB Output is correct
29 Correct 16 ms 11868 KB Output is correct
30 Correct 2 ms 10584 KB Output is correct
31 Correct 4 ms 10840 KB Output is correct
32 Correct 4 ms 11100 KB Output is correct
33 Correct 3 ms 10588 KB Output is correct
34 Correct 20 ms 11976 KB Output is correct
35 Correct 2 ms 10588 KB Output is correct
36 Correct 2 ms 10732 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 2 ms 10588 KB Output is correct
39 Correct 3 ms 10588 KB Output is correct
40 Correct 257 ms 26560 KB Output is correct
41 Correct 292 ms 26040 KB Output is correct
42 Correct 259 ms 26048 KB Output is correct
43 Correct 97 ms 22864 KB Output is correct
44 Correct 92 ms 22928 KB Output is correct
45 Correct 266 ms 24988 KB Output is correct
46 Correct 215 ms 24704 KB Output is correct
47 Correct 303 ms 25792 KB Output is correct
48 Correct 90 ms 20304 KB Output is correct
49 Correct 270 ms 26368 KB Output is correct
50 Correct 234 ms 25280 KB Output is correct
51 Correct 276 ms 25172 KB Output is correct