oj.uz

Submission #546787

# Submission time Handle Problem Language Result Execution time Memory
546787 2022-04-08T13:20:25 Z erto Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 570 ms 30420 KB 
#include <bits/stdc++.h>
typedef long long int ll;
#define INF ll(1e18 + 7)
#define N (ll)1e5 + 5
using namespace std;
#define int ll

int n, m, s, t, u2, v, g, h, z, g2, h2, ans;
vector<pair<int, int>> v2[N];
bool used[N];
int ds[N], du[N], dv[N];
pair<int, int> d1[N], d2[N];

void bfs(){
    memset(used, 0, sizeof(used));
    priority_queue<pair<int, int>> q;
    q.push({0, s});
    pair<int, int> p;
    while(!q.empty()){
        p = q.top();
        q.pop();
        if(used[p.second])continue;
        used[p.second] = 1;
        for(auto u : v2[p.second]){
            if(!used[u.first] && ds[u.first] > ds[p.second] + u.second){
                ds[u.first] = ds[p.second] + u.second;
                q.push({-ds[u.first], u.first});
            }
        }
    }
}

void bfs2(){
    memset(used, 0, sizeof(used));
    priority_queue<pair<int, int>> q;
    q.push({0, u2});
    pair<int, int> p;
    while(!q.empty()){
        p = q.top();
        q.pop();
        if(used[p.second])continue;
        used[p.second] = 1;
        for(auto u : v2[p.second]){
            if(!used[u.first] && du[u.first] > du[p.second] + u.second){
                du[u.first] = du[p.second] + u.second;
                q.push({-du[u.first], u.first});
            }
        }
    }
}

void bfs3(){
    memset(used, 0, sizeof(used));
    priority_queue<pair<int, int>> q;
    q.push({0, v});
    pair<int, int> p;
    while(!q.empty()){
        p = q.top();
        q.pop();
        if(used[p.second])continue;
        used[p.second] = 1;
        for(auto u : v2[p.second]){
            if(!used[u.first] && dv[u.first] > dv[p.second] + u.second){
                dv[u.first] = dv[p.second] + u.second;
                q.push({-dv[u.first], u.first});
            }
        }
    }
}
bool visited[N];
int dp[2][N];

void dijkstra2(ll start, ll end) {
	fill(dp[0], dp[0] + 100001, LLONG_MAX / 2);
	fill(dp[1], dp[1] + 100001, LLONG_MAX / 2);
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, pair<ll, ll>>> pq;
	pq.push({0, {start, 0}});
	dp[0][0] = dp[1][0] = LLONG_MAX/ 2;
	while (!pq.empty()) {
		ll c, node, par;
		pair<ll, ll> p;
		tie(c, p) = pq.top();
		tie(node, par) = p;
		pq.pop();

		if (!visited[node]) {
			visited[node] = true;
			ds[node] = -c;
			dp[0][node] = min(du[node], dp[0][par]);
			dp[1][node] = min(dv[node], dp[1][par]);
			for (auto i : v2[node]) pq.push({c - i.second, {i.first, node}});
		} else if (-c == ds[node]) {
			if (min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) <= dp[0][node] + dp[1][node]) {
				dp[0][node] = min(du[node], dp[0][par]);
				dp[1][node] = min(dv[node], dp[1][par]);
			}
		}
	}

	ans = min(ans, dp[0][end] + dp[1][end]);
}

void solve(){
    cin >> n >> m >> s >> t >> u2 >> v;
    for(int i=0; i<m; i++){
        cin >> g >> h >> z;
        v2[g].push_back({h, z});
        v2[h].push_back({g, z});
    }
    fill(ds, ds+n+1, INF);
    fill(du, du+n+1, INF);
    fill(dv, dv+n+1, INF);
    fill(d1, d1 + n + 1, make_pair(INF, INF));
    fill(d2, d2 + n + 1, make_pair(INF, INF));
    ds[s] = du[u2] = dv[v] = 0;
    bfs();
    bfs2();
    bfs3();

    ans = du[v];
    for(int i=1; i<=n; i++){
        d1[i] = d2[i] = {du[i], dv[i]};
    }
    int t1, t2, t3, t4;

    dijkstra2(s, t);
    dijkstra2(t, s);
    cout<<ans;

}
 
signed main(){
    //freopen("shortcut.in", "r", stdin);
    //freopen("shortcut.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin>>T;
    while (T--){
        solve();
    }
}

Compilation message

commuter_pass.cpp: In function 'void solve()':
commuter_pass.cpp:126:9: warning: unused variable 't1' [-Wunused-variable]
  126 |     int t1, t2, t3, t4;
      |         ^~
commuter_pass.cpp:126:13: warning: unused variable 't2' [-Wunused-variable]
  126 |     int t1, t2, t3, t4;
      |             ^~
commuter_pass.cpp:126:17: warning: unused variable 't3' [-Wunused-variable]
  126 |     int t1, t2, t3, t4;
      |                 ^~
commuter_pass.cpp:126:21: warning: unused variable 't4' [-Wunused-variable]
  126 |     int t1, t2, t3, t4;
      |                     ^~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 30364 KB Output is correct
2 Correct 401 ms 29944 KB Output is correct
3 Correct 397 ms 29472 KB Output is correct
4 Correct 428 ms 29552 KB Output is correct
5 Correct 395 ms 26276 KB Output is correct
6 Correct 458 ms 30252 KB Output is correct
7 Correct 417 ms 29692 KB Output is correct
8 Correct 409 ms 29940 KB Output is correct
9 Correct 437 ms 30252 KB Output is correct
10 Correct 419 ms 29916 KB Output is correct
11 Correct 133 ms 15052 KB Output is correct
12 Correct 442 ms 30420 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 447 ms 30168 KB Output is correct
2 Correct 412 ms 26260 KB Output is correct
3 Correct 411 ms 29444 KB Output is correct
4 Correct 486 ms 26352 KB Output is correct
5 Correct 456 ms 26152 KB Output is correct
6 Correct 470 ms 29392 KB Output is correct
7 Correct 454 ms 26192 KB Output is correct
8 Correct 443 ms 26320 KB Output is correct
9 Correct 492 ms 26160 KB Output is correct
10 Correct 570 ms 29548 KB Output is correct
11 Correct 165 ms 15040 KB Output is correct
12 Correct 446 ms 29512 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 7088 KB Output is correct
2 Correct 3 ms 4436 KB Output is correct
3 Correct 3 ms 4436 KB Output is correct
4 Correct 48 ms 9672 KB Output is correct
5 Correct 25 ms 8196 KB Output is correct
6 Correct 3 ms 4564 KB Output is correct
7 Correct 4 ms 4692 KB Output is correct
8 Correct 6 ms 4820 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 25 ms 8176 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 3 ms 4436 KB Output is correct
13 Correct 3 ms 4528 KB Output is correct
14 Correct 3 ms 4564 KB Output is correct
15 Correct 3 ms 4564 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 30364 KB Output is correct
2 Correct 401 ms 29944 KB Output is correct
3 Correct 397 ms 29472 KB Output is correct
4 Correct 428 ms 29552 KB Output is correct
5 Correct 395 ms 26276 KB Output is correct
6 Correct 458 ms 30252 KB Output is correct
7 Correct 417 ms 29692 KB Output is correct
8 Correct 409 ms 29940 KB Output is correct
9 Correct 437 ms 30252 KB Output is correct
10 Correct 419 ms 29916 KB Output is correct
11 Correct 133 ms 15052 KB Output is correct
12 Correct 442 ms 30420 KB Output is correct
13 Correct 447 ms 30168 KB Output is correct
14 Correct 412 ms 26260 KB Output is correct
15 Correct 411 ms 29444 KB Output is correct
16 Correct 486 ms 26352 KB Output is correct
17 Correct 456 ms 26152 KB Output is correct
18 Correct 470 ms 29392 KB Output is correct
19 Correct 454 ms 26192 KB Output is correct
20 Correct 443 ms 26320 KB Output is correct
21 Correct 492 ms 26160 KB Output is correct
22 Correct 570 ms 29548 KB Output is correct
23 Correct 165 ms 15040 KB Output is correct
24 Correct 446 ms 29512 KB Output is correct
25 Correct 26 ms 7088 KB Output is correct
26 Correct 3 ms 4436 KB Output is correct
27 Correct 3 ms 4436 KB Output is correct
28 Correct 48 ms 9672 KB Output is correct
29 Correct 25 ms 8196 KB Output is correct
30 Correct 3 ms 4564 KB Output is correct
31 Correct 4 ms 4692 KB Output is correct
32 Correct 6 ms 4820 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 25 ms 8176 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 3 ms 4436 KB Output is correct
37 Correct 3 ms 4528 KB Output is correct
38 Correct 3 ms 4564 KB Output is correct
39 Correct 3 ms 4564 KB Output is correct
40 Correct 421 ms 30008 KB Output is correct
41 Correct 444 ms 30216 KB Output is correct
42 Correct 448 ms 30416 KB Output is correct
43 Correct 140 ms 15028 KB Output is correct
44 Correct 123 ms 15152 KB Output is correct
45 Correct 394 ms 25072 KB Output is correct
46 Correct 382 ms 24888 KB Output is correct
47 Correct 447 ms 26204 KB Output is correct
48 Correct 148 ms 15208 KB Output is correct
49 Correct 399 ms 28848 KB Output is correct
50 Correct 384 ms 24924 KB Output is correct
51 Correct 382 ms 25020 KB Output is correct