oj.uz

답안 #947218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947218 2024-03-15T17:08:49 Z steveonalex Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 269 ms 28552 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, char separator = ' ', char finish = '\n'){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct P{
    long i; ll w;
    P(){}
    P(long _i, ll _w){
        i = _i, w = _w;
    }
};

struct compare{
    bool operator () (P a, P b){return a.w > b.w;}
};

const long N = 1e5 + 69;
const ll INF = 1e18 + 69;
long n, m;
long s, t, u, v;
vector<P> graph[N];
vector<ll> disS, disT, disU, disV;

void dijkstra(long u, vector<ll> &dis){
    dis.resize(n+1);
    for(long i = 1; i<=n; ++i) dis[i] = INF;
    dis[u] = 0;
    priority_queue<P, vector<P>, compare> pq;
    pq.push(P(u, 0));
    while(pq.size()){
        P u = pq.top();
        pq.pop();

        for(P v: graph[u.i])
        if (minimize(dis[v.i], dis[u.i] + v.w))
            pq.push(P(v.i, dis[v.i]));
    }
}

ll skill_cap;
bool visited[N];
pair<ll, ll> dp[N];

void dfs(long u){
    if (visited[u]) return;
    visited[u] = true;
    dp[u] = {disU[u], disV[u]};
    for(P v: graph[u])
    if (disS[v.i] == disS[u] + v.w && disS[v.i] + disT[v.i] == skill_cap){
        dfs(v.i);
        pair<ll, ll> cur = dp[v.i];
        minimize(cur.first, disU[u]);
        minimize(cur.second, disV[u]);
        if (cur.first + cur.second < dp[u].first + dp[u].second)
            dp[u] = cur;
    }
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;
    cin >> s >> t >> u >> v;
    for(long i = 1; i<=m; ++i){
        long u, v, w; cin >> u >> v >> w;
        graph[u].push_back(P(v, w));
        graph[v].push_back(P(u, w));
    }

    dijkstra(s, disS);
    dijkstra(t, disT);
    dijkstra(u, disU);
    dijkstra(v, disV);

    skill_cap = disS[t];
    ll ans = disU[v];
    dfs(s);
    minimize(ans, dp[s].first + dp[s].second);
    cout << ans << "\n";

    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 24628 KB Output is correct
2 Correct 201 ms 23232 KB Output is correct
3 Correct 191 ms 28552 KB Output is correct
4 Correct 160 ms 24676 KB Output is correct
5 Correct 172 ms 22812 KB Output is correct
6 Correct 172 ms 24808 KB Output is correct
7 Correct 206 ms 22920 KB Output is correct
8 Correct 203 ms 22904 KB Output is correct
9 Correct 204 ms 23760 KB Output is correct
10 Correct 129 ms 23864 KB Output is correct
11 Correct 67 ms 18116 KB Output is correct
12 Correct 188 ms 23820 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 23832 KB Output is correct
2 Correct 227 ms 24116 KB Output is correct
3 Correct 269 ms 23516 KB Output is correct
4 Correct 203 ms 23768 KB Output is correct
5 Correct 210 ms 24304 KB Output is correct
6 Correct 185 ms 26260 KB Output is correct
7 Correct 215 ms 26580 KB Output is correct
8 Correct 206 ms 24072 KB Output is correct
9 Correct 200 ms 24424 KB Output is correct
10 Correct 247 ms 23908 KB Output is correct
11 Correct 67 ms 19796 KB Output is correct
12 Correct 216 ms 26776 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5980 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 11 ms 7772 KB Output is correct
5 Correct 6 ms 5980 KB Output is correct
6 Correct 3 ms 4188 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 6 ms 5976 KB Output is correct
11 Correct 2 ms 4184 KB Output is correct
12 Correct 1 ms 4188 KB Output is correct
13 Correct 2 ms 4188 KB Output is correct
14 Correct 2 ms 4188 KB Output is correct
15 Correct 2 ms 4188 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 24628 KB Output is correct
2 Correct 201 ms 23232 KB Output is correct
3 Correct 191 ms 28552 KB Output is correct
4 Correct 160 ms 24676 KB Output is correct
5 Correct 172 ms 22812 KB Output is correct
6 Correct 172 ms 24808 KB Output is correct
7 Correct 206 ms 22920 KB Output is correct
8 Correct 203 ms 22904 KB Output is correct
9 Correct 204 ms 23760 KB Output is correct
10 Correct 129 ms 23864 KB Output is correct
11 Correct 67 ms 18116 KB Output is correct
12 Correct 188 ms 23820 KB Output is correct
13 Correct 187 ms 23832 KB Output is correct
14 Correct 227 ms 24116 KB Output is correct
15 Correct 269 ms 23516 KB Output is correct
16 Correct 203 ms 23768 KB Output is correct
17 Correct 210 ms 24304 KB Output is correct
18 Correct 185 ms 26260 KB Output is correct
19 Correct 215 ms 26580 KB Output is correct
20 Correct 206 ms 24072 KB Output is correct
21 Correct 200 ms 24424 KB Output is correct
22 Correct 247 ms 23908 KB Output is correct
23 Correct 67 ms 19796 KB Output is correct
24 Correct 216 ms 26776 KB Output is correct
25 Correct 6 ms 5980 KB Output is correct
26 Correct 2 ms 4188 KB Output is correct
27 Correct 2 ms 4188 KB Output is correct
28 Correct 11 ms 7772 KB Output is correct
29 Correct 6 ms 5980 KB Output is correct
30 Correct 3 ms 4188 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 6 ms 5976 KB Output is correct
35 Correct 2 ms 4184 KB Output is correct
36 Correct 1 ms 4188 KB Output is correct
37 Correct 2 ms 4188 KB Output is correct
38 Correct 2 ms 4188 KB Output is correct
39 Correct 2 ms 4188 KB Output is correct
40 Correct 193 ms 24536 KB Output is correct
41 Correct 161 ms 23676 KB Output is correct
42 Correct 183 ms 23968 KB Output is correct
43 Correct 67 ms 18876 KB Output is correct
44 Correct 65 ms 18884 KB Output is correct
45 Correct 180 ms 22160 KB Output is correct
46 Correct 155 ms 22432 KB Output is correct
47 Correct 170 ms 24576 KB Output is correct
48 Correct 67 ms 15700 KB Output is correct
49 Correct 133 ms 24280 KB Output is correct
50 Correct 204 ms 23000 KB Output is correct
51 Correct 182 ms 22752 KB Output is correct