oj.uz

Submission #530984

# Submission time Handle Problem Language Result Execution time Memory
530984 2022-02-27T09:12:51 Z john_wick Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 503 ms 30892 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
typedef pair<int,int> pp;
bool com(pp x, pp y){
    if(x.ff == y.ff) return x.ss < y.ss;
    return x.ff < y.ff;
}
ll power(ll x, ll y){
    ll prod = 1;
    while(y){
        if(y & 1) prod = (prod * x) % mod;
        x = (x * x) % mod;
        y /= 2;
    }
    return prod;
}
const int N = 2e5 + 7;
int tc = 1;
vector<pair<int, ll>> vtx[N];
ll ds[N];
void dijsktra(int s, ll *d, int n){
    vector<int> vis(n + 1);
    priority_queue<pair<ll, int>> q;
    q.push({0, s});
    while(!q.empty()){
        ll c = q.top().ff;
        int u = q.top().ss;
        q.pop();
        if(!vis[u]){
            d[u] = -c;
            vis[u] = 1;
            for(auto v : vtx[u]){
                q.push({c - v.ss, v.ff}); 
            }
        }
    }
}
void dijstra2(int s, int t, ll *du, ll *dv, int n, ll &ans){
    vector<int> vis(n + 1);
    ll dp[2][n + 2];
    for(int i = 0; i <= n; i++) dp[0][i] = dp[1][i] = 1e15;
    priority_queue<pair<ll, pair<int, int>>> q;
    q.push({0, {s, 0}});
    while(!q.empty()){
        ll c;
        int node, par;
        c = q.top().first;
        node = q.top().second.first;
        par = q.top().second.second;
        q.pop();

        if (!vis[node]) {
			vis[node] = 1;
			ds[node] = -c;
			dp[0][node] = min(du[node], dp[0][par]);
			dp[1][node] = min(dv[node], dp[1][par]);
			for (auto v : vtx[node]) q.push({c - v.second, {v.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][t] + dp[1][t]);
}
void solve(){
    int n, m;
    cin >> n >> m;
    int s, t;
    cin >> s >> t;
    int u, v;
    cin >> u >> v;
    for(int i = 0; i < m; i++){
        int uu, vv;
        ll w;
        cin >> uu >> vv >> w;
        vtx[uu].pb({vv, w});
        vtx[vv].pb({uu, w});
    }
    ll du[n + 1], dv[n + 1];
    dijsktra(u, du, n);
    dijsktra(v, dv, n);

    ll ans = du[v];
    dijstra2(s, t, du, dv, n, ans);
    dijstra2(t, s, du, dv, n, ans);
    cout << ans << "\n";
    // cout << "Case #" << tc << ": " << ans + k << "\n";
    // tc++;
}
int main(){
    ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0); 
	int t = 1;
	// cin >> t;
	while (t--) 
	    solve();
	return 0; 
}
/*
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 30468 KB Output is correct
2 Correct 421 ms 29600 KB Output is correct
3 Correct 433 ms 29580 KB Output is correct
4 Correct 483 ms 29800 KB Output is correct
5 Correct 434 ms 27044 KB Output is correct
6 Correct 492 ms 30128 KB Output is correct
7 Correct 442 ms 29388 KB Output is correct
8 Correct 425 ms 29636 KB Output is correct
9 Correct 491 ms 30712 KB Output is correct
10 Correct 503 ms 30892 KB Output is correct
11 Correct 129 ms 16544 KB Output is correct
12 Correct 464 ms 30880 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 29904 KB Output is correct
2 Correct 412 ms 27116 KB Output is correct
3 Correct 433 ms 29468 KB Output is correct
4 Correct 421 ms 27200 KB Output is correct
5 Correct 426 ms 27364 KB Output is correct
6 Correct 422 ms 29468 KB Output is correct
7 Correct 425 ms 27000 KB Output is correct
8 Correct 416 ms 27188 KB Output is correct
9 Correct 409 ms 27104 KB Output is correct
10 Correct 410 ms 29344 KB Output is correct
11 Correct 122 ms 16620 KB Output is correct
12 Correct 417 ms 29504 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7636 KB Output is correct
2 Correct 4 ms 5020 KB Output is correct
3 Correct 4 ms 4976 KB Output is correct
4 Correct 68 ms 10316 KB Output is correct
5 Correct 36 ms 8332 KB Output is correct
6 Correct 5 ms 5196 KB Output is correct
7 Correct 6 ms 5196 KB Output is correct
8 Correct 8 ms 5324 KB Output is correct
9 Correct 5 ms 5324 KB Output is correct
10 Correct 34 ms 8244 KB Output is correct
11 Correct 3 ms 5016 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 4 ms 5024 KB Output is correct
15 Correct 4 ms 5152 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 30468 KB Output is correct
2 Correct 421 ms 29600 KB Output is correct
3 Correct 433 ms 29580 KB Output is correct
4 Correct 483 ms 29800 KB Output is correct
5 Correct 434 ms 27044 KB Output is correct
6 Correct 492 ms 30128 KB Output is correct
7 Correct 442 ms 29388 KB Output is correct
8 Correct 425 ms 29636 KB Output is correct
9 Correct 491 ms 30712 KB Output is correct
10 Correct 503 ms 30892 KB Output is correct
11 Correct 129 ms 16544 KB Output is correct
12 Correct 464 ms 30880 KB Output is correct
13 Correct 481 ms 29904 KB Output is correct
14 Correct 412 ms 27116 KB Output is correct
15 Correct 433 ms 29468 KB Output is correct
16 Correct 421 ms 27200 KB Output is correct
17 Correct 426 ms 27364 KB Output is correct
18 Correct 422 ms 29468 KB Output is correct
19 Correct 425 ms 27000 KB Output is correct
20 Correct 416 ms 27188 KB Output is correct
21 Correct 409 ms 27104 KB Output is correct
22 Correct 410 ms 29344 KB Output is correct
23 Correct 122 ms 16620 KB Output is correct
24 Correct 417 ms 29504 KB Output is correct
25 Correct 36 ms 7636 KB Output is correct
26 Correct 4 ms 5020 KB Output is correct
27 Correct 4 ms 4976 KB Output is correct
28 Correct 68 ms 10316 KB Output is correct
29 Correct 36 ms 8332 KB Output is correct
30 Correct 5 ms 5196 KB Output is correct
31 Correct 6 ms 5196 KB Output is correct
32 Correct 8 ms 5324 KB Output is correct
33 Correct 5 ms 5324 KB Output is correct
34 Correct 34 ms 8244 KB Output is correct
35 Correct 3 ms 5016 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 4 ms 5024 KB Output is correct
39 Correct 4 ms 5152 KB Output is correct
40 Correct 462 ms 30024 KB Output is correct
41 Correct 492 ms 30516 KB Output is correct
42 Correct 478 ms 30688 KB Output is correct
43 Correct 140 ms 16556 KB Output is correct
44 Correct 135 ms 16948 KB Output is correct
45 Correct 413 ms 26104 KB Output is correct
46 Correct 453 ms 26072 KB Output is correct
47 Correct 452 ms 27276 KB Output is correct
48 Correct 145 ms 16156 KB Output is correct
49 Correct 449 ms 28844 KB Output is correct
50 Correct 419 ms 26168 KB Output is correct
51 Correct 417 ms 26232 KB Output is correct