oj.uz

Submission #227593

# Submission time Handle Problem Language Result Execution time Memory
227593 2020-04-28T03:25:46 Z bensonlzl Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 470 ms 27312 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pl;

ll N, M, X, Y, S, T, U, V, C, mini = 1e18;


ll distS[100005], distT[100005], distU[100005], distV[100005], dp[100005];
int visit[100005];
vector<pl> AdjList[100005];
vector<int> dpList[100005];


void dijkstra(int x, ll d[]){
	priority_queue<pl,vector<pl>,greater<pl> > pq;
	for (int i = 1; i <= N; ++i) d[i] = 1e16;
 	d[x] = 0;
 	pq.push(pl(0,x));
 	while (!pq.empty()){
 		pl t = pq.top();
 		pq.pop();
 		ll dt = t.first, v = t.second;
 		if (d[v] != dt) continue;
 		for (auto it : AdjList[v]){
 			if (d[it.first] > d[v] + it.second){
 				d[it.first] = d[v] + it.second;
 				pq.push(pl(d[it.first],it.first));
 			}
 		}
 	}
}

void dfs(int x){
	visit[x] = 1;
	for (auto it : dpList[x]){
		if (!visit[it]) dfs(it);
		dp[x] = min(dp[x],dp[it]);
	}
}

void runDP(ll d1[], ll d2[]){
	for (int i = 1; i <= N; ++i){
		dp[i] = d2[i];
		visit[i] = 0;
	}
	for (int i = 1; i <= N; ++i){
		if (!visit[i]) dfs(i);
	}
	for (int i = 1; i <= N; ++i){
		mini = min(mini,dp[i] + d1[i]);
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);	
	cin >> N >> M;
	cin >> S >> T;
	cin >> U >> V;
	for (int i = 1; i <= M; ++i){
		cin >> X >> Y >> C;
		AdjList[X].push_back(pl(Y,C));
		AdjList[Y].push_back(pl(X,C));
	}
	dijkstra(S,distS); dijkstra(T,distT); dijkstra(U,distU); dijkstra(V,distV);
	for (int i = 1; i <= N; ++i){
		for (auto it : AdjList[i]){
			if (distS[i] + it.second + distT[it.first] == distS[T]){
				dpList[i].push_back(it.first);
			}
		}
	}
	runDP(distU,distV);
	runDP(distV,distU);
	cout << mini << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 25620 KB Output is correct
2 Correct 331 ms 24084 KB Output is correct
3 Correct 368 ms 26612 KB Output is correct
4 Correct 401 ms 25340 KB Output is correct
5 Correct 328 ms 24264 KB Output is correct
6 Correct 327 ms 25588 KB Output is correct
7 Correct 336 ms 24564 KB Output is correct
8 Correct 333 ms 24344 KB Output is correct
9 Correct 425 ms 24680 KB Output is correct
10 Correct 256 ms 24648 KB Output is correct
11 Correct 146 ms 19320 KB Output is correct
12 Correct 337 ms 24700 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 24240 KB Output is correct
2 Correct 339 ms 24436 KB Output is correct
3 Correct 376 ms 24652 KB Output is correct
4 Correct 343 ms 23908 KB Output is correct
5 Correct 352 ms 24532 KB Output is correct
6 Correct 331 ms 26156 KB Output is correct
7 Correct 362 ms 27312 KB Output is correct
8 Correct 350 ms 24168 KB Output is correct
9 Correct 352 ms 24580 KB Output is correct
10 Correct 353 ms 24560 KB Output is correct
11 Correct 145 ms 20472 KB Output is correct
12 Correct 351 ms 26812 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 6784 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 23 ms 8448 KB Output is correct
5 Correct 15 ms 6784 KB Output is correct
6 Correct 9 ms 5248 KB Output is correct
7 Correct 9 ms 5248 KB Output is correct
8 Correct 9 ms 5376 KB Output is correct
9 Correct 8 ms 5248 KB Output is correct
10 Correct 15 ms 6784 KB Output is correct
11 Correct 8 ms 5120 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 9 ms 5120 KB Output is correct
14 Correct 8 ms 5248 KB Output is correct
15 Correct 9 ms 5120 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 25620 KB Output is correct
2 Correct 331 ms 24084 KB Output is correct
3 Correct 368 ms 26612 KB Output is correct
4 Correct 401 ms 25340 KB Output is correct
5 Correct 328 ms 24264 KB Output is correct
6 Correct 327 ms 25588 KB Output is correct
7 Correct 336 ms 24564 KB Output is correct
8 Correct 333 ms 24344 KB Output is correct
9 Correct 425 ms 24680 KB Output is correct
10 Correct 256 ms 24648 KB Output is correct
11 Correct 146 ms 19320 KB Output is correct
12 Correct 337 ms 24700 KB Output is correct
13 Correct 340 ms 24240 KB Output is correct
14 Correct 339 ms 24436 KB Output is correct
15 Correct 376 ms 24652 KB Output is correct
16 Correct 343 ms 23908 KB Output is correct
17 Correct 352 ms 24532 KB Output is correct
18 Correct 331 ms 26156 KB Output is correct
19 Correct 362 ms 27312 KB Output is correct
20 Correct 350 ms 24168 KB Output is correct
21 Correct 352 ms 24580 KB Output is correct
22 Correct 353 ms 24560 KB Output is correct
23 Correct 145 ms 20472 KB Output is correct
24 Correct 351 ms 26812 KB Output is correct
25 Correct 16 ms 6784 KB Output is correct
26 Correct 8 ms 5120 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 23 ms 8448 KB Output is correct
29 Correct 15 ms 6784 KB Output is correct
30 Correct 9 ms 5248 KB Output is correct
31 Correct 9 ms 5248 KB Output is correct
32 Correct 9 ms 5376 KB Output is correct
33 Correct 8 ms 5248 KB Output is correct
34 Correct 15 ms 6784 KB Output is correct
35 Correct 8 ms 5120 KB Output is correct
36 Correct 7 ms 5120 KB Output is correct
37 Correct 9 ms 5120 KB Output is correct
38 Correct 8 ms 5248 KB Output is correct
39 Correct 9 ms 5120 KB Output is correct
40 Correct 309 ms 25464 KB Output is correct
41 Correct 314 ms 24588 KB Output is correct
42 Correct 445 ms 24856 KB Output is correct
43 Correct 207 ms 21624 KB Output is correct
44 Correct 170 ms 21792 KB Output is correct
45 Correct 347 ms 25640 KB Output is correct
46 Correct 331 ms 25444 KB Output is correct
47 Correct 470 ms 25476 KB Output is correct
48 Correct 163 ms 19704 KB Output is correct
49 Correct 323 ms 25416 KB Output is correct
50 Correct 332 ms 24940 KB Output is correct
51 Correct 385 ms 25768 KB Output is correct