oj.uz

Submission #853427

# Submission time Handle Problem Language Result Execution time Memory
853427 2023-09-24T10:34:06 Z willychan Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 222 ms 15332 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds

const int N = 1e5+5;
vector<pair<int,int> > side[N];
int n,m;

void calc(int s,vector<ll> &dis){
	fill(dis.begin(),dis.end(),1e18);
	dis[s]=0;
	priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> >> pq;
	pq.push({0,s});
	while(pq.size()){
		auto cur = pq.top();
		pq.pop();
		if(dis[cur.second]!=cur.first) continue;
		for(auto i : side[cur.second]){
			if(dis[i.first]>dis[cur.second]+i.second){
				dis[i.first]=dis[cur.second]+i.second;
				pq.push({dis[i.first],i.first});
			}
		}
	}
}

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	int s,t;cin>>s>>t;
	int u,v;cin>>u>>v;
	for(int i=0;i<m;i++){
		int a,b,c;cin>>a>>b>>c;
		side[a].push_back({b,c});
		side[b].push_back({a,c});
	}
	vector<ll> diss(n+1);
	calc(s,diss);
	vector<ll> disu(n+1);
	calc(u,disu);
	vector<ll> dist(n+1);
	calc(t,dist);
	vector<ll> disv(n+1);
	calc(v,disv);
	vector<int> topo(n);
	for(int i=0;i<n;i++) topo[i]=i+1;
	sort(topo.begin(),topo.end(),[&](const int a,const int b){return diss[a]<diss[b];});
	ll ans = disu[v];
	vector<ll> ogdisu = disu;
	for(auto i:topo){
		if(diss[i]+dist[i]!=diss[t]) continue;
		for(auto e : side[i]){
			if(diss[e.first]+e.second==diss[i]){
				disu[i]	=min(disu[i],disu[e.first]);
			}
		}
		ans = min(ans,disu[i]+disv[i]);
	}
	for(auto i:topo){
		if(diss[i]+dist[i]!=diss[t]) continue;
		for(auto e : side[i]){
			if(diss[e.first]+e.second==diss[i]){
				disv[i]	=min(disv[i],disv[e.first]);
			}
		}
		ans = min(ans,disv[i]+ogdisu[i]);
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 15148 KB Output is correct
2 Correct 190 ms 14076 KB Output is correct
3 Correct 178 ms 14452 KB Output is correct
4 Correct 191 ms 15228 KB Output is correct
5 Correct 169 ms 14200 KB Output is correct
6 Correct 206 ms 15260 KB Output is correct
7 Correct 187 ms 14088 KB Output is correct
8 Correct 197 ms 13916 KB Output is correct
9 Correct 177 ms 14248 KB Output is correct
10 Correct 165 ms 13624 KB Output is correct
11 Correct 61 ms 10068 KB Output is correct
12 Correct 193 ms 13756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 14076 KB Output is correct
2 Correct 213 ms 14076 KB Output is correct
3 Correct 195 ms 13940 KB Output is correct
4 Correct 222 ms 13992 KB Output is correct
5 Correct 220 ms 14052 KB Output is correct
6 Correct 212 ms 13860 KB Output is correct
7 Correct 202 ms 14024 KB Output is correct
8 Correct 192 ms 13872 KB Output is correct
9 Correct 185 ms 14016 KB Output is correct
10 Correct 180 ms 14000 KB Output is correct
11 Correct 61 ms 10228 KB Output is correct
12 Correct 170 ms 13808 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3416 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 10 ms 4184 KB Output is correct
5 Correct 6 ms 3416 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 6 ms 3420 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 15148 KB Output is correct
2 Correct 190 ms 14076 KB Output is correct
3 Correct 178 ms 14452 KB Output is correct
4 Correct 191 ms 15228 KB Output is correct
5 Correct 169 ms 14200 KB Output is correct
6 Correct 206 ms 15260 KB Output is correct
7 Correct 187 ms 14088 KB Output is correct
8 Correct 197 ms 13916 KB Output is correct
9 Correct 177 ms 14248 KB Output is correct
10 Correct 165 ms 13624 KB Output is correct
11 Correct 61 ms 10068 KB Output is correct
12 Correct 193 ms 13756 KB Output is correct
13 Correct 215 ms 14076 KB Output is correct
14 Correct 213 ms 14076 KB Output is correct
15 Correct 195 ms 13940 KB Output is correct
16 Correct 222 ms 13992 KB Output is correct
17 Correct 220 ms 14052 KB Output is correct
18 Correct 212 ms 13860 KB Output is correct
19 Correct 202 ms 14024 KB Output is correct
20 Correct 192 ms 13872 KB Output is correct
21 Correct 185 ms 14016 KB Output is correct
22 Correct 180 ms 14000 KB Output is correct
23 Correct 61 ms 10228 KB Output is correct
24 Correct 170 ms 13808 KB Output is correct
25 Correct 6 ms 3416 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2648 KB Output is correct
28 Correct 10 ms 4184 KB Output is correct
29 Correct 6 ms 3416 KB Output is correct
30 Correct 2 ms 2648 KB Output is correct
31 Correct 2 ms 2904 KB Output is correct
32 Correct 3 ms 2908 KB Output is correct
33 Correct 1 ms 2648 KB Output is correct
34 Correct 6 ms 3420 KB Output is correct
35 Correct 1 ms 2648 KB Output is correct
36 Correct 1 ms 2648 KB Output is correct
37 Correct 1 ms 2648 KB Output is correct
38 Correct 1 ms 2648 KB Output is correct
39 Correct 1 ms 2648 KB Output is correct
40 Correct 179 ms 15268 KB Output is correct
41 Correct 181 ms 14064 KB Output is correct
42 Correct 192 ms 13956 KB Output is correct
43 Correct 63 ms 10064 KB Output is correct
44 Correct 61 ms 10060 KB Output is correct
45 Correct 197 ms 13328 KB Output is correct
46 Correct 148 ms 13472 KB Output is correct
47 Correct 169 ms 15236 KB Output is correct
48 Correct 82 ms 10068 KB Output is correct
49 Correct 159 ms 15332 KB Output is correct
50 Correct 153 ms 13788 KB Output is correct
51 Correct 148 ms 13492 KB Output is correct