oj.uz

Submission #42297

# Submission time Handle Problem Language Result Execution time Memory
42297 2018-02-25T15:15:57 Z RezwanArefin01 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 653 ms 21916 KB 
#include <bits/stdc++.h>
using namespace std;

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

const int maxn = 1e5 + 10;
vector<int> adj[maxn], cost[maxn];
vector<ll> du, dv, dt, ds, dp1, dp2;

void dijkstra(int s, int n, vector<ll> &d) {
	for(int i = 0; i < n; i++) d[i] = 1e18;
	priority_queue<ii, vector<ii>, greater<ii> > q;
	q.push({d[s] = 0, s});
	while(!q.empty()) {
		ii x = q.top(); q.pop(); 
		int u = x.second; ll c = x.first;
		for(int i = 0; i < adj[u].size(); i++) {
			int v = adj[u][i]; ll w = cost[u][i];
			if(d[v] > c + w) {
				d[v] = c + w;
				q.push({d[v], v});
			}
		}
	}
}

void compute(int s, int n, vector<ll> &dp, vector<ll> &d) {
	dp.resize(n + 1);
	d.resize(n + 1);
	for(int i = 1; i <= n; i++) {
		dp[i] = du[i]; 
		d[i] = 1e18;
	}
	priority_queue<ii, vector<ii>, greater<ii> > q; 
	q.push({d[s] = 0, s});

	while(!q.empty()) {
		ii x = q.top(); q.pop(); 
		int u = x.second; ll c = x.first;
		for(int i = 0; i < adj[u].size(); i++) {
			int v = adj[u][i]; ll w = cost[u][i];
			if(d[v] == c + w) {
			//	cout << u << " -> " << v << " ";
				d[v] = c + w; 
				dp[v] = min(dp[v], dp[u]);
				//q.push({d[v], v});
			//	cout << dp[u] << " " << dp[v] << endl;
			} else if(d[v] > c + w) {
			//	cout << u << " -> " << v << " " ;
				d[v] = c + w;
				dp[v] = min(du[v], dp[u]);
				q.push({d[v], v});
			//	cout << dp[u] << " " << dp[v] << endl;
			}
		}
	}
}

int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	int n, m, u, v, s, t; 
	scanf("%d %d", &n, &m); 
	scanf("%d %d", &s, &t);
	scanf("%d %d", &u, &v);
	for(int i = 0; i < m; i++) {
		int u, v, c;
		scanf("%d %d %d", &u, &v, &c);
		adj[u].push_back(v);
		adj[v].push_back(u);
		cost[u].push_back(c);
		cost[v].push_back(c);
	}	

	du.resize(n + 1);
	dv.resize(n + 1);
	ds.resize(n + 1);
	dt.resize(n + 1);
	dijkstra(u, n + 1, du);
	dijkstra(v, n + 1, dv);

	compute(s, n, dp1, ds); 
	compute(t, n, dp2, dt);

	ll Min = 1e18;

	for(int i = 1; i <= n; i++) {
		if(ds[t] == ds[i] + dt[i]) {
			Min = min(Min, dv[i] + min(dp1[i], dp2[i]));
		}
	}
	cout << min(Min, du[v]) << endl;

}

Compilation message

commuter_pass.cpp: In function 'void dijkstra(int, int, std::vector<long long int>&)':
commuter_pass.cpp:18:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < adj[u].size(); i++) {
                    ^
commuter_pass.cpp: In function 'void compute(int, int, std::vector<long long int>&, std::vector<long long int>&)':
commuter_pass.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < adj[u].size(); i++) {
                    ^
commuter_pass.cpp: In function 'int main(int, const char**)':
commuter_pass.cpp:65:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m); 
                        ^
commuter_pass.cpp:66:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &s, &t);
                        ^
commuter_pass.cpp:67:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &u, &v);
                        ^
commuter_pass.cpp:70:32: 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 536 ms 21216 KB Output is correct
2 Correct 539 ms 21216 KB Output is correct
3 Correct 541 ms 21532 KB Output is correct
4 Correct 585 ms 21532 KB Output is correct
5 Correct 538 ms 21532 KB Output is correct
6 Correct 552 ms 21916 KB Output is correct
7 Correct 542 ms 21916 KB Output is correct
8 Correct 614 ms 21916 KB Output is correct
9 Correct 513 ms 21916 KB Output is correct
10 Correct 491 ms 21916 KB Output is correct
11 Correct 262 ms 21916 KB Output is correct
12 Correct 653 ms 21916 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 21916 KB Output is correct
2 Correct 621 ms 21916 KB Output is correct
3 Correct 568 ms 21916 KB Output is correct
4 Correct 587 ms 21916 KB Output is correct
5 Correct 609 ms 21916 KB Output is correct
6 Correct 565 ms 21916 KB Output is correct
7 Correct 605 ms 21916 KB Output is correct
8 Correct 574 ms 21916 KB Output is correct
9 Correct 543 ms 21916 KB Output is correct
10 Correct 555 ms 21916 KB Output is correct
11 Correct 248 ms 21916 KB Output is correct
12 Correct 528 ms 21916 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 21916 KB Output is correct
2 Correct 6 ms 21916 KB Output is correct
3 Correct 5 ms 21916 KB Output is correct
4 Correct 27 ms 21916 KB Output is correct
5 Correct 15 ms 21916 KB Output is correct
6 Correct 6 ms 21916 KB Output is correct
7 Correct 7 ms 21916 KB Output is correct
8 Correct 7 ms 21916 KB Output is correct
9 Correct 6 ms 21916 KB Output is correct
10 Correct 15 ms 21916 KB Output is correct
11 Correct 5 ms 21916 KB Output is correct
12 Correct 5 ms 21916 KB Output is correct
13 Correct 7 ms 21916 KB Output is correct
14 Correct 6 ms 21916 KB Output is correct
15 Correct 6 ms 21916 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 536 ms 21216 KB Output is correct
2 Correct 539 ms 21216 KB Output is correct
3 Correct 541 ms 21532 KB Output is correct
4 Correct 585 ms 21532 KB Output is correct
5 Correct 538 ms 21532 KB Output is correct
6 Correct 552 ms 21916 KB Output is correct
7 Correct 542 ms 21916 KB Output is correct
8 Correct 614 ms 21916 KB Output is correct
9 Correct 513 ms 21916 KB Output is correct
10 Correct 491 ms 21916 KB Output is correct
11 Correct 262 ms 21916 KB Output is correct
12 Correct 653 ms 21916 KB Output is correct
13 Correct 584 ms 21916 KB Output is correct
14 Correct 621 ms 21916 KB Output is correct
15 Correct 568 ms 21916 KB Output is correct
16 Correct 587 ms 21916 KB Output is correct
17 Correct 609 ms 21916 KB Output is correct
18 Correct 565 ms 21916 KB Output is correct
19 Correct 605 ms 21916 KB Output is correct
20 Correct 574 ms 21916 KB Output is correct
21 Correct 543 ms 21916 KB Output is correct
22 Correct 555 ms 21916 KB Output is correct
23 Correct 248 ms 21916 KB Output is correct
24 Correct 528 ms 21916 KB Output is correct
25 Correct 23 ms 21916 KB Output is correct
26 Correct 6 ms 21916 KB Output is correct
27 Correct 5 ms 21916 KB Output is correct
28 Correct 27 ms 21916 KB Output is correct
29 Correct 15 ms 21916 KB Output is correct
30 Correct 6 ms 21916 KB Output is correct
31 Correct 7 ms 21916 KB Output is correct
32 Correct 7 ms 21916 KB Output is correct
33 Correct 6 ms 21916 KB Output is correct
34 Correct 15 ms 21916 KB Output is correct
35 Correct 5 ms 21916 KB Output is correct
36 Correct 5 ms 21916 KB Output is correct
37 Correct 7 ms 21916 KB Output is correct
38 Correct 6 ms 21916 KB Output is correct
39 Correct 6 ms 21916 KB Output is correct
40 Correct 480 ms 21916 KB Output is correct
41 Correct 519 ms 21916 KB Output is correct
42 Correct 527 ms 21916 KB Output is correct
43 Correct 243 ms 21916 KB Output is correct
44 Correct 252 ms 21916 KB Output is correct
45 Correct 455 ms 21916 KB Output is correct
46 Correct 441 ms 21916 KB Output is correct
47 Correct 496 ms 21916 KB Output is correct
48 Correct 241 ms 21916 KB Output is correct
49 Correct 412 ms 21916 KB Output is correct
50 Correct 469 ms 21916 KB Output is correct
51 Correct 473 ms 21916 KB Output is correct