oj.uz

Submission #501090

# Submission time Handle Problem Language Result Execution time Memory
501090 2022-01-02T10:55:48 Z codr0 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 990 ms 32396 KB 
// Code by Parsa Eslami

#include <bits/stdc++.h>
#define int long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORR(i,a,b) for(int i=a;i>=b;i--)
#define S second
#define F first
#define pb push_back
#define SZ(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define err(x) cout<<#x<<": "<<x<<'\n';

using namespace std;
typedef pair<int,int> pii;
const int N=1e5+4;
const int INF=1e15;
int valV[N],valU[N];
pii distS[N];
pii distT[N];
vector<int> adj[N];
vector<int> w[N];
int n,m;
int s,t,u,v;
	
	void FILLvalV(){
		FOR(i,1,n) valV[i]=INF;
		valV[v]=0;
		set<pii> st;
		FOR(i,1,n) st.insert({valV[i],i});
		while(!st.empty()){
			pii mn=*(st.begin());
			st.erase(mn);
			int o=mn.S;
			FOR(i,0,SZ(adj[o])-1){
				int p=adj[o][i];
				int wp=w[o][i];
				if((valV[o]+wp)<valV[p]){
					st.erase({valV[p],p});
					valV[p]=valV[o]+wp;
					st.insert({valV[p],p});
				}
			}
		}
	}

	void FILLvalU(){
		FOR(i,1,n) valU[i]=INF;
		valU[u]=0;
		set<pii> st;
		FOR(i,1,n) st.insert({valU[i],i});
		while(!st.empty()){
			pii mn=*(st.begin());
			st.erase(mn);
			int o=mn.S;
			FOR(i,0,SZ(adj[o])-1){
				int p=adj[o][i];
				int wp=w[o][i];
				if((valU[o]+wp)<valU[p]){
					st.erase({valU[p],p});
					valU[p]=valU[o]+wp;
					st.insert({valU[p],p});
				}
			}
		}
	}

	void FILLdistS(){
		FOR(i,1,n) distS[i]={INF,INF};
		distS[s]={0,valV[s]};
		set<pair<pii,int>> st;
		FOR(i,1,n) st.insert({distS[i],i});
		while(!st.empty()){
			pair<pii,int> x0=*(st.begin());
			st.erase(x0);
			int o=x0.S;
			FOR(i,0,SZ(adj[o])-1){
				int p=adj[o][i];
				int wp=w[o][i];
				pii nwp={wp+distS[o].F,min(distS[o].S,valV[p])};
				if(nwp<distS[p]){
					st.erase({distS[p],p});
					distS[p]=nwp;
					st.insert({distS[p],p});
				}
			}
		}
	}

	void FILLdistT(){
		FOR(i,1,n) distT[i]={INF,INF};
		distT[t]={0,valV[t]};
		set<pair<pii,int>> st;
		FOR(i,1,n) st.insert({distT[i],i});
		while(!st.empty()){
			pair<pii,int> x0=*(st.begin());
			st.erase(x0);
			int o=x0.S;
			FOR(i,0,SZ(adj[o])-1){
				int p=adj[o][i];
				int wp=w[o][i];
				pii nwp={wp+distT[o].F,min(distT[o].S,valV[p])};
				if(nwp<distT[p]){
					st.erase({distT[p],p});
					distT[p]=nwp;
					st.insert({distT[p],p});
				}
			}
		}
	}

	int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m>>s>>t>>u>>v;
	FOR(i,1,m){
		int U,V,W; cin>>U>>V>>W;
		adj[U].pb(V);
		w[U].pb(W);
		adj[V].pb(U);
		w[V].pb(W);
	}
	FILLvalV();
	FILLvalU();
	FILLdistS();
	FILLdistT();
	int ans=valV[u];
	int r=distS[t].F;
	FOR(i,1,n){
		if((distS[i].F+distT[i].F)==r){
			ans=min(ans,valU[i]+min(distS[i].S,distT[i].S));
		}
	}
	cout<<ans<<'\n';
	
	return 0;
    }

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 927 ms 31836 KB Output is correct
2 Correct 868 ms 31412 KB Output is correct
3 Correct 850 ms 31728 KB Output is correct
4 Correct 907 ms 31728 KB Output is correct
5 Correct 793 ms 31492 KB Output is correct
6 Correct 939 ms 31808 KB Output is correct
7 Correct 837 ms 31356 KB Output is correct
8 Correct 821 ms 31428 KB Output is correct
9 Correct 842 ms 32232 KB Output is correct
10 Correct 696 ms 32396 KB Output is correct
11 Correct 471 ms 24364 KB Output is correct
12 Correct 861 ms 32204 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 881 ms 31676 KB Output is correct
2 Correct 877 ms 31524 KB Output is correct
3 Correct 877 ms 31476 KB Output is correct
4 Correct 862 ms 31420 KB Output is correct
5 Correct 892 ms 31436 KB Output is correct
6 Correct 781 ms 31696 KB Output is correct
7 Correct 860 ms 31560 KB Output is correct
8 Correct 939 ms 31496 KB Output is correct
9 Correct 888 ms 31444 KB Output is correct
10 Correct 990 ms 31480 KB Output is correct
11 Correct 486 ms 24228 KB Output is correct
12 Correct 884 ms 31736 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6724 KB Output is correct
2 Correct 3 ms 5104 KB Output is correct
3 Correct 3 ms 5016 KB Output is correct
4 Correct 17 ms 8428 KB Output is correct
5 Correct 11 ms 6716 KB Output is correct
6 Correct 4 ms 5164 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5268 KB Output is correct
9 Correct 5 ms 5164 KB Output is correct
10 Correct 10 ms 6736 KB Output is correct
11 Correct 4 ms 5020 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 4 ms 5072 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 927 ms 31836 KB Output is correct
2 Correct 868 ms 31412 KB Output is correct
3 Correct 850 ms 31728 KB Output is correct
4 Correct 907 ms 31728 KB Output is correct
5 Correct 793 ms 31492 KB Output is correct
6 Correct 939 ms 31808 KB Output is correct
7 Correct 837 ms 31356 KB Output is correct
8 Correct 821 ms 31428 KB Output is correct
9 Correct 842 ms 32232 KB Output is correct
10 Correct 696 ms 32396 KB Output is correct
11 Correct 471 ms 24364 KB Output is correct
12 Correct 861 ms 32204 KB Output is correct
13 Correct 881 ms 31676 KB Output is correct
14 Correct 877 ms 31524 KB Output is correct
15 Correct 877 ms 31476 KB Output is correct
16 Correct 862 ms 31420 KB Output is correct
17 Correct 892 ms 31436 KB Output is correct
18 Correct 781 ms 31696 KB Output is correct
19 Correct 860 ms 31560 KB Output is correct
20 Correct 939 ms 31496 KB Output is correct
21 Correct 888 ms 31444 KB Output is correct
22 Correct 990 ms 31480 KB Output is correct
23 Correct 486 ms 24228 KB Output is correct
24 Correct 884 ms 31736 KB Output is correct
25 Correct 11 ms 6724 KB Output is correct
26 Correct 3 ms 5104 KB Output is correct
27 Correct 3 ms 5016 KB Output is correct
28 Correct 17 ms 8428 KB Output is correct
29 Correct 11 ms 6716 KB Output is correct
30 Correct 4 ms 5164 KB Output is correct
31 Correct 5 ms 5196 KB Output is correct
32 Correct 5 ms 5268 KB Output is correct
33 Correct 5 ms 5164 KB Output is correct
34 Correct 10 ms 6736 KB Output is correct
35 Correct 4 ms 5020 KB Output is correct
36 Correct 3 ms 5068 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 4 ms 5068 KB Output is correct
39 Correct 4 ms 5072 KB Output is correct
40 Correct 858 ms 31688 KB Output is correct
41 Correct 908 ms 32284 KB Output is correct
42 Correct 840 ms 32280 KB Output is correct
43 Correct 467 ms 24308 KB Output is correct
44 Correct 474 ms 24260 KB Output is correct
45 Correct 749 ms 31396 KB Output is correct
46 Correct 731 ms 31180 KB Output is correct
47 Correct 889 ms 31776 KB Output is correct
48 Correct 474 ms 23784 KB Output is correct
49 Correct 615 ms 31232 KB Output is correct
50 Correct 753 ms 31552 KB Output is correct
51 Correct 683 ms 31332 KB Output is correct