oj.uz

답안 #944161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944161 2024-03-12T09:15:11 Z dwuy Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 265 ms 26864 KB 
#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK "test"
#define int long long

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 200005;

int n, m;
int S, T, U, V;
vector<pii> G[MX];

void nhap(){
    cin >> n >> m;
    cin >> S >> T >> U >> V;
    for(int i=1; i<=m; i++){
        int u, v, c;
        cin >> u >> v >> c;
        G[u].push_back({v, c});
        G[v].push_back({u, c});
    }
}

void dijkstra(int u, int *d){
    for(int i=1; i<=n; i++) d[i] = 1e18;
    priority_queue<pii> Q;
    Q.push({0, u});
    d[u] = 0;
    while(Q.size()){
        int du, u;
        tie(du, u) = Q.top();
        du = -du;
        Q.pop();
        if(du != d[u]) continue;
        for(pii &tmp: G[u]){
            int v, c; tie(v, c) = tmp;
            c += du;
            if(c < d[v]){
                d[v] = c;
                Q.push({-c, v});
            }
        }
    }
}

int dS[MX];
int dT[MX];
int dU[MX];
int dV[MX];
int f1[MX];
int f2[MX];
void solve(){
    dijkstra(S, dS);
    dijkstra(T, dT);
    dijkstra(U, dU);
    dijkstra(V, dV);
    int ans = dU[V];

    bitset<MX> vist = 0;
    vector<int> vt(n);
    for(int i=1; i<=n; i++) vt[i-1] = i;
    function<bool(const int &, const int &)> comp = [&](const int &a, const int &b){
        return dS[a] < dS[b];
    };
    sort(vt.begin(), vt.end(), comp);
    for(int u: vt) if(dS[u] + dT[u] == dS[T]){
        f1[u] = dU[u];
        f2[u] = dV[u]; 
        for(pii tmp: G[u]){
            int v, c; tie(v, c) = tmp;
            if(dS[v] + c == dS[u]){
                f1[u] = min(f1[u], f1[v]);
                f2[u] = min(f2[u], f2[v]);
            }
        }   
        ans = min({ans, f1[u] + dV[u], f2[u] + dU[u]});
    }
    cout << ans;
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void solve()':
commuter_pass.cpp:75:16: warning: variable 'vist' set but not used [-Wunused-but-set-variable]
   75 |     bitset<MX> vist = 0;
      |                ^~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 224 ms 25716 KB Output is correct
2 Correct 223 ms 25672 KB Output is correct
3 Correct 211 ms 26484 KB Output is correct
4 Correct 193 ms 25708 KB Output is correct
5 Correct 192 ms 25444 KB Output is correct
6 Correct 238 ms 26864 KB Output is correct
7 Correct 250 ms 25616 KB Output is correct
8 Correct 240 ms 25940 KB Output is correct
9 Correct 200 ms 25464 KB Output is correct
10 Correct 202 ms 25380 KB Output is correct
11 Correct 78 ms 20480 KB Output is correct
12 Correct 242 ms 25484 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 25660 KB Output is correct
2 Correct 228 ms 25848 KB Output is correct
3 Correct 265 ms 25540 KB Output is correct
4 Correct 209 ms 25676 KB Output is correct
5 Correct 237 ms 25928 KB Output is correct
6 Correct 197 ms 25464 KB Output is correct
7 Correct 261 ms 25620 KB Output is correct
8 Correct 238 ms 25848 KB Output is correct
9 Correct 264 ms 25752 KB Output is correct
10 Correct 253 ms 25652 KB Output is correct
11 Correct 72 ms 20564 KB Output is correct
12 Correct 207 ms 25488 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15704 KB Output is correct
2 Correct 3 ms 14172 KB Output is correct
3 Correct 3 ms 14172 KB Output is correct
4 Correct 12 ms 17020 KB Output is correct
5 Correct 8 ms 15708 KB Output is correct
6 Correct 4 ms 14428 KB Output is correct
7 Correct 4 ms 14428 KB Output is correct
8 Correct 4 ms 14428 KB Output is correct
9 Correct 3 ms 14428 KB Output is correct
10 Correct 8 ms 15576 KB Output is correct
11 Correct 3 ms 14172 KB Output is correct
12 Correct 4 ms 14172 KB Output is correct
13 Correct 4 ms 14172 KB Output is correct
14 Correct 3 ms 14428 KB Output is correct
15 Correct 3 ms 14428 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 224 ms 25716 KB Output is correct
2 Correct 223 ms 25672 KB Output is correct
3 Correct 211 ms 26484 KB Output is correct
4 Correct 193 ms 25708 KB Output is correct
5 Correct 192 ms 25444 KB Output is correct
6 Correct 238 ms 26864 KB Output is correct
7 Correct 250 ms 25616 KB Output is correct
8 Correct 240 ms 25940 KB Output is correct
9 Correct 200 ms 25464 KB Output is correct
10 Correct 202 ms 25380 KB Output is correct
11 Correct 78 ms 20480 KB Output is correct
12 Correct 242 ms 25484 KB Output is correct
13 Correct 240 ms 25660 KB Output is correct
14 Correct 228 ms 25848 KB Output is correct
15 Correct 265 ms 25540 KB Output is correct
16 Correct 209 ms 25676 KB Output is correct
17 Correct 237 ms 25928 KB Output is correct
18 Correct 197 ms 25464 KB Output is correct
19 Correct 261 ms 25620 KB Output is correct
20 Correct 238 ms 25848 KB Output is correct
21 Correct 264 ms 25752 KB Output is correct
22 Correct 253 ms 25652 KB Output is correct
23 Correct 72 ms 20564 KB Output is correct
24 Correct 207 ms 25488 KB Output is correct
25 Correct 8 ms 15704 KB Output is correct
26 Correct 3 ms 14172 KB Output is correct
27 Correct 3 ms 14172 KB Output is correct
28 Correct 12 ms 17020 KB Output is correct
29 Correct 8 ms 15708 KB Output is correct
30 Correct 4 ms 14428 KB Output is correct
31 Correct 4 ms 14428 KB Output is correct
32 Correct 4 ms 14428 KB Output is correct
33 Correct 3 ms 14428 KB Output is correct
34 Correct 8 ms 15576 KB Output is correct
35 Correct 3 ms 14172 KB Output is correct
36 Correct 4 ms 14172 KB Output is correct
37 Correct 4 ms 14172 KB Output is correct
38 Correct 3 ms 14428 KB Output is correct
39 Correct 3 ms 14428 KB Output is correct
40 Correct 192 ms 25244 KB Output is correct
41 Correct 212 ms 25476 KB Output is correct
42 Correct 197 ms 25472 KB Output is correct
43 Correct 79 ms 20560 KB Output is correct
44 Correct 71 ms 20564 KB Output is correct
45 Correct 180 ms 25644 KB Output is correct
46 Correct 173 ms 25612 KB Output is correct
47 Correct 192 ms 25576 KB Output is correct
48 Correct 81 ms 20564 KB Output is correct
49 Correct 178 ms 25308 KB Output is correct
50 Correct 181 ms 25552 KB Output is correct
51 Correct 204 ms 25516 KB Output is correct