Submission #976356

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
976356	2024-05-06T13:18:25 Z	LmaoLmao	Commuter Pass (JOI18_commuter_pass)	C++14	31 / 100	310 ms	27896 KB

commuter_pass

#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];
vector<ii> adj[100001];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n,m,s,t,u,v;
	cin >> n >> m;
	cin >> s >> t;
	cin >> u >> v;
	for(int i=0;i<m;i++) {
		int 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;
		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;
			d[cur[1]][1]=min(d[cur[1]][1],d[cur[1]][0]);
			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(d[v][1],d[v][0]);
    return 0;
}

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	247 ms	26888 KB	Output is correct
2	Correct	217 ms	23024 KB	Output is correct
3	Correct	214 ms	23236 KB	Output is correct
4	Correct	255 ms	23444 KB	Output is correct
5	Correct	222 ms	22720 KB	Output is correct
6	Correct	273 ms	27896 KB	Output is correct
7	Correct	283 ms	23872 KB	Output is correct
8	Correct	229 ms	22740 KB	Output is correct
9	Correct	244 ms	25176 KB	Output is correct
10	Correct	233 ms	23896 KB	Output is correct
11	Correct	68 ms	14804 KB	Output is correct
12	Correct	219 ms	24268 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	286 ms	22988 KB	Output is correct
2	Correct	268 ms	22820 KB	Output is correct
3	Correct	310 ms	22836 KB	Output is correct
4	Correct	257 ms	22812 KB	Output is correct
5	Correct	284 ms	22976 KB	Output is correct
6	Correct	231 ms	23088 KB	Output is correct
7	Correct	269 ms	24004 KB	Output is correct
8	Correct	278 ms	22916 KB	Output is correct
9	Correct	257 ms	22980 KB	Output is correct
10	Correct	248 ms	22984 KB	Output is correct
11	Correct	67 ms	14792 KB	Output is correct
12	Correct	218 ms	23240 KB	Output is correct

Subtask #3

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	6492 KB	Output is correct
2	Correct	1 ms	4700 KB	Output is correct
3	Correct	1 ms	4700 KB	Output is correct
4	Correct	12 ms	8028 KB	Output is correct
5	Correct	6 ms	6492 KB	Output is correct
6	Correct	2 ms	4700 KB	Output is correct
7	Incorrect	2 ms	4956 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #4

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	247 ms	26888 KB	Output is correct
2	Correct	217 ms	23024 KB	Output is correct
3	Correct	214 ms	23236 KB	Output is correct
4	Correct	255 ms	23444 KB	Output is correct
5	Correct	222 ms	22720 KB	Output is correct
6	Correct	273 ms	27896 KB	Output is correct
7	Correct	283 ms	23872 KB	Output is correct
8	Correct	229 ms	22740 KB	Output is correct
9	Correct	244 ms	25176 KB	Output is correct
10	Correct	233 ms	23896 KB	Output is correct
11	Correct	68 ms	14804 KB	Output is correct
12	Correct	219 ms	24268 KB	Output is correct
13	Correct	286 ms	22988 KB	Output is correct
14	Correct	268 ms	22820 KB	Output is correct
15	Correct	310 ms	22836 KB	Output is correct
16	Correct	257 ms	22812 KB	Output is correct
17	Correct	284 ms	22976 KB	Output is correct
18	Correct	231 ms	23088 KB	Output is correct
19	Correct	269 ms	24004 KB	Output is correct
20	Correct	278 ms	22916 KB	Output is correct
21	Correct	257 ms	22980 KB	Output is correct
22	Correct	248 ms	22984 KB	Output is correct
23	Correct	67 ms	14792 KB	Output is correct
24	Correct	218 ms	23240 KB	Output is correct
25	Correct	7 ms	6492 KB	Output is correct
26	Correct	1 ms	4700 KB	Output is correct
27	Correct	1 ms	4700 KB	Output is correct
28	Correct	12 ms	8028 KB	Output is correct
29	Correct	6 ms	6492 KB	Output is correct
30	Correct	2 ms	4700 KB	Output is correct
31	Incorrect	2 ms	4956 KB	Output isn't correct
32	Halted	0 ms	0 KB	-