oj.uz

답안 #781275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781275 2023-07-13T01:45:35 Z andecaandeci Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 330 ms 36172 KB 
#include <bits/stdc++.h>
using namespace std;

# define int long long
# define fir first
# define sec second
# define pb push_back

const int cnst = 2e5+5;
bool mutipletestcase = 0;
//bool debug = false;

int n, m;
int s, t, u, v;
int shor[cnst];
int dis[cnst];
int dist[cnst];
vector<pair<int, int>> vec[cnst];

void djikstrast() {
    bool vis[n+5];
    priority_queue<tuple<int, int>, vector<tuple<int, int>>, greater<tuple<int, int>>> pq;

    pq.push({0, s});
    memset(vis, 0, sizeof(vis));

    while(!pq.empty()) {
        auto[x, idx] = pq.top(); pq.pop();

        if(vis[idx]) continue;
        vis[idx] = 1;
        dis[idx] = x;

        for(auto v: vec[idx]) {
            if(!vis[v.fir]) pq.push({x+v.sec, v.fir});
        }
    }

    pq.push({0, t});
    memset(vis, 0, sizeof(vis)); 

    while(!pq.empty()) {
        auto[x, idx] = pq.top(); pq.pop();

        if(vis[idx]) continue;
        vis[idx] = 1;
        dist[idx] = x;

        for(auto v: vec[idx]) {
            if(!vis[v.fir]) pq.push({x+v.sec, v.fir});
        }
    }

    for(int i = 1; i<=n; i++) if(dis[i]+dist[i] == dis[t]) shor[i] = 1;

    // for(int i = 1; i<=n; i++) cerr << shor[i] << " "; cerr << endl;
    // for(int i = 1; i<=n; i++) cerr << dis[i] << " "; cerr << endl;
}

void djikstrauv() {
    bool vis[n+5][5];
    memset(vis, 0, sizeof(vis));

    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> pq;
    pq.push({0, u, 0});

    if(shor[u]) pq.push({0, u, 1}), pq.push({0, u, 2});

    while(!pq.empty()) {
        auto[x, idx, id] = pq.top(); pq.pop();

        if(vis[idx][id] || idx == 0) continue;
        vis[idx][id] = 1;

        // cerr << x << " " << idx << " " << id << endl;

        if(idx == v) {
            cout << x << endl; return;
        }

        if(id == 0) {
            for(auto v: vec[idx]) {
                if(!vis[v.fir][0]) pq.push({x+v.sec, v.fir, 0});
                if(shor[v.fir] && shor[idx]) {
                    if(!vis[v.fir][1] && dis[v.fir] < dis[idx]) pq.push({x, v.fir, 1});
                    if(!vis[v.fir][2] && dis[v.fir] > dis[idx]) pq.push({x, v.fir, 2});
                }
            }
        }
        else if(id == 1) {
            for(auto v: vec[idx]) {
                if(!vis[v.fir][3]) pq.push({x+v.sec, v.fir, 3});
                if(shor[v.fir] && dis[v.fir] < dis[idx]) pq.push({x, v.fir, 1});
            }
        }
        else if(id == 2) {
            for(auto v: vec[idx]) {
                if(!vis[v.fir][3]) pq.push({x+v.sec, v.fir, 3});
                if(shor[v.fir] && dis[v.fir] > dis[idx]) pq.push({x, v.fir, 2});
            }
        }
        else {
            for(auto v: vec[idx]) if(!vis[v.fir][3]) pq.push({x+v.sec, v.fir, 3});
        }
    }
}
 
void solve() {
    cin >> n >> m >> s >> t >> u >> v;

    for(int i = 1; i<=m; i++) {
        int a, b, c; cin >> a >> b >> c;
        vec[a].pb({b, c});
        vec[b].pb({a, c});
    }

    djikstrast();
    djikstrauv();
}

signed main() {
    ios_base::sync_with_stdio(false);
    int t = 1;
    if(mutipletestcase) cin >> t; 
    while(t--) solve();
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 219 ms 26844 KB Output is correct
2 Correct 210 ms 27584 KB Output is correct
3 Correct 303 ms 33704 KB Output is correct
4 Correct 232 ms 26904 KB Output is correct
5 Correct 266 ms 27508 KB Output is correct
6 Correct 275 ms 26756 KB Output is correct
7 Correct 148 ms 19728 KB Output is correct
8 Correct 181 ms 27652 KB Output is correct
9 Correct 211 ms 31136 KB Output is correct
10 Correct 186 ms 31068 KB Output is correct
11 Correct 85 ms 18280 KB Output is correct
12 Correct 169 ms 22844 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 222 ms 24012 KB Output is correct
2 Correct 220 ms 27604 KB Output is correct
3 Correct 162 ms 21316 KB Output is correct
4 Correct 141 ms 19424 KB Output is correct
5 Correct 214 ms 27652 KB Output is correct
6 Correct 330 ms 33656 KB Output is correct
7 Correct 192 ms 33632 KB Output is correct
8 Correct 245 ms 27772 KB Output is correct
9 Correct 171 ms 27760 KB Output is correct
10 Correct 182 ms 23844 KB Output is correct
11 Correct 104 ms 16520 KB Output is correct
12 Correct 316 ms 33912 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 7188 KB Output is correct
2 Correct 3 ms 5036 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 27 ms 9180 KB Output is correct
5 Correct 13 ms 7552 KB Output is correct
6 Correct 3 ms 5104 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5296 KB Output is correct
9 Correct 3 ms 5176 KB Output is correct
10 Correct 25 ms 9124 KB Output is correct
11 Correct 4 ms 5032 KB Output is correct
12 Correct 2 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5016 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 219 ms 26844 KB Output is correct
2 Correct 210 ms 27584 KB Output is correct
3 Correct 303 ms 33704 KB Output is correct
4 Correct 232 ms 26904 KB Output is correct
5 Correct 266 ms 27508 KB Output is correct
6 Correct 275 ms 26756 KB Output is correct
7 Correct 148 ms 19728 KB Output is correct
8 Correct 181 ms 27652 KB Output is correct
9 Correct 211 ms 31136 KB Output is correct
10 Correct 186 ms 31068 KB Output is correct
11 Correct 85 ms 18280 KB Output is correct
12 Correct 169 ms 22844 KB Output is correct
13 Correct 222 ms 24012 KB Output is correct
14 Correct 220 ms 27604 KB Output is correct
15 Correct 162 ms 21316 KB Output is correct
16 Correct 141 ms 19424 KB Output is correct
17 Correct 214 ms 27652 KB Output is correct
18 Correct 330 ms 33656 KB Output is correct
19 Correct 192 ms 33632 KB Output is correct
20 Correct 245 ms 27772 KB Output is correct
21 Correct 171 ms 27760 KB Output is correct
22 Correct 182 ms 23844 KB Output is correct
23 Correct 104 ms 16520 KB Output is correct
24 Correct 316 ms 33912 KB Output is correct
25 Correct 14 ms 7188 KB Output is correct
26 Correct 3 ms 5036 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 27 ms 9180 KB Output is correct
29 Correct 13 ms 7552 KB Output is correct
30 Correct 3 ms 5104 KB Output is correct
31 Correct 4 ms 5332 KB Output is correct
32 Correct 4 ms 5296 KB Output is correct
33 Correct 3 ms 5176 KB Output is correct
34 Correct 25 ms 9124 KB Output is correct
35 Correct 4 ms 5032 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5016 KB Output is correct
40 Correct 299 ms 36172 KB Output is correct
41 Correct 178 ms 24080 KB Output is correct
42 Correct 176 ms 26832 KB Output is correct
43 Correct 115 ms 18336 KB Output is correct
44 Correct 81 ms 18452 KB Output is correct
45 Correct 293 ms 29304 KB Output is correct
46 Correct 216 ms 29012 KB Output is correct
47 Correct 192 ms 30896 KB Output is correct
48 Correct 129 ms 17916 KB Output is correct
49 Correct 266 ms 35828 KB Output is correct
50 Correct 262 ms 35560 KB Output is correct
51 Correct 206 ms 22268 KB Output is correct