oj.uz

Submission #698947

# Submission time Handle Problem Language Result Execution time Memory
698947 2023-02-15T00:08:33 Z RandomLB Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 318 ms 39740 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<ll, pi> E;
#define pb push_back
#define siz(x) (int)x.size()
#define ms(x, a) memset(x, a, sizeof(x))
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values){
    cout << vars << " = ";
    string delim = "";
    (...,(cout << delim << values, delim = ", "));
    cout << endl;
}
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
//===========================================
const int MAX = 1e5+5;
vector<pll> adj[MAX];
vector<int> pp[MAX], adj2[MAX], radj[MAX];
ll dis[MAX], dis2[4][MAX];
bool vis[MAX];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n, m; cin >> n >> m;
    int s, t, src, tar;
    cin >> s >> t >> src >> tar;
    for (int i = 1; i <= m; i++){
        int a, b, w; cin >> a >> b >> w;
        adj[a].pb({b, w});
        adj[b].pb({a, w});
    }
    ms(dis, 0x3f3f3f3f);
    ms(dis2, 0x3f3f3f3f);
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    pq.push({dis[s] = 0, s});
    while (siz(pq)){
        auto[d, v] = pq.top(); pq.pop();
        if (d != dis[v]) continue;
        for (auto[u, w]: adj[v]){
            if (dis[u] > dis[v]+w){
                pq.push({dis[u] = dis[v]+w, u});
                pp[u] = {v};
            } else if (dis[u] == dis[v]+w) pp[u].pb(v);
        }
    }
    //for (int i = 1; i <= n; i++) deb(i, dis[i]);
    queue<int> q;
    vis[t] = true; q.push(t);
    while (siz(q)){
        int v = q.front(); q.pop();
        for (int u: pp[v]){
            adj2[v].pb(u);
            radj[u].pb(v);
            if (!vis[u]){ vis[u] = true; q.push(u); }
        }
    }
    priority_queue<E, vector<E>, greater<E>> q2;
    q2.push({dis2[0][src] = 0, {0, src}});
    while (siz(q2)){
        auto[d, x] = q2.top(); q2.pop();
        auto[i, v] = x;
        if (v == tar){ cout << d << "\n"; return 0; }
        if (d != dis2[i][v]) continue;
        for (auto[u, w]: adj[v]){
            int ni = (!i? 0 : 3);
            if (dis2[ni][u] > dis2[i][v]+w){
                q2.push({dis2[ni][u] = dis2[i][v]+w, {ni, u}});
            }
        }
        if (!i || i == 1){
            for (int u: adj2[v]){
                if (dis2[1][u] > dis2[i][v]){
                    q2.push({dis2[1][u] = dis2[i][v], {1, u}});
                }
            }
        }
        if (!i || i == 2){
            for (int u: radj[v]){
                if (dis2[2][u] > dis2[i][v]){
                    q2.push({dis2[2][u] = dis2[i][v], {2, u}});
                }
            }
        }
    }
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:46:26: warning: narrowing conversion of 'v' from 'std::tuple_element<1, std::pair<long long int, long long int> >::type' {aka 'long long int'} to 'int' [-Wnarrowing]
   46 |                 pp[u] = {v};
      |                          ^
commuter_pass.cpp:46:26: warning: narrowing conversion of 'v' from 'std::tuple_element<1, std::pair<long long int, long long int> >::type' {aka 'long long int'} to 'int' [-Wnarrowing]

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 35496 KB Output is correct
2 Correct 233 ms 35004 KB Output is correct
3 Correct 318 ms 39248 KB Output is correct
4 Correct 240 ms 33360 KB Output is correct
5 Correct 314 ms 38180 KB Output is correct
6 Correct 263 ms 35804 KB Output is correct
7 Correct 219 ms 36304 KB Output is correct
8 Correct 219 ms 36492 KB Output is correct
9 Correct 213 ms 33696 KB Output is correct
10 Correct 195 ms 33652 KB Output is correct
11 Correct 172 ms 27556 KB Output is correct
12 Correct 173 ms 31756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 35136 KB Output is correct
2 Correct 251 ms 34964 KB Output is correct
3 Correct 200 ms 33972 KB Output is correct
4 Correct 209 ms 34296 KB Output is correct
5 Correct 242 ms 35300 KB Output is correct
6 Correct 306 ms 38796 KB Output is correct
7 Correct 221 ms 37184 KB Output is correct
8 Correct 271 ms 34980 KB Output is correct
9 Correct 216 ms 35352 KB Output is correct
10 Correct 186 ms 34040 KB Output is correct
11 Correct 167 ms 29844 KB Output is correct
12 Correct 310 ms 39096 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15500 KB Output is correct
2 Correct 7 ms 13572 KB Output is correct
3 Correct 7 ms 13700 KB Output is correct
4 Correct 18 ms 17060 KB Output is correct
5 Correct 13 ms 15368 KB Output is correct
6 Correct 7 ms 13652 KB Output is correct
7 Correct 7 ms 13832 KB Output is correct
8 Correct 8 ms 13828 KB Output is correct
9 Correct 7 ms 13652 KB Output is correct
10 Correct 13 ms 15316 KB Output is correct
11 Correct 7 ms 13652 KB Output is correct
12 Correct 8 ms 13568 KB Output is correct
13 Correct 7 ms 13612 KB Output is correct
14 Correct 9 ms 13800 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 35496 KB Output is correct
2 Correct 233 ms 35004 KB Output is correct
3 Correct 318 ms 39248 KB Output is correct
4 Correct 240 ms 33360 KB Output is correct
5 Correct 314 ms 38180 KB Output is correct
6 Correct 263 ms 35804 KB Output is correct
7 Correct 219 ms 36304 KB Output is correct
8 Correct 219 ms 36492 KB Output is correct
9 Correct 213 ms 33696 KB Output is correct
10 Correct 195 ms 33652 KB Output is correct
11 Correct 172 ms 27556 KB Output is correct
12 Correct 173 ms 31756 KB Output is correct
13 Correct 205 ms 35136 KB Output is correct
14 Correct 251 ms 34964 KB Output is correct
15 Correct 200 ms 33972 KB Output is correct
16 Correct 209 ms 34296 KB Output is correct
17 Correct 242 ms 35300 KB Output is correct
18 Correct 306 ms 38796 KB Output is correct
19 Correct 221 ms 37184 KB Output is correct
20 Correct 271 ms 34980 KB Output is correct
21 Correct 216 ms 35352 KB Output is correct
22 Correct 186 ms 34040 KB Output is correct
23 Correct 167 ms 29844 KB Output is correct
24 Correct 310 ms 39096 KB Output is correct
25 Correct 13 ms 15500 KB Output is correct
26 Correct 7 ms 13572 KB Output is correct
27 Correct 7 ms 13700 KB Output is correct
28 Correct 18 ms 17060 KB Output is correct
29 Correct 13 ms 15368 KB Output is correct
30 Correct 7 ms 13652 KB Output is correct
31 Correct 7 ms 13832 KB Output is correct
32 Correct 8 ms 13828 KB Output is correct
33 Correct 7 ms 13652 KB Output is correct
34 Correct 13 ms 15316 KB Output is correct
35 Correct 7 ms 13652 KB Output is correct
36 Correct 8 ms 13568 KB Output is correct
37 Correct 7 ms 13612 KB Output is correct
38 Correct 9 ms 13800 KB Output is correct
39 Correct 7 ms 13652 KB Output is correct
40 Correct 219 ms 35632 KB Output is correct
41 Correct 172 ms 33076 KB Output is correct
42 Correct 187 ms 33140 KB Output is correct
43 Correct 148 ms 32284 KB Output is correct
44 Correct 144 ms 32320 KB Output is correct
45 Correct 307 ms 39084 KB Output is correct
46 Correct 304 ms 38796 KB Output is correct
47 Correct 214 ms 33316 KB Output is correct
48 Correct 161 ms 31672 KB Output is correct
49 Correct 196 ms 35392 KB Output is correct
50 Correct 296 ms 39740 KB Output is correct
51 Correct 214 ms 36844 KB Output is correct