oj.uz

Submission #934379

# Submission time Handle Problem Language Result Execution time Memory
934379 2024-02-27T08:54:48 Z SmuggingSpun Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 179 ms 21836 KB 
#include<bits/stdc++.h>
#define taskname "commuterpass"
using namespace std;
typedef long long ll;
template<class T>void minimize(T& a, T b){
	if(a > b){
		a = b;
	}
}
const ll INF = 1e18;
const int lim = 1e5 + 5;
vector<pair<int, int>>e[lim];
void dijkstra(int vertex, vector<ll>& d){
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>pq;
	pq.emplace(d[vertex] = 0, vertex);
	bitset<lim>vis;
	while(!pq.empty()){
		auto [w, u] = pq.top();
		pq.pop();
		if(w == d[u]){
			for(auto& [v, edge_w] : e[u]){
				ll W = w + edge_w;
				if(W < d[v]){
					pq.emplace(d[v] = W, v);
				}
			}
		}
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	int n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	for(int i = 0; i < m; i++){
		int a, b, c;
		cin >> a >> b >> c;
		e[a].emplace_back(b, c);
		e[b].emplace_back(a, c);
	}
	vector<ll>d_s(n + 1, INF), d_u(n + 1, INF), d_v(n + 1, INF), dp_u(n + 1, INF), dp_v(n + 1, INF);
	dijkstra(s, d_s);
	dijkstra(u, d_u);
	dijkstra(v, d_v);
	ll ans = d_u[v];
	function<void(int)>dfs;
	dfs = [&] (int vertex){
		if(dp_u[vertex] != INF){
			return;
		}
		dp_u[vertex] = d_u[vertex];
		dp_v[vertex] = d_v[vertex];
		for(auto& [next_vertex, w] : e[vertex]){
			if(d_s[next_vertex] + w == d_s[vertex]){
				dfs(next_vertex);
				minimize(dp_u[vertex], dp_u[next_vertex]);
				minimize(dp_v[vertex], dp_v[next_vertex]);
			}
		}
		minimize(ans, min(dp_v[vertex] + d_u[vertex], dp_u[vertex] + d_v[vertex]));
	};
	dfs(t);
	cout << ans;
}

Compilation message

commuter_pass.cpp: In function 'void dijkstra(int, std::vector<long long int>&)':
commuter_pass.cpp:18:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |   auto [w, u] = pq.top();
      |        ^
commuter_pass.cpp:21:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |    for(auto& [v, edge_w] : e[u]){
      |              ^
commuter_pass.cpp: In lambda function:
commuter_pass.cpp:55:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   55 |   for(auto& [next_vertex, w] : e[vertex]){
      |             ^
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 18700 KB Output is correct
2 Correct 159 ms 18864 KB Output is correct
3 Correct 146 ms 21836 KB Output is correct
4 Correct 127 ms 19684 KB Output is correct
5 Correct 134 ms 18064 KB Output is correct
6 Correct 139 ms 20052 KB Output is correct
7 Correct 141 ms 18212 KB Output is correct
8 Correct 136 ms 18392 KB Output is correct
9 Correct 155 ms 19280 KB Output is correct
10 Correct 114 ms 19088 KB Output is correct
11 Correct 55 ms 14928 KB Output is correct
12 Correct 153 ms 19004 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 16944 KB Output is correct
2 Correct 153 ms 18916 KB Output is correct
3 Correct 151 ms 18628 KB Output is correct
4 Correct 164 ms 18992 KB Output is correct
5 Correct 174 ms 19304 KB Output is correct
6 Correct 142 ms 21248 KB Output is correct
7 Correct 151 ms 21596 KB Output is correct
8 Correct 179 ms 19116 KB Output is correct
9 Correct 149 ms 19504 KB Output is correct
10 Correct 146 ms 18640 KB Output is correct
11 Correct 48 ms 16756 KB Output is correct
12 Correct 141 ms 21652 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3768 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 10 ms 4956 KB Output is correct
5 Correct 6 ms 3676 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 2 ms 2996 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 5 ms 3676 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 18700 KB Output is correct
2 Correct 159 ms 18864 KB Output is correct
3 Correct 146 ms 21836 KB Output is correct
4 Correct 127 ms 19684 KB Output is correct
5 Correct 134 ms 18064 KB Output is correct
6 Correct 139 ms 20052 KB Output is correct
7 Correct 141 ms 18212 KB Output is correct
8 Correct 136 ms 18392 KB Output is correct
9 Correct 155 ms 19280 KB Output is correct
10 Correct 114 ms 19088 KB Output is correct
11 Correct 55 ms 14928 KB Output is correct
12 Correct 153 ms 19004 KB Output is correct
13 Correct 139 ms 16944 KB Output is correct
14 Correct 153 ms 18916 KB Output is correct
15 Correct 151 ms 18628 KB Output is correct
16 Correct 164 ms 18992 KB Output is correct
17 Correct 174 ms 19304 KB Output is correct
18 Correct 142 ms 21248 KB Output is correct
19 Correct 151 ms 21596 KB Output is correct
20 Correct 179 ms 19116 KB Output is correct
21 Correct 149 ms 19504 KB Output is correct
22 Correct 146 ms 18640 KB Output is correct
23 Correct 48 ms 16756 KB Output is correct
24 Correct 141 ms 21652 KB Output is correct
25 Correct 6 ms 3768 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 10 ms 4956 KB Output is correct
29 Correct 6 ms 3676 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 1 ms 2908 KB Output is correct
32 Correct 2 ms 2996 KB Output is correct
33 Correct 1 ms 2908 KB Output is correct
34 Correct 5 ms 3676 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 129 ms 20260 KB Output is correct
41 Correct 130 ms 18860 KB Output is correct
42 Correct 131 ms 19104 KB Output is correct
43 Correct 57 ms 15836 KB Output is correct
44 Correct 54 ms 15700 KB Output is correct
45 Correct 130 ms 17856 KB Output is correct
46 Correct 122 ms 17604 KB Output is correct
47 Correct 147 ms 19716 KB Output is correct
48 Correct 67 ms 12772 KB Output is correct
49 Correct 107 ms 20484 KB Output is correct
50 Correct 143 ms 18208 KB Output is correct
51 Correct 125 ms 17856 KB Output is correct