oj.uz

Submission #292500

# Submission time Handle Problem Language Result Execution time Memory
292500 2020-09-07T06:51:55 Z maomao90 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 1460 ms 33520 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair <int, int> ii;
typedef pair <long long, long long> ll;

#define INF 1000000000000000000

int n, m;
int s, t;
int u, v;
vector <ii> adjList[200005], adjList1[200005], adjList2[200005];
long long distu[100005], distv[100005], dists[100005], distt[100005];
long long ans;

priority_queue<ll, vector<ii>, greater<ii> > pq;
void dijkstra(int a, long long *dist) {
	for (int i = 1; i <= n; i++) dist[i] = INF;
	dist[a] = 0;
	pq.emplace(0, a);
	while (!pq.empty()) {
		int u, d; tie(d, u) = pq.top(); pq.pop();
		if (d > dist[u]) continue;
		for (ii vw : adjList[u]) {
			int v, w; tie(v, w) = vw;
			if (dist[v] > dist[u] + w) {
				dist[v] = dist[u] + w;
				pq.emplace(dist[v], v);
			}
		}
	}
}

long long memo[100005][2];
long long dp(int i, bool stt) {
	if (memo[i][stt] != -1) return memo[i][stt];
	if (i == v) return 0;
	memo[i][stt] = INF;
	for (ii vw : adjList[i]) {
		int v, w; tie(v, w) = vw;
		if ((stt && dists[i] + distt[v] + w == dists[t]) || (!stt && dists[v] + distt[i] + w == dists[t]))
			memo[i][stt] = min(memo[i][stt], dp(v, stt));
		else memo[i][stt] = min(memo[i][stt], distv[v] + w);
	}
	return memo[i][stt];
}

int main() {
	scanf("%d%d", &n, &m);
	scanf("%d%d", &s, &t);
	scanf("%d%d", &u, &v);
	for (int i = 0; i < m; i++) {
		int a, b, c; scanf("%d%d%d", &a, &b, &c);
		adjList[a].emplace_back(b, c);
		adjList[b].emplace_back(a, c);
	}
	dijkstra(u, distu);
	dijkstra(v, distv);
	dijkstra(s, dists);
	dijkstra(t, distt);
	ans = distu[v];
	memset(memo, -1, sizeof memo);
	for (int i = 1; i <= n; i++) {
		if (dists[i] + distt[i] == dists[t]) {
			ans = min(ans, distu[i] + min(dp(i, true), dp(i, false)));
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  scanf("%d%d", &s, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  scanf("%d%d", &u, &v);
      |  ~~~~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:53:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |   int a, b, c; scanf("%d%d%d", &a, &b, &c);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 30056 KB Output is correct
2 Correct 383 ms 29680 KB Output is correct
3 Correct 425 ms 32668 KB Output is correct
4 Correct 353 ms 29804 KB Output is correct
5 Correct 391 ms 29420 KB Output is correct
6 Correct 413 ms 29892 KB Output is correct
7 Correct 395 ms 29552 KB Output is correct
8 Correct 391 ms 29552 KB Output is correct
9 Correct 1243 ms 31204 KB Output is correct
10 Correct 825 ms 30948 KB Output is correct
11 Correct 196 ms 27128 KB Output is correct
12 Correct 1108 ms 30316 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 31724 KB Output is correct
2 Correct 395 ms 31340 KB Output is correct
3 Correct 396 ms 31424 KB Output is correct
4 Correct 426 ms 31600 KB Output is correct
5 Correct 406 ms 31468 KB Output is correct
6 Correct 405 ms 33520 KB Output is correct
7 Correct 423 ms 32740 KB Output is correct
8 Correct 408 ms 30832 KB Output is correct
9 Correct 406 ms 31340 KB Output is correct
10 Correct 414 ms 30448 KB Output is correct
11 Correct 194 ms 28536 KB Output is correct
12 Correct 418 ms 33264 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 17024 KB Output is correct
2 Correct 12 ms 16000 KB Output is correct
3 Correct 11 ms 16000 KB Output is correct
4 Correct 36 ms 18048 KB Output is correct
5 Correct 20 ms 17024 KB Output is correct
6 Correct 12 ms 16128 KB Output is correct
7 Correct 13 ms 16128 KB Output is correct
8 Correct 13 ms 16120 KB Output is correct
9 Correct 12 ms 16256 KB Output is correct
10 Correct 21 ms 17024 KB Output is correct
11 Correct 11 ms 16000 KB Output is correct
12 Correct 12 ms 16000 KB Output is correct
13 Correct 12 ms 16000 KB Output is correct
14 Correct 12 ms 16000 KB Output is correct
15 Correct 12 ms 16000 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 30056 KB Output is correct
2 Correct 383 ms 29680 KB Output is correct
3 Correct 425 ms 32668 KB Output is correct
4 Correct 353 ms 29804 KB Output is correct
5 Correct 391 ms 29420 KB Output is correct
6 Correct 413 ms 29892 KB Output is correct
7 Correct 395 ms 29552 KB Output is correct
8 Correct 391 ms 29552 KB Output is correct
9 Correct 1243 ms 31204 KB Output is correct
10 Correct 825 ms 30948 KB Output is correct
11 Correct 196 ms 27128 KB Output is correct
12 Correct 1108 ms 30316 KB Output is correct
13 Correct 404 ms 31724 KB Output is correct
14 Correct 395 ms 31340 KB Output is correct
15 Correct 396 ms 31424 KB Output is correct
16 Correct 426 ms 31600 KB Output is correct
17 Correct 406 ms 31468 KB Output is correct
18 Correct 405 ms 33520 KB Output is correct
19 Correct 423 ms 32740 KB Output is correct
20 Correct 408 ms 30832 KB Output is correct
21 Correct 406 ms 31340 KB Output is correct
22 Correct 414 ms 30448 KB Output is correct
23 Correct 194 ms 28536 KB Output is correct
24 Correct 418 ms 33264 KB Output is correct
25 Correct 22 ms 17024 KB Output is correct
26 Correct 12 ms 16000 KB Output is correct
27 Correct 11 ms 16000 KB Output is correct
28 Correct 36 ms 18048 KB Output is correct
29 Correct 20 ms 17024 KB Output is correct
30 Correct 12 ms 16128 KB Output is correct
31 Correct 13 ms 16128 KB Output is correct
32 Correct 13 ms 16120 KB Output is correct
33 Correct 12 ms 16256 KB Output is correct
34 Correct 21 ms 17024 KB Output is correct
35 Correct 11 ms 16000 KB Output is correct
36 Correct 12 ms 16000 KB Output is correct
37 Correct 12 ms 16000 KB Output is correct
38 Correct 12 ms 16000 KB Output is correct
39 Correct 12 ms 16000 KB Output is correct
40 Correct 361 ms 30140 KB Output is correct
41 Correct 1460 ms 30508 KB Output is correct
42 Correct 1346 ms 30652 KB Output is correct
43 Correct 231 ms 27768 KB Output is correct
44 Correct 235 ms 28152 KB Output is correct
45 Correct 404 ms 29252 KB Output is correct
46 Correct 376 ms 28960 KB Output is correct
47 Correct 377 ms 29804 KB Output is correct
48 Correct 215 ms 25080 KB Output is correct
49 Correct 302 ms 29676 KB Output is correct
50 Correct 379 ms 29296 KB Output is correct
51 Correct 390 ms 29376 KB Output is correct