oj.uz

답안 #955220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955220 2024-03-29T17:48:51 Z sandry24 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 252 ms 21788 KB 
#include <bits/stdc++.h>
using namespace std;
 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

ll ans;
const ll maxn = 1e5+5, INF = 1e18;
vector<vector<pi>> adj(maxn);
vector<ll> distS(maxn, INF), distT(maxn, INF), distU(maxn, INF), distV(maxn, INF);
vector<ll> distUM(maxn, INF), distVM(maxn, INF); //dist from U and V to nodes on short paths

void Dijkstra(ll x, vector<ll> &dist){
    dist[x] = 0;
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> q;
    q.push({0, x});
    while(!q.empty()){
        int a = q.top().s;
        q.pop();
        for(auto u : adj[a]){
            int b = u.f, w = u.s;
            if(dist[a] + w < dist[b]){
                dist[b] = dist[a] + w;
                q.push({dist[b], b});
            }
        }
    }
}

void solve(){
    int n, m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    for(int i = 0; i < m; i++){
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].pb({b, c});
        adj[b].pb({a, c});
    }

    Dijkstra(s, distS);
    Dijkstra(t, distT);
    Dijkstra(u, distU);
    Dijkstra(v, distV);

    ll ans = distU[v];
    vector<pair<ll, ll>> on_path;
    for(int i = 1; i <= n; i++)
        if(distS[i] + distT[i] == distS[t])
            on_path.pb({distS[i], i});
    sort(on_path.begin(), on_path.end()); //to not take 2 different paths in ans

    for(auto i : on_path){
        int x = i.s;
        distUM[x] = distU[x];
        distVM[x] = distV[x];
        for(auto j : adj[x]){
            if(distS[j.f] + j.s == distS[x]){ //we alr processed this node
                distUM[x] = min(distUM[x], distUM[j.f]);
                distVM[x] = min(distVM[x], distVM[j.f]);
            }
        }
        ans = min(ans, distUM[x] + distV[x]);
        ans = min(ans, distVM[x] + distU[x]);
    }

    cout << ans << '\n';
} 
 
int main(){
    // freopen("monede.in", "r", stdin);
    // freopen("monede.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 20768 KB Output is correct
2 Correct 204 ms 19212 KB Output is correct
3 Correct 185 ms 20424 KB Output is correct
4 Correct 171 ms 20484 KB Output is correct
5 Correct 171 ms 18996 KB Output is correct
6 Correct 198 ms 20844 KB Output is correct
7 Correct 199 ms 19020 KB Output is correct
8 Correct 182 ms 19152 KB Output is correct
9 Correct 165 ms 19792 KB Output is correct
10 Correct 142 ms 20068 KB Output is correct
11 Correct 60 ms 13796 KB Output is correct
12 Correct 252 ms 19788 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 19564 KB Output is correct
2 Correct 199 ms 19132 KB Output is correct
3 Correct 188 ms 19092 KB Output is correct
4 Correct 207 ms 19128 KB Output is correct
5 Correct 197 ms 19140 KB Output is correct
6 Correct 185 ms 19400 KB Output is correct
7 Correct 214 ms 20244 KB Output is correct
8 Correct 202 ms 19128 KB Output is correct
9 Correct 235 ms 19004 KB Output is correct
10 Correct 194 ms 19124 KB Output is correct
11 Correct 61 ms 13768 KB Output is correct
12 Correct 183 ms 19360 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8792 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 4 ms 7532 KB Output is correct
4 Correct 12 ms 9564 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 4 ms 7516 KB Output is correct
8 Correct 4 ms 7516 KB Output is correct
9 Correct 4 ms 7528 KB Output is correct
10 Correct 8 ms 8540 KB Output is correct
11 Correct 3 ms 7516 KB Output is correct
12 Correct 4 ms 7516 KB Output is correct
13 Correct 4 ms 7516 KB Output is correct
14 Correct 4 ms 7516 KB Output is correct
15 Correct 3 ms 7520 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 20768 KB Output is correct
2 Correct 204 ms 19212 KB Output is correct
3 Correct 185 ms 20424 KB Output is correct
4 Correct 171 ms 20484 KB Output is correct
5 Correct 171 ms 18996 KB Output is correct
6 Correct 198 ms 20844 KB Output is correct
7 Correct 199 ms 19020 KB Output is correct
8 Correct 182 ms 19152 KB Output is correct
9 Correct 165 ms 19792 KB Output is correct
10 Correct 142 ms 20068 KB Output is correct
11 Correct 60 ms 13796 KB Output is correct
12 Correct 252 ms 19788 KB Output is correct
13 Correct 208 ms 19564 KB Output is correct
14 Correct 199 ms 19132 KB Output is correct
15 Correct 188 ms 19092 KB Output is correct
16 Correct 207 ms 19128 KB Output is correct
17 Correct 197 ms 19140 KB Output is correct
18 Correct 185 ms 19400 KB Output is correct
19 Correct 214 ms 20244 KB Output is correct
20 Correct 202 ms 19128 KB Output is correct
21 Correct 235 ms 19004 KB Output is correct
22 Correct 194 ms 19124 KB Output is correct
23 Correct 61 ms 13768 KB Output is correct
24 Correct 183 ms 19360 KB Output is correct
25 Correct 8 ms 8792 KB Output is correct
26 Correct 3 ms 7516 KB Output is correct
27 Correct 4 ms 7532 KB Output is correct
28 Correct 12 ms 9564 KB Output is correct
29 Correct 7 ms 8540 KB Output is correct
30 Correct 4 ms 7516 KB Output is correct
31 Correct 4 ms 7516 KB Output is correct
32 Correct 4 ms 7516 KB Output is correct
33 Correct 4 ms 7528 KB Output is correct
34 Correct 8 ms 8540 KB Output is correct
35 Correct 3 ms 7516 KB Output is correct
36 Correct 4 ms 7516 KB Output is correct
37 Correct 4 ms 7516 KB Output is correct
38 Correct 4 ms 7516 KB Output is correct
39 Correct 3 ms 7520 KB Output is correct
40 Correct 176 ms 21788 KB Output is correct
41 Correct 164 ms 19828 KB Output is correct
42 Correct 168 ms 19872 KB Output is correct
43 Correct 71 ms 14788 KB Output is correct
44 Correct 68 ms 14796 KB Output is correct
45 Correct 160 ms 20044 KB Output is correct
46 Correct 173 ms 19812 KB Output is correct
47 Correct 177 ms 20732 KB Output is correct
48 Correct 69 ms 14280 KB Output is correct
49 Correct 138 ms 20728 KB Output is correct
50 Correct 159 ms 20240 KB Output is correct
51 Correct 166 ms 20384 KB Output is correct