oj.uz

Submission #158867

# Submission time Handle Problem Language Result Execution time Memory
158867 2019-10-19T08:51:48 Z GioChkhaidze Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 873 ms 29416 KB 
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

const int N=2e5+5;

int n,m,S,T,U,V;
long long D[N][6],dp[N],fix[N];
vector < pair < long long  , int > > v[N];

void Dijkstra(int type) {
	multiset < pair < long long , int > > st;
	for (int i=1; i<=n; i++) 
		fix[i]=0,D[i][type]=1e17;
	
	if (!type) D[V][0]=0,st.insert({D[V][0],V});
		else 
	if (type==1) D[U][1]=0,st.insert({D[U][1],U});
		else
	if (type==2) D[S][2]=0,st.insert({D[S][2],S});
		else
	if (type==3) D[T][3]=0,st.insert({D[T][3],T});
	
	while (st.size()) {
		int x=(*st.begin()).S;
		st.erase(st.find(*st.begin()));
		
		if (fix[x]) continue;
		fix[x]=1;
		for (int i=0; i<v[x].size(); i++){
			long long to=v[x][i].F,dist=v[x][i].S;
			if (!fix[to] && D[x][type]+dist<D[to][type]) {
				D[to][type]=D[x][type]+dist;
				st.insert({D[to][type],to});
			}
		}
	}
}

void FillDp(int type) {
	multiset < pair < long long , int > > st;
	long long d[N];

	for (int i=1; i<=n; i++) 
		fix[i]=0,d[i]=1e17;
		
	if (!type) {
		d[T]=0,dp[T]=min(dp[T],D[T][0]);
		st.insert({d[T],T});
	}
		else {
		d[S]=0,dp[S]=min(dp[S],D[S][0]);
		st.insert({d[S],S});	
	}
	
	while (st.size()) {
		int x=(*st.begin()).S;
		st.erase(st.find(*st.begin()));
		
		if (fix[x]) continue;
		fix[x]=1;
		
		for (int i=0; i<v[x].size(); i++) {
			long long to=v[x][i].F,dist=v[x][i].S;
			if (D[to][2]+D[to][3]!=D[S][3]) continue;
			if (!fix[to] && d[x]+dist<=d[to]) {
				dp[to]=min(dp[to],min(dp[x],D[to][0]));
				d[to]=d[x]+dist;
				st.insert({d[to],to});
			}
		}
	}
}

main () {
	ios::sync_with_stdio(false);
	cin>>n>>m;
	cin>>S>>T;
	cin>>U>>V;
	
	for (int i=1; i<=m; i++) {
		int a,b,c;
		cin>>a>>b>>c;
		v[a].push_back({b,c});
		v[b].push_back({a,c});
	}
	
	Dijkstra(0);
	Dijkstra(1);
	Dijkstra(2);
	Dijkstra(3);
	
	long long ANS=D[V][1];
	
	for (int i=1; i<=n; i++) dp[i]=1e17;
		
	FillDp(0);
	
	for (int x=1; x<=n; x++) 
		if (D[x][2]+D[x][3]==D[S][3]) ANS=min(ANS,dp[x]+D[x][1]);
	
	for (int i=1; i<=n; i++) dp[i]=1e17;
	
	FillDp(1);
	
	for (int x=1; x<=n; x++) 
		if (D[x][2]+D[x][3]==D[S][3]) ANS=min(ANS,dp[x]+D[x][1]);
		

	cout<<ANS<<endl;
}

Compilation message

commuter_pass.cpp: In function 'void Dijkstra(int)':
commuter_pass.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<v[x].size(); i++){
                 ~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void FillDp(int)':
commuter_pass.cpp:64:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<v[x].size(); i++) {
                 ~^~~~~~~~~~~~
commuter_pass.cpp: At global scope:
commuter_pass.cpp:76:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 26488 KB Output is correct
2 Correct 574 ms 25976 KB Output is correct
3 Correct 605 ms 26464 KB Output is correct
4 Correct 633 ms 26488 KB Output is correct
5 Correct 597 ms 25472 KB Output is correct
6 Correct 609 ms 27000 KB Output is correct
7 Correct 573 ms 25948 KB Output is correct
8 Correct 625 ms 26232 KB Output is correct
9 Correct 578 ms 25336 KB Output is correct
10 Correct 461 ms 24656 KB Output is correct
11 Correct 206 ms 17272 KB Output is correct
12 Correct 549 ms 25328 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 26248 KB Output is correct
2 Correct 535 ms 25592 KB Output is correct
3 Correct 555 ms 25632 KB Output is correct
4 Correct 626 ms 25772 KB Output is correct
5 Correct 644 ms 25604 KB Output is correct
6 Correct 676 ms 26076 KB Output is correct
7 Correct 706 ms 25628 KB Output is correct
8 Correct 624 ms 25628 KB Output is correct
9 Correct 651 ms 25636 KB Output is correct
10 Correct 589 ms 25704 KB Output is correct
11 Correct 239 ms 17384 KB Output is correct
12 Correct 624 ms 26232 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 6648 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 27 ms 8440 KB Output is correct
5 Correct 17 ms 6776 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 8 ms 5188 KB Output is correct
8 Correct 9 ms 5368 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 19 ms 6776 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 8 ms 5116 KB Output is correct
14 Correct 7 ms 5240 KB Output is correct
15 Correct 7 ms 5240 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 26488 KB Output is correct
2 Correct 574 ms 25976 KB Output is correct
3 Correct 605 ms 26464 KB Output is correct
4 Correct 633 ms 26488 KB Output is correct
5 Correct 597 ms 25472 KB Output is correct
6 Correct 609 ms 27000 KB Output is correct
7 Correct 573 ms 25948 KB Output is correct
8 Correct 625 ms 26232 KB Output is correct
9 Correct 578 ms 25336 KB Output is correct
10 Correct 461 ms 24656 KB Output is correct
11 Correct 206 ms 17272 KB Output is correct
12 Correct 549 ms 25328 KB Output is correct
13 Correct 618 ms 26248 KB Output is correct
14 Correct 535 ms 25592 KB Output is correct
15 Correct 555 ms 25632 KB Output is correct
16 Correct 626 ms 25772 KB Output is correct
17 Correct 644 ms 25604 KB Output is correct
18 Correct 676 ms 26076 KB Output is correct
19 Correct 706 ms 25628 KB Output is correct
20 Correct 624 ms 25628 KB Output is correct
21 Correct 651 ms 25636 KB Output is correct
22 Correct 589 ms 25704 KB Output is correct
23 Correct 239 ms 17384 KB Output is correct
24 Correct 624 ms 26232 KB Output is correct
25 Correct 24 ms 6648 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 27 ms 8440 KB Output is correct
29 Correct 17 ms 6776 KB Output is correct
30 Correct 8 ms 5240 KB Output is correct
31 Correct 8 ms 5188 KB Output is correct
32 Correct 9 ms 5368 KB Output is correct
33 Correct 7 ms 5240 KB Output is correct
34 Correct 19 ms 6776 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 7 ms 5112 KB Output is correct
37 Correct 8 ms 5116 KB Output is correct
38 Correct 7 ms 5240 KB Output is correct
39 Correct 7 ms 5240 KB Output is correct
40 Correct 631 ms 29416 KB Output is correct
41 Correct 647 ms 27488 KB Output is correct
42 Correct 667 ms 27320 KB Output is correct
43 Correct 300 ms 19528 KB Output is correct
44 Correct 261 ms 19448 KB Output is correct
45 Correct 724 ms 27284 KB Output is correct
46 Correct 748 ms 27256 KB Output is correct
47 Correct 775 ms 28092 KB Output is correct
48 Correct 234 ms 18808 KB Output is correct
49 Correct 504 ms 29412 KB Output is correct
50 Correct 873 ms 26664 KB Output is correct
51 Correct 712 ms 27128 KB Output is correct