oj.uz

Submission #153577

# Submission time Handle Problem Language Result Execution time Memory
153577 2019-09-14T16:42:13 Z mhy908 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 437 ms 25760 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define llinf 8987654321987654321
#define inf 1987654321
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;

int n, m;
int u, v, s, t;
vector<vector<pii > > adj;
vector<vector<int> > adj2;
vector<LL> udis, vdis, dis, mini1, mini2;
priority_queue<pair<LL, 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, llinf);
	vdis.resize(n, llinf);
	dis.resize(n, llinf);
	mini1.resize(n, llinf);
	mini2.resize(n, llinf);
	vis.resize(n);
	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;
		LL 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;
		LL 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);
	LL 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", ans);
}

Compilation message

commuter_pass.cpp: In function 'void dfs(int)':
commuter_pass.cpp:25: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:61:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
commuter_pass.cpp:77:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
commuter_pass.cpp:93:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
commuter_pass.cpp:111:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj2[x].size(); i++) {
                   ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:37: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:49: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 328 ms 21312 KB Output is correct
2 Correct 345 ms 20288 KB Output is correct
3 Correct 368 ms 25760 KB Output is correct
4 Correct 326 ms 21188 KB Output is correct
5 Correct 341 ms 20884 KB Output is correct
6 Correct 356 ms 21348 KB Output is correct
7 Correct 367 ms 21356 KB Output is correct
8 Correct 377 ms 21136 KB Output is correct
9 Correct 340 ms 20748 KB Output is correct
10 Correct 362 ms 20952 KB Output is correct
11 Correct 189 ms 18324 KB Output is correct
12 Correct 328 ms 20556 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 22208 KB Output is correct
2 Correct 373 ms 22316 KB Output is correct
3 Correct 363 ms 21636 KB Output is correct
4 Correct 372 ms 22024 KB Output is correct
5 Correct 369 ms 22636 KB Output is correct
6 Correct 387 ms 25068 KB Output is correct
7 Correct 437 ms 25708 KB Output is correct
8 Correct 379 ms 22124 KB Output is correct
9 Correct 408 ms 22668 KB Output is correct
10 Correct 395 ms 21740 KB Output is correct
11 Correct 196 ms 20344 KB Output is correct
12 Correct 416 ms 25432 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1400 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 23 ms 2428 KB Output is correct
5 Correct 12 ms 1404 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 12 ms 1360 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 21312 KB Output is correct
2 Correct 345 ms 20288 KB Output is correct
3 Correct 368 ms 25760 KB Output is correct
4 Correct 326 ms 21188 KB Output is correct
5 Correct 341 ms 20884 KB Output is correct
6 Correct 356 ms 21348 KB Output is correct
7 Correct 367 ms 21356 KB Output is correct
8 Correct 377 ms 21136 KB Output is correct
9 Correct 340 ms 20748 KB Output is correct
10 Correct 362 ms 20952 KB Output is correct
11 Correct 189 ms 18324 KB Output is correct
12 Correct 328 ms 20556 KB Output is correct
13 Correct 341 ms 22208 KB Output is correct
14 Correct 373 ms 22316 KB Output is correct
15 Correct 363 ms 21636 KB Output is correct
16 Correct 372 ms 22024 KB Output is correct
17 Correct 369 ms 22636 KB Output is correct
18 Correct 387 ms 25068 KB Output is correct
19 Correct 437 ms 25708 KB Output is correct
20 Correct 379 ms 22124 KB Output is correct
21 Correct 408 ms 22668 KB Output is correct
22 Correct 395 ms 21740 KB Output is correct
23 Correct 196 ms 20344 KB Output is correct
24 Correct 416 ms 25432 KB Output is correct
25 Correct 13 ms 1400 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 23 ms 2428 KB Output is correct
29 Correct 12 ms 1404 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 4 ms 632 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 12 ms 1360 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 3 ms 376 KB Output is correct
40 Correct 323 ms 21184 KB Output is correct
41 Correct 344 ms 20624 KB Output is correct
42 Correct 348 ms 20592 KB Output is correct
43 Correct 227 ms 20984 KB Output is correct
44 Correct 191 ms 20932 KB Output is correct
45 Correct 366 ms 22312 KB Output is correct
46 Correct 366 ms 22132 KB Output is correct
47 Correct 326 ms 21228 KB Output is correct
48 Correct 201 ms 18300 KB Output is correct
49 Correct 285 ms 20840 KB Output is correct
50 Correct 376 ms 21652 KB Output is correct
51 Correct 379 ms 22252 KB Output is correct