oj.uz

Submission #781276

# Submission time Handle Problem Language Result Execution time Memory
781276 2023-07-13T01:46:39 Z Owen11 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 315 ms 33692 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();
}

Compilation message

commuter_pass.cpp: In function 'void djikstrast()':
commuter_pass.cpp:28:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   28 |         auto[x, idx] = pq.top(); pq.pop();
      |             ^
commuter_pass.cpp:43:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |         auto[x, idx] = pq.top(); pq.pop();
      |             ^
commuter_pass.cpp: In function 'void djikstrauv()':
commuter_pass.cpp:70:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |         auto[x, idx, id] = pq.top(); pq.pop();
      |             ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 26744 KB Output is correct
2 Correct 195 ms 27460 KB Output is correct
3 Correct 315 ms 33692 KB Output is correct
4 Correct 239 ms 26732 KB Output is correct
5 Correct 244 ms 27396 KB Output is correct
6 Correct 235 ms 26612 KB Output is correct
7 Correct 152 ms 19588 KB Output is correct
8 Correct 166 ms 24224 KB Output is correct
9 Correct 192 ms 26732 KB Output is correct
10 Correct 188 ms 26628 KB Output is correct
11 Correct 85 ms 16220 KB Output is correct
12 Correct 149 ms 18660 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 23948 KB Output is correct
2 Correct 217 ms 27492 KB Output is correct
3 Correct 165 ms 21192 KB Output is correct
4 Correct 144 ms 19292 KB Output is correct
5 Correct 220 ms 27424 KB Output is correct
6 Correct 298 ms 33584 KB Output is correct
7 Correct 188 ms 33620 KB Output is correct
8 Correct 237 ms 27512 KB Output is correct
9 Correct 189 ms 27424 KB Output is correct
10 Correct 172 ms 23592 KB Output is correct
11 Correct 101 ms 16220 KB Output is correct
12 Correct 293 ms 33600 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 7036 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 26 ms 8436 KB Output is correct
5 Correct 13 ms 7100 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 3 ms 5152 KB Output is correct
10 Correct 27 ms 8648 KB Output is correct
11 Correct 3 ms 5076 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 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 26744 KB Output is correct
2 Correct 195 ms 27460 KB Output is correct
3 Correct 315 ms 33692 KB Output is correct
4 Correct 239 ms 26732 KB Output is correct
5 Correct 244 ms 27396 KB Output is correct
6 Correct 235 ms 26612 KB Output is correct
7 Correct 152 ms 19588 KB Output is correct
8 Correct 166 ms 24224 KB Output is correct
9 Correct 192 ms 26732 KB Output is correct
10 Correct 188 ms 26628 KB Output is correct
11 Correct 85 ms 16220 KB Output is correct
12 Correct 149 ms 18660 KB Output is correct
13 Correct 159 ms 23948 KB Output is correct
14 Correct 217 ms 27492 KB Output is correct
15 Correct 165 ms 21192 KB Output is correct
16 Correct 144 ms 19292 KB Output is correct
17 Correct 220 ms 27424 KB Output is correct
18 Correct 298 ms 33584 KB Output is correct
19 Correct 188 ms 33620 KB Output is correct
20 Correct 237 ms 27512 KB Output is correct
21 Correct 189 ms 27424 KB Output is correct
22 Correct 172 ms 23592 KB Output is correct
23 Correct 101 ms 16220 KB Output is correct
24 Correct 293 ms 33600 KB Output is correct
25 Correct 13 ms 7036 KB Output is correct
26 Correct 2 ms 5076 KB Output is correct
27 Correct 2 ms 5076 KB Output is correct
28 Correct 26 ms 8436 KB Output is correct
29 Correct 13 ms 7100 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5332 KB Output is correct
32 Correct 4 ms 5204 KB Output is correct
33 Correct 3 ms 5152 KB Output is correct
34 Correct 27 ms 8648 KB Output is correct
35 Correct 3 ms 5076 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 5076 KB Output is correct
40 Correct 245 ms 31876 KB Output is correct
41 Correct 155 ms 19860 KB Output is correct
42 Correct 177 ms 22556 KB Output is correct
43 Correct 86 ms 16216 KB Output is correct
44 Correct 83 ms 16256 KB Output is correct
45 Correct 233 ms 25876 KB Output is correct
46 Correct 245 ms 25860 KB Output is correct
47 Correct 206 ms 27000 KB Output is correct
48 Correct 107 ms 16256 KB Output is correct
49 Correct 287 ms 31880 KB Output is correct
50 Correct 249 ms 32112 KB Output is correct
51 Correct 142 ms 18756 KB Output is correct