oj.uz

Submission #976390

# Submission time Handle Problem Language Result Execution time Memory
976390 2024-05-06T13:56:17 Z LmaoLmao Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 399 ms 29736 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;

using ll = long long;
using ii = pair<ll, ll>;
using aa= array<ll,3>; 

const int N = 1e6+5;
const int INF = 1e9;

ll sr[100001][2];
ll d[100001][2]; 
ll D[100001][2]; 
vector<ii> adj[100001];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n,m,s,t,u,v;
	cin >> n >> m;
	cin >> s >> t;
	cin >> u >> v;
	for(int i=0;i<m;i++) {
		ll a,b,c;
		cin >> a >> b >> c;
		adj[a].push_back({b,c});
		adj[b].push_back({a,c});
	}
	for(int i=1;i<=n;i++) {
		d[i][0]=(ll)1e15;
		d[i][1]=(ll)1e15;
		D[i][0]=(ll)1e15;
		D[i][1]=(ll)1e15;
		sr[i][0]=(ll)1e15;
		sr[i][1]=(ll)1e15;
	}
	priority_queue<aa,vector<aa>,greater<aa>> q;
	q.push({0,s,0});
	q.push({0,t,1});
	sr[s][0]=0;
	sr[t][1]=0;
	while(!q.empty()) {
		aa cur=q.top();
		q.pop();
		if(cur[0]>sr[cur[1]][cur[2]]) continue;
		for(ii to:adj[cur[1]]) {
			if(sr[to.fi][cur[2]]>sr[cur[1]][cur[2]]+to.se) {
				sr[to.fi][cur[2]]=sr[cur[1]][cur[2]]+to.se;
				q.push({sr[to.fi][cur[2]],to.fi,cur[2]});	
			}
		}
	}
	q.push({0,u,0});
	ll l=sr[t][0];
	d[u][0]=0;
	while(!q.empty()) {
		aa cur=q.top();
		q.pop();
		if(cur[0]>d[cur[1]][cur[2]]) continue;
		if(sr[cur[1]][0]+sr[cur[1]][1]==l && cur[2]==0) {
			queue<int> bfs;
			if(d[cur[1]][1]>d[cur[1]][0]) {
				d[cur[1]][1]=d[cur[1]][0];
				q.push({d[cur[1]][1],cur[1],1});
			}
			for(ii to:adj[cur[1]]) {
				if(sr[to.fi][0]+to.se==sr[cur[1]][0] && d[to.fi][1]>cur[0]) {
					d[to.fi][1]=cur[0];
					bfs.push(to.fi);
					q.push({d[to.fi][1],to.fi,1}); 
				}
			}
			while(!bfs.empty()) {
				int k=bfs.front();
				bfs.pop();
				for(ii to:adj[k]) {
					if(sr[to.fi][0]+to.se==sr[k][0] && d[to.fi][1]>d[k][1]) {
						d[to.fi][1]=d[k][1];
						bfs.push(to.fi);
						q.push({d[to.fi][1],to.fi,1}); 
					}
				}
			}
			for(ii to:adj[cur[1]]) {
				if(sr[to.fi][1]+to.se==sr[cur[1]][1] && d[to.fi][1]>cur[0]) {
					d[to.fi][1]=cur[0];
					bfs.push(to.fi);
					q.push({d[to.fi][1],to.fi,1}); 
				}
			}
			while(!bfs.empty()) {
				int k=bfs.front();
				bfs.pop();
				for(ii to:adj[k]) {
					if(sr[to.fi][1]+to.se==sr[k][1] && d[to.fi][1]>d[k][1]) {
						d[to.fi][1]=d[k][1];
						bfs.push(to.fi);
						q.push({d[to.fi][1],to.fi,1}); 
					}
				}
			}
		}
		for(ii to:adj[cur[1]]) {
			if(d[to.fi][cur[2]]>d[cur[1]][cur[2]]+to.se) {
				d[to.fi][cur[2]]=d[cur[1]][cur[2]]+to.se;
				q.push({d[to.fi][cur[2]],to.fi,cur[2]});	
			}
		}
	}
	q.push({0,v,0});
	D[v][0]=0;
	while(!q.empty()) {
		aa cur=q.top();
		q.pop();
		if(cur[0]>D[cur[1]][cur[2]]) continue;
		if(sr[cur[1]][0]+sr[cur[1]][1]==l && cur[2]==0) {
			queue<int> bfs;
			if(D[cur[1]][1]>D[cur[1]][0]) {
				D[cur[1]][1]=D[cur[1]][0];
				q.push({D[cur[1]][1],cur[1],1});
			}
			for(ii to:adj[cur[1]]) {
				if(sr[to.fi][0]+to.se==sr[cur[1]][0] && D[to.fi][1]>cur[0]) {
					D[to.fi][1]=cur[0];
					bfs.push(to.fi);
					q.push({D[to.fi][1],to.fi,1}); 
				}
			}
			while(!bfs.empty()) {
				int k=bfs.front();
				bfs.pop();
				for(ii to:adj[k]) {
					if(sr[to.fi][0]+to.se==sr[k][0] && D[to.fi][1]>D[k][1]) {
						D[to.fi][1]=D[k][1];
						bfs.push(to.fi);
						q.push({D[to.fi][1],to.fi,1}); 
					}
				}
			}
			for(ii to:adj[cur[1]]) {
				if(sr[to.fi][1]+to.se==sr[cur[1]][1] && D[to.fi][1]>cur[0]) {
					D[to.fi][1]=cur[0];
					bfs.push(to.fi);
					q.push({D[to.fi][1],to.fi,1}); 
				}
			}
			while(!bfs.empty()) {
				int k=bfs.front();
				bfs.pop();
				for(ii to:adj[k]) {
					if(sr[to.fi][1]+to.se==sr[k][1] && D[to.fi][1]>D[k][1]) {
						D[to.fi][1]=D[k][1];
						bfs.push(to.fi);
						q.push({D[to.fi][1],to.fi,1}); 
					}
				}
			}
		}
		for(ii to:adj[cur[1]]) {
			if(D[to.fi][cur[2]]>D[cur[1]][cur[2]]+to.se) {
				D[to.fi][cur[2]]=D[cur[1]][cur[2]]+to.se;
				q.push({D[to.fi][cur[2]],to.fi,cur[2]});	
			}
		}
	}
	cout << min(min(d[v][1],d[v][0]),min(D[u][1],D[u][0]));
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 25232 KB Output is correct
2 Correct 318 ms 21988 KB Output is correct
3 Correct 360 ms 20860 KB Output is correct
4 Correct 278 ms 25268 KB Output is correct
5 Correct 298 ms 22468 KB Output is correct
6 Correct 297 ms 24764 KB Output is correct
7 Correct 362 ms 20820 KB Output is correct
8 Correct 322 ms 21956 KB Output is correct
9 Correct 299 ms 21616 KB Output is correct
10 Correct 241 ms 22212 KB Output is correct
11 Correct 87 ms 14280 KB Output is correct
12 Correct 328 ms 21080 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 21960 KB Output is correct
2 Correct 352 ms 21016 KB Output is correct
3 Correct 334 ms 21660 KB Output is correct
4 Correct 336 ms 20932 KB Output is correct
5 Correct 344 ms 20888 KB Output is correct
6 Correct 302 ms 20944 KB Output is correct
7 Correct 361 ms 22632 KB Output is correct
8 Correct 399 ms 20940 KB Output is correct
9 Correct 361 ms 20932 KB Output is correct
10 Correct 344 ms 21096 KB Output is correct
11 Correct 106 ms 14236 KB Output is correct
12 Correct 371 ms 20960 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8024 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 11 ms 9560 KB Output is correct
5 Correct 8 ms 8028 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 3 ms 7004 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 25232 KB Output is correct
2 Correct 318 ms 21988 KB Output is correct
3 Correct 360 ms 20860 KB Output is correct
4 Correct 278 ms 25268 KB Output is correct
5 Correct 298 ms 22468 KB Output is correct
6 Correct 297 ms 24764 KB Output is correct
7 Correct 362 ms 20820 KB Output is correct
8 Correct 322 ms 21956 KB Output is correct
9 Correct 299 ms 21616 KB Output is correct
10 Correct 241 ms 22212 KB Output is correct
11 Correct 87 ms 14280 KB Output is correct
12 Correct 328 ms 21080 KB Output is correct
13 Correct 312 ms 21960 KB Output is correct
14 Correct 352 ms 21016 KB Output is correct
15 Correct 334 ms 21660 KB Output is correct
16 Correct 336 ms 20932 KB Output is correct
17 Correct 344 ms 20888 KB Output is correct
18 Correct 302 ms 20944 KB Output is correct
19 Correct 361 ms 22632 KB Output is correct
20 Correct 399 ms 20940 KB Output is correct
21 Correct 361 ms 20932 KB Output is correct
22 Correct 344 ms 21096 KB Output is correct
23 Correct 106 ms 14236 KB Output is correct
24 Correct 371 ms 20960 KB Output is correct
25 Correct 7 ms 8024 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 11 ms 9560 KB Output is correct
29 Correct 8 ms 8028 KB Output is correct
30 Correct 2 ms 6748 KB Output is correct
31 Correct 2 ms 6748 KB Output is correct
32 Correct 3 ms 7004 KB Output is correct
33 Correct 3 ms 6744 KB Output is correct
34 Correct 7 ms 8540 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 2 ms 6748 KB Output is correct
40 Correct 308 ms 29164 KB Output is correct
41 Correct 326 ms 25028 KB Output is correct
42 Correct 309 ms 25744 KB Output is correct
43 Correct 117 ms 16356 KB Output is correct
44 Correct 126 ms 16328 KB Output is correct
45 Correct 313 ms 25160 KB Output is correct
46 Correct 321 ms 25028 KB Output is correct
47 Correct 305 ms 25540 KB Output is correct
48 Correct 166 ms 15820 KB Output is correct
49 Correct 219 ms 29736 KB Output is correct
50 Correct 322 ms 25624 KB Output is correct
51 Correct 260 ms 25540 KB Output is correct