oj.uz

Submission #444687

# Submission time Handle Problem Language Result Execution time Memory
444687 2021-07-14T19:17:11 Z aryan12 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 371 ms 23148 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e5 + 5, INF = 1e15;
vector<array<int, 2> > g[N];
vector<int> distS, distT, distU, distV;
vector<array<int, 2> > between;
int n, m;
int s, t, u, v;

bool cmp(array<int, 2> a, array<int, 2> b) {
	return a[0] < b[0];
}

void dijkstra(int src, vector<int> &dist) {
	dist[src] = 0;
	priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;
	pq.push(make_pair(dist[src], src));
	while(!pq.empty()) {
		int cur_dist = pq.top().first, node = pq.top().second;
		pq.pop();
		if(cur_dist != dist[node]) {
			continue;
		}
		for(int i = 0; i < g[node].size(); i++) {
			if(dist[g[node][i][0]] > dist[node] + g[node][i][1]) {
				dist[g[node][i][0]] = dist[node] + g[node][i][1];
				pq.push(make_pair(dist[g[node][i][0]], g[node][i][0]));
			}
		}
	}
}

void Solve() {
	cin >> n >> m >> s >> t >> u >> v;
	for(int i = 1; i <= m; i++) {
		int a, b, w;
		cin >> a >> b >> w;
		g[a].push_back({b, w});
		g[b].push_back({a, w});
	}
	distS.resize(n + 1);
	distT.resize(n + 1);
	distU.resize(n + 1);
	distV.resize(n + 1);
	for(int i = 0; i <= n; i++) {
		distS[i] = INF;
		distT[i] = INF;
		distU[i] = INF;
		distV[i] = INF;
	}
	dijkstra(s, distS);
	dijkstra(t, distT);
	dijkstra(u, distU);
	dijkstra(v, distV);

	/*cout << "distance from S\n";
	for(int i = 1; i <= n; i++) {
		cout << distS[i] << " ";
	}
	cout << "\n";

	cout << "distance from T\n";
	for(int i = 1; i <= n; i++) {
		cout << distT[i] << " ";
	}
	cout << "\n";

	cout << "distance from U\n";
	for(int i = 1; i <= n; i++) {
		cout << distU[i] << " ";
	}
	cout << "\n";

	cout << "distance from V\n";
	for(int i = 1; i <= n; i++) {
		cout << distV[i] << " ";
	}
	cout << "\n";*/

	for(int i = 1; i <= n; i++) {
		if(distS[i] + distT[i] == distS[t]) {
			between.push_back({distS[i], i});
		}
	}
	sort(between.begin(), between.end(), cmp);
	vector<array<int, 2> > dp(n + 1);
	for(int i = 0; i <= n; i++) {
		dp[i] = {INF, INF};
	}
	int curAns = distU[v];
	for(int i = 0; i < between.size(); i++) {
		int node = between[i][1];
		//cout << "node = " << node << "\n";
		dp[node][0] = min(dp[node][0], distU[node]);
		dp[node][1] = min(dp[node][1], distV[node]);
		for(int j = 0; j < g[node].size(); j++) {
			dp[g[node][j][0]][0] = min(dp[g[node][j][0]][0], dp[node][0]);
			dp[g[node][j][0]][1] = min(dp[g[node][j][0]][1], dp[node][1]);
		}
		curAns = min(curAns, dp[node][0] + distV[node]);
		curAns = min(curAns, dp[node][1] + distU[node]);
	}
	cout << curAns << "\n";
}

int32_t main() {
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) {
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void dijkstra(long long int, std::vector<long long int>&)':
commuter_pass.cpp:28:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   for(int i = 0; i < g[node].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'void Solve()':
commuter_pass.cpp:95:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |  for(int i = 0; i < between.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:100:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |   for(int j = 0; j < g[node].size(); j++) {
      |                  ~~^~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 19500 KB Output is correct
2 Correct 328 ms 18868 KB Output is correct
3 Correct 364 ms 19344 KB Output is correct
4 Correct 323 ms 19356 KB Output is correct
5 Correct 325 ms 19816 KB Output is correct
6 Correct 326 ms 19504 KB Output is correct
7 Correct 331 ms 19828 KB Output is correct
8 Correct 371 ms 19656 KB Output is correct
9 Correct 328 ms 18256 KB Output is correct
10 Correct 280 ms 18012 KB Output is correct
11 Correct 151 ms 13496 KB Output is correct
12 Correct 356 ms 18120 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 18852 KB Output is correct
2 Correct 360 ms 19048 KB Output is correct
3 Correct 361 ms 18760 KB Output is correct
4 Correct 348 ms 18828 KB Output is correct
5 Correct 365 ms 19416 KB Output is correct
6 Correct 332 ms 19932 KB Output is correct
7 Correct 363 ms 19316 KB Output is correct
8 Correct 351 ms 18844 KB Output is correct
9 Correct 347 ms 19404 KB Output is correct
10 Correct 365 ms 18756 KB Output is correct
11 Correct 156 ms 13752 KB Output is correct
12 Correct 341 ms 19892 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4172 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 21 ms 6156 KB Output is correct
5 Correct 11 ms 4344 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 11 ms 4384 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2684 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 19500 KB Output is correct
2 Correct 328 ms 18868 KB Output is correct
3 Correct 364 ms 19344 KB Output is correct
4 Correct 323 ms 19356 KB Output is correct
5 Correct 325 ms 19816 KB Output is correct
6 Correct 326 ms 19504 KB Output is correct
7 Correct 331 ms 19828 KB Output is correct
8 Correct 371 ms 19656 KB Output is correct
9 Correct 328 ms 18256 KB Output is correct
10 Correct 280 ms 18012 KB Output is correct
11 Correct 151 ms 13496 KB Output is correct
12 Correct 356 ms 18120 KB Output is correct
13 Correct 370 ms 18852 KB Output is correct
14 Correct 360 ms 19048 KB Output is correct
15 Correct 361 ms 18760 KB Output is correct
16 Correct 348 ms 18828 KB Output is correct
17 Correct 365 ms 19416 KB Output is correct
18 Correct 332 ms 19932 KB Output is correct
19 Correct 363 ms 19316 KB Output is correct
20 Correct 351 ms 18844 KB Output is correct
21 Correct 347 ms 19404 KB Output is correct
22 Correct 365 ms 18756 KB Output is correct
23 Correct 156 ms 13752 KB Output is correct
24 Correct 341 ms 19892 KB Output is correct
25 Correct 11 ms 4172 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 21 ms 6156 KB Output is correct
29 Correct 11 ms 4344 KB Output is correct
30 Correct 3 ms 2764 KB Output is correct
31 Correct 3 ms 2764 KB Output is correct
32 Correct 4 ms 2892 KB Output is correct
33 Correct 3 ms 2764 KB Output is correct
34 Correct 11 ms 4384 KB Output is correct
35 Correct 2 ms 2764 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2684 KB Output is correct
40 Correct 328 ms 23148 KB Output is correct
41 Correct 321 ms 22408 KB Output is correct
42 Correct 323 ms 22448 KB Output is correct
43 Correct 154 ms 16360 KB Output is correct
44 Correct 189 ms 16544 KB Output is correct
45 Correct 325 ms 22972 KB Output is correct
46 Correct 308 ms 22604 KB Output is correct
47 Correct 345 ms 23064 KB Output is correct
48 Correct 156 ms 15796 KB Output is correct
49 Correct 262 ms 22708 KB Output is correct
50 Correct 319 ms 22748 KB Output is correct
51 Correct 315 ms 22924 KB Output is correct