oj.uz

Submission #301822

# Submission time Handle Problem Language Result Execution time Memory
301822 2020-09-18T08:31:50 Z pit4h Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 703 ms 53848 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#ifndef LOCAL
#define cerr if(0)cerr
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
const ll INF = 1e16+1;
void dijkstra(int s, vector<vector<pii>>& g, vector<ll>& d) {
	int n = g.size()-1;
	vector<bool> vis(n+1);
	priority_queue<pair<ll, int>> Q;
	d[s] = 0;
	Q.push({d[s], s});
	while(Q.size()) {
		int cur = Q.top().nd;
		Q.pop();
		if(vis[cur]) continue;
		vis[cur] = 1;
		for(auto nxt: g[cur]) {
			if(!vis[nxt.st] && d[nxt.st] > d[cur] + nxt.nd) {
				d[nxt.st] = d[cur] + nxt.nd;
				Q.push({-d[nxt.st], nxt.st});
			}
		}
	}
}
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n, m; cin>>n>>m;
	int s, t; cin>>s>>t;
	int u, v; cin>>u>>v;
	vector<vector<pii>> g(n+1);
	for(int i=0; i<m; ++i) {
		int a, b, c;
		cin>>a>>b>>c;
		g[a].push_back({b, c});
		g[b].push_back({a, c});
	}
	vector<ll> d_s(n+1, INF), d_t(n+1, INF);
	dijkstra(s, g, d_s);
	dijkstra(t, g, d_t);
	auto G = g;
	for(int i=n+1; i<=3*n; ++i) {
		G.push_back({});
	}
	for(int i=1; i<=n; ++i) {
		for(auto edge: g[i]) {
			int j = edge.st, w = edge.nd;
			G[i+2*n].push_back({j+2*n, w});
			if(d_s[i] + w + d_t[j] == d_s[t]) {
				G[i+n].push_back({j+n, 0});		
			}
			else {
				G[i+n].push_back({j+2*n, w});
			}
		}
	}
	for(int i=1; i<=n; ++i) {
		G[i].push_back({i+n, 0});
		G[i+n].push_back({i+2*n, 0});
	}
	vector<ll> d(3*n+1, INF);
	auto D = d;
	dijkstra(u, G, d);
	dijkstra(v, G, D);
	cout<<min(d[v+2*n], D[u+2*n]);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 50156 KB Output is correct
2 Correct 641 ms 47952 KB Output is correct
3 Correct 669 ms 50920 KB Output is correct
4 Correct 649 ms 50232 KB Output is correct
5 Correct 647 ms 48300 KB Output is correct
6 Correct 676 ms 50412 KB Output is correct
7 Correct 661 ms 48352 KB Output is correct
8 Correct 665 ms 48072 KB Output is correct
9 Correct 661 ms 47612 KB Output is correct
10 Correct 541 ms 47380 KB Output is correct
11 Correct 369 ms 37236 KB Output is correct
12 Correct 682 ms 47972 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 679 ms 48144 KB Output is correct
2 Correct 703 ms 47792 KB Output is correct
3 Correct 659 ms 47796 KB Output is correct
4 Correct 695 ms 47928 KB Output is correct
5 Correct 677 ms 47812 KB Output is correct
6 Correct 657 ms 50852 KB Output is correct
7 Correct 682 ms 48044 KB Output is correct
8 Correct 676 ms 47872 KB Output is correct
9 Correct 698 ms 48280 KB Output is correct
10 Correct 682 ms 47792 KB Output is correct
11 Correct 371 ms 37628 KB Output is correct
12 Correct 676 ms 51072 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3456 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 23 ms 6272 KB Output is correct
5 Correct 13 ms 3328 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 4 ms 896 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 12 ms 3328 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 50156 KB Output is correct
2 Correct 641 ms 47952 KB Output is correct
3 Correct 669 ms 50920 KB Output is correct
4 Correct 649 ms 50232 KB Output is correct
5 Correct 647 ms 48300 KB Output is correct
6 Correct 676 ms 50412 KB Output is correct
7 Correct 661 ms 48352 KB Output is correct
8 Correct 665 ms 48072 KB Output is correct
9 Correct 661 ms 47612 KB Output is correct
10 Correct 541 ms 47380 KB Output is correct
11 Correct 369 ms 37236 KB Output is correct
12 Correct 682 ms 47972 KB Output is correct
13 Correct 679 ms 48144 KB Output is correct
14 Correct 703 ms 47792 KB Output is correct
15 Correct 659 ms 47796 KB Output is correct
16 Correct 695 ms 47928 KB Output is correct
17 Correct 677 ms 47812 KB Output is correct
18 Correct 657 ms 50852 KB Output is correct
19 Correct 682 ms 48044 KB Output is correct
20 Correct 676 ms 47872 KB Output is correct
21 Correct 698 ms 48280 KB Output is correct
22 Correct 682 ms 47792 KB Output is correct
23 Correct 371 ms 37628 KB Output is correct
24 Correct 676 ms 51072 KB Output is correct
25 Correct 13 ms 3456 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 23 ms 6272 KB Output is correct
29 Correct 13 ms 3328 KB Output is correct
30 Correct 2 ms 640 KB Output is correct
31 Correct 3 ms 768 KB Output is correct
32 Correct 4 ms 896 KB Output is correct
33 Correct 2 ms 640 KB Output is correct
34 Correct 12 ms 3328 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 649 ms 53020 KB Output is correct
41 Correct 664 ms 51208 KB Output is correct
42 Correct 639 ms 51400 KB Output is correct
43 Correct 389 ms 38648 KB Output is correct
44 Correct 380 ms 38644 KB Output is correct
45 Correct 624 ms 51032 KB Output is correct
46 Correct 632 ms 50856 KB Output is correct
47 Correct 667 ms 53356 KB Output is correct
48 Correct 383 ms 38264 KB Output is correct
49 Correct 589 ms 52632 KB Output is correct
50 Correct 666 ms 53000 KB Output is correct
51 Correct 644 ms 53848 KB Output is correct