oj.uz

Submission #99613

# Submission time Handle Problem Language Result Execution time Memory
99613 2019-03-05T16:45:24 Z lovemathboy Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 524 ms 22380 KB 
#include <bits/stdc++.h>
using namespace std;

int n, m;
int u, v, s, t;
vector<vector<pair<int, int> > > adj;
vector<vector<int> > adj2;
vector<long long> udis, vdis, dis, mini1, mini2;
priority_queue<pair<long long, int> > pq;
vector<int> pre;
vector<bool> vis;
stack<int> topo;

void dfs(int index) {
	if (vis[index]) return;
	vis[index] = true;
	for (int i = 0; i < adj[index].size(); i++) {
		int x = adj[index][i].first;
		int d = adj[index][i].second;
		if (dis[index] - d == dis[x]) {
			adj2[index].push_back(x);
			dfs(x);
		}
	}
	topo.push(index);
}

int main() {
	scanf("%d %d %d %d %d %d", &n, &m, &s, &t, &u, &v);
	s--;t--;u--;v--;
	int i1, i2, i3;
	adj.resize(n); adj2.resize(n);
	udis.resize(n, 101234567890123456LL);
	vdis.resize(n, 101234567890123456LL);
	dis.resize(n, 101234567890123456LL);
	mini1.resize(n, 101234567890123456LL);
	mini2.resize(n, 101234567890123456LL);
	vis.resize(n, false);
	for (int i = 0; i < m; i++) {
		scanf("%d %d %d", &i1, &i2, &i3);
		i1--; i2--;
		adj[i1].emplace_back(i2, i3);
		adj[i2].emplace_back(i1, i3);
	}
	udis[u] = 0;
	pq.push(make_pair(0, u));
	while (!pq.empty()) {
		int x = pq.top().second;
		long long d = -pq.top().first;
		pq.pop();
		if (udis[x] != d) continue;
		for (int i = 0; i < adj[x].size(); i++) {
			int y = adj[x][i].first;
			int w = adj[x][i].second;
			if (udis[y] > d + w) {
				udis[y] = d + w;
				pq.push(make_pair(-d-w, y));
			}
		}
	}
	vdis[v] = 0;
	pq.push(make_pair(0, v));
	while (!pq.empty()) {
		int x = pq.top().second;
		long long d = -pq.top().first;
		pq.pop();
		if (vdis[x] != d) continue;
		for (int i = 0; i < adj[x].size(); i++) {
			int y = adj[x][i].first;
			int w = adj[x][i].second;
			if (vdis[y] > d + w) {
				vdis[y] = d + w;
				pq.push(make_pair(-d-w, y));
			}
		}
	}
	dis[s] = 0;
	pq.push(make_pair(0, s));
	while (!pq.empty()) {
		int x = pq.top().second;
		long long d = -pq.top().first;
		pq.pop();
		if (dis[x] != d) continue;
		for (int i = 0; i < adj[x].size(); i++) {
			int y = adj[x][i].first;
			int w = adj[x][i].second;
			if (dis[y] > d + w) {
				dis[y] = d + w;
				pq.push(make_pair(-d-w, y));
			}
		}
	}
	dfs(t);
	long long ans = udis[v];
	while (!topo.empty()) {
		int x = topo.top();
		topo.pop();
		mini1[x] = min(mini1[x], udis[x]);
		mini2[x] = min(mini2[x], vdis[x]);
		ans = min(ans, vdis[x] + mini1[x]);
		ans = min(ans, udis[x] + mini2[x]);
		for (int i = 0; i < adj2[x].size(); i++) {
			int y = adj2[x][i];
			mini1[y] = min(mini1[y], mini1[x]);
			mini2[y] = min(mini2[y], mini2[x]);
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void dfs(int)':
commuter_pass.cpp:17:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < adj[index].size(); i++) {
                  ~~^~~~~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:52:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
commuter_pass.cpp:68:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
commuter_pass.cpp:84:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
commuter_pass.cpp:102:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj2[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d %d %d", &n, &m, &s, &t, &u, &v);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &i1, &i2, &i3);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 17824 KB Output is correct
2 Correct 428 ms 17132 KB Output is correct
3 Correct 453 ms 22124 KB Output is correct
4 Correct 400 ms 17660 KB Output is correct
5 Correct 453 ms 17772 KB Output is correct
6 Correct 368 ms 17644 KB Output is correct
7 Correct 475 ms 18412 KB Output is correct
8 Correct 487 ms 18032 KB Output is correct
9 Correct 453 ms 16752 KB Output is correct
10 Correct 424 ms 16680 KB Output is correct
11 Correct 239 ms 16504 KB Output is correct
12 Correct 443 ms 16676 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 18800 KB Output is correct
2 Correct 504 ms 19092 KB Output is correct
3 Correct 514 ms 18540 KB Output is correct
4 Correct 473 ms 18896 KB Output is correct
5 Correct 462 ms 19436 KB Output is correct
6 Correct 491 ms 21604 KB Output is correct
7 Correct 458 ms 22380 KB Output is correct
8 Correct 495 ms 19048 KB Output is correct
9 Correct 524 ms 19488 KB Output is correct
10 Correct 503 ms 18432 KB Output is correct
11 Correct 230 ms 18472 KB Output is correct
12 Correct 455 ms 21868 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1280 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 22 ms 1920 KB Output is correct
5 Correct 15 ms 1124 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 11 ms 1408 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 17824 KB Output is correct
2 Correct 428 ms 17132 KB Output is correct
3 Correct 453 ms 22124 KB Output is correct
4 Correct 400 ms 17660 KB Output is correct
5 Correct 453 ms 17772 KB Output is correct
6 Correct 368 ms 17644 KB Output is correct
7 Correct 475 ms 18412 KB Output is correct
8 Correct 487 ms 18032 KB Output is correct
9 Correct 453 ms 16752 KB Output is correct
10 Correct 424 ms 16680 KB Output is correct
11 Correct 239 ms 16504 KB Output is correct
12 Correct 443 ms 16676 KB Output is correct
13 Correct 502 ms 18800 KB Output is correct
14 Correct 504 ms 19092 KB Output is correct
15 Correct 514 ms 18540 KB Output is correct
16 Correct 473 ms 18896 KB Output is correct
17 Correct 462 ms 19436 KB Output is correct
18 Correct 491 ms 21604 KB Output is correct
19 Correct 458 ms 22380 KB Output is correct
20 Correct 495 ms 19048 KB Output is correct
21 Correct 524 ms 19488 KB Output is correct
22 Correct 503 ms 18432 KB Output is correct
23 Correct 230 ms 18472 KB Output is correct
24 Correct 455 ms 21868 KB Output is correct
25 Correct 11 ms 1280 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 22 ms 1920 KB Output is correct
29 Correct 15 ms 1124 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 11 ms 1408 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 4 ms 384 KB Output is correct
40 Correct 384 ms 17396 KB Output is correct
41 Correct 413 ms 16724 KB Output is correct
42 Correct 402 ms 16780 KB Output is correct
43 Correct 238 ms 19164 KB Output is correct
44 Correct 269 ms 19064 KB Output is correct
45 Correct 464 ms 19308 KB Output is correct
46 Correct 489 ms 19256 KB Output is correct
47 Correct 375 ms 17800 KB Output is correct
48 Correct 304 ms 17144 KB Output is correct
49 Correct 354 ms 17216 KB Output is correct
50 Correct 453 ms 18796 KB Output is correct
51 Correct 426 ms 19288 KB Output is correct