oj.uz

Submission #60665

# Submission time Handle Problem Language Result Execution time Memory
60665 2018-07-24T13:53:53 Z gusfring Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 799 ms 60040 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 5;
typedef long long ll;

struct node{
	int u;
	ll w;
	bool operator<(const node &rhs) const{
		return w > rhs.w;
	}
};

vector<node> adj[MAXN];
int N, M, S, U, T, V;
ll dists[MAXN], distt[MAXN], distu[MAXN], distv[MAXN], dp[MAXN], res;

void dijkstra(int cur, ll *dist){
	for(int i=1; i<=N; ++i) dist[i] = -1;
	dist[cur] = 0;
	priority_queue<node> Q;
	Q.push((node){cur, 0});
	while(!Q.empty()){
		node it = Q.top(); Q.pop();
		int u = it.u;
		ll w = it.w;
		for(node it2 : adj[u]){
			int v = it2.u;
			ll ww = it2.w;
			if(dist[v] == -1 || dist[u] + ww < dist[v]){
				dist[v] = dist[u] + ww;
				Q.push((node){v, dist[v]});
			}
		}
	}
}

ll solve(int u, bool f){
	if(dp[u] == -1){
		if(dists[u] + distt[u] == distt[S]){
			dp[u] = distv[u];
			for(node it : adj[u])
				if((f && dists[u] + it.w == dists[it.u]) || (!f && distt[u] + it.w == distt[it.u]))
					dp[u] = min(solve(it.u, f), dp[u]);
			res = min(res, dp[u] + distu[u]);
		}
		else dp[u] = 1000000000000000000LL;
	}
	return dp[u];
}

int main(){
	scanf("%d %d %d %d %d %d", &N, &M, &S, &T, &U, &V);
	while(M--){
		int u, v, c;
		scanf("%d %d %d", &u, &v, &c);
		adj[u].push_back((node){v, c});
		adj[v].push_back((node){u, c});
	}
	dijkstra(S, dists);
	dijkstra(T, distt);
	dijkstra(U, distu);
	dijkstra(V, distv);
	res = distu[V];
	memset(dp, -1, sizeof(dp));
	solve(T, 0);
	memset(dp, -1, sizeof(dp));
	solve(S, 1);
	printf("%lld\n", res);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void dijkstra(int, ll*)':
commuter_pass.cpp:28:6: warning: unused variable 'w' [-Wunused-variable]
   ll w = it.w;
      ^
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:55: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:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &u, &v, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 598 ms 19616 KB Output is correct
2 Correct 694 ms 19616 KB Output is correct
3 Correct 690 ms 21920 KB Output is correct
4 Correct 510 ms 21920 KB Output is correct
5 Correct 577 ms 21920 KB Output is correct
6 Correct 675 ms 21920 KB Output is correct
7 Correct 772 ms 21920 KB Output is correct
8 Correct 750 ms 21920 KB Output is correct
9 Correct 632 ms 21920 KB Output is correct
10 Correct 508 ms 21920 KB Output is correct
11 Correct 333 ms 21920 KB Output is correct
12 Correct 687 ms 21920 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 747 ms 21920 KB Output is correct
2 Correct 799 ms 21920 KB Output is correct
3 Correct 730 ms 21920 KB Output is correct
4 Correct 719 ms 21920 KB Output is correct
5 Correct 678 ms 21920 KB Output is correct
6 Correct 721 ms 21920 KB Output is correct
7 Correct 794 ms 21920 KB Output is correct
8 Correct 724 ms 21920 KB Output is correct
9 Correct 796 ms 21920 KB Output is correct
10 Correct 788 ms 21920 KB Output is correct
11 Correct 346 ms 21920 KB Output is correct
12 Correct 731 ms 21920 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 21920 KB Output is correct
2 Correct 5 ms 21920 KB Output is correct
3 Correct 7 ms 21920 KB Output is correct
4 Correct 33 ms 21920 KB Output is correct
5 Correct 21 ms 21920 KB Output is correct
6 Correct 9 ms 21920 KB Output is correct
7 Correct 9 ms 21920 KB Output is correct
8 Correct 10 ms 21920 KB Output is correct
9 Correct 8 ms 21920 KB Output is correct
10 Correct 19 ms 21920 KB Output is correct
11 Correct 7 ms 21920 KB Output is correct
12 Correct 7 ms 21920 KB Output is correct
13 Correct 6 ms 21920 KB Output is correct
14 Correct 8 ms 21920 KB Output is correct
15 Correct 8 ms 21920 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 598 ms 19616 KB Output is correct
2 Correct 694 ms 19616 KB Output is correct
3 Correct 690 ms 21920 KB Output is correct
4 Correct 510 ms 21920 KB Output is correct
5 Correct 577 ms 21920 KB Output is correct
6 Correct 675 ms 21920 KB Output is correct
7 Correct 772 ms 21920 KB Output is correct
8 Correct 750 ms 21920 KB Output is correct
9 Correct 632 ms 21920 KB Output is correct
10 Correct 508 ms 21920 KB Output is correct
11 Correct 333 ms 21920 KB Output is correct
12 Correct 687 ms 21920 KB Output is correct
13 Correct 747 ms 21920 KB Output is correct
14 Correct 799 ms 21920 KB Output is correct
15 Correct 730 ms 21920 KB Output is correct
16 Correct 719 ms 21920 KB Output is correct
17 Correct 678 ms 21920 KB Output is correct
18 Correct 721 ms 21920 KB Output is correct
19 Correct 794 ms 21920 KB Output is correct
20 Correct 724 ms 21920 KB Output is correct
21 Correct 796 ms 21920 KB Output is correct
22 Correct 788 ms 21920 KB Output is correct
23 Correct 346 ms 21920 KB Output is correct
24 Correct 731 ms 21920 KB Output is correct
25 Correct 22 ms 21920 KB Output is correct
26 Correct 5 ms 21920 KB Output is correct
27 Correct 7 ms 21920 KB Output is correct
28 Correct 33 ms 21920 KB Output is correct
29 Correct 21 ms 21920 KB Output is correct
30 Correct 9 ms 21920 KB Output is correct
31 Correct 9 ms 21920 KB Output is correct
32 Correct 10 ms 21920 KB Output is correct
33 Correct 8 ms 21920 KB Output is correct
34 Correct 19 ms 21920 KB Output is correct
35 Correct 7 ms 21920 KB Output is correct
36 Correct 7 ms 21920 KB Output is correct
37 Correct 6 ms 21920 KB Output is correct
38 Correct 8 ms 21920 KB Output is correct
39 Correct 8 ms 21920 KB Output is correct
40 Correct 634 ms 25628 KB Output is correct
41 Correct 573 ms 29084 KB Output is correct
42 Correct 545 ms 33284 KB Output is correct
43 Correct 354 ms 33284 KB Output is correct
44 Correct 303 ms 33504 KB Output is correct
45 Correct 565 ms 40980 KB Output is correct
46 Correct 676 ms 43720 KB Output is correct
47 Correct 619 ms 49192 KB Output is correct
48 Correct 318 ms 49192 KB Output is correct
49 Correct 397 ms 54208 KB Output is correct
50 Correct 625 ms 56712 KB Output is correct
51 Correct 523 ms 60040 KB Output is correct