oj.uz

Submission #876620

# Submission time Handle Problem Language Result Execution time Memory
876620 2023-11-22T05:54:00 Z Mr_Husanboy Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 193 ms 27340 KB 
#include <bits/stdc++.h>
using namespace std;



#ifdef LOCAL
#include "debugger.cpp"
#else
#define debug(...)
#endif
template<class T>
int len(T &a){
    return a.size();
}

using ll = long long;
using pii = pair<int,int>;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
string fileio = "";


mt19937 mt(time(nullptr));
const int mod = 1e9 + 7;
const int inf = 1e9;
const ll infl = 1e18;
const int maxn = 1e5 + 1;





void solve(){
    int n, m; cin >> n >> m;
    int s, t, a, b; cin >> s >> t >> a >> b;
    s --; t --; a --; b --;
    vector<vector<pair<int,int>>> g(n);
    vector<vector<int>> dag(n);

    for(int i = 0; i < m; i ++){
        int u, v, cost; cin >> u >> v >> cost;
        u --; v --;
        g[u].push_back({v, cost});
        g[v].push_back({u, cost});
    }

    priority_queue<pair<ll,int>> q;
    q.push({0, s});
    vector<ll> dis(n, infl);
    vector<bool> vis(n);
    dis[s] = 0;

    while(!q.empty()){
        int i = q.top().ss;
        q.pop();
        if(vis[i]) continue;
        vis[i] = 1;

        for(auto [u, cost] : g[i]){
            if(dis[u] < dis[i] + cost){
                continue;
            }
            if(dis[u] == dis[i] + cost){
                dag[u].push_back(i);
            }else{
                dis[u] = dis[i] + cost;
                dag[u] = {i};
                q.push({-dis[u], u});
            }
        }
    }

    debug(dag);

    vector<ll> da(n, infl), db(n, infl);

    da[a] = 0;
    q.push({0, a});
    vis.assign(n, false);
    while(!q.empty()){
        int i = q.top().ss;
        q.pop();
        if(vis[i]) continue;
        vis[i] = 1;
        for(auto [u, cost] : g[i]){
            if(da[u] > da[i] + cost){
                da[u] = da[i] + cost;
                q.push({-da[u], u});
            }
        }
    }

    db[b] = 0;
    q.push({0, b});
    vis.assign(n, false);
    while(!q.empty()){
        int i = q.top().ss;
        q.pop();
        if(vis[i]) continue;
        vis[i] = 1;
        for(auto [u, cost] : g[i]){
            if(db[u] > db[i] + cost){
                db[u] = db[i] + cost;
                q.push({-db[u], u});
            }
        }
    }
    vis.assign(n, 0);
    vector<ll> mna(n), mnb(n);
    ll ans = da[b];
    auto dfs = [&](auto &dfs, int i)->void{
        vis[i] = 1;
        debug(i);
        mna[i] = mnb[i] = infl;
        for(auto u : dag[i]){
            if(!vis[u]){ dfs(dfs, u); }
            mna[i] = min({mna[i], mna[u], da[u]});
            mnb[i] = min({mnb[i], mnb[u], db[u]});
        }
        ans = min({ans, da[i] + mnb[i], db[i] + mna[i]});
    };

    dfs(dfs, t);
    debug(mna);
    debug(mnb);

    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    auto start = chrono::high_resolution_clock::now();
    #ifndef LOCAL
    if(fileio.size()){
        freopen((fileio + ".in").c_str(), "r", stdin);
        freopen((fileio + ".out").c_str(), "w", stdout);
    }
    #endif
    int testcases = 1;
    #ifdef Tests
    cin >> testcases;
    #endif
    while(testcases --){
        solve();
        cout << '\n';
        #ifdef LOCAL
        cout << "_________________________" << endl;
        #endif
    }
    #ifdef LOCAL
    auto duration = chrono::duration_cast<chrono::microseconds>(chrono::high_resolution_clock::now() - start);
    
    cout << "time: " << (double)duration.count()/1000.0 << " milliseconds" << endl;
    #endif
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:133:10: warning: variable 'start' set but not used [-Wunused-but-set-variable]
  133 |     auto start = chrono::high_resolution_clock::now();
      |          ^~~~~
commuter_pass.cpp:136:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |         freopen((fileio + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:137:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |         freopen((fileio + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 22724 KB Output is correct
2 Correct 182 ms 22600 KB Output is correct
3 Correct 162 ms 27336 KB Output is correct
4 Correct 150 ms 22812 KB Output is correct
5 Correct 152 ms 22192 KB Output is correct
6 Correct 151 ms 22724 KB Output is correct
7 Correct 157 ms 22312 KB Output is correct
8 Correct 170 ms 22484 KB Output is correct
9 Correct 167 ms 22992 KB Output is correct
10 Correct 128 ms 22908 KB Output is correct
11 Correct 57 ms 20576 KB Output is correct
12 Correct 169 ms 22980 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 24732 KB Output is correct
2 Correct 193 ms 24672 KB Output is correct
3 Correct 165 ms 24264 KB Output is correct
4 Correct 180 ms 24776 KB Output is correct
5 Correct 174 ms 25032 KB Output is correct
6 Correct 155 ms 26952 KB Output is correct
7 Correct 183 ms 27340 KB Output is correct
8 Correct 171 ms 24700 KB Output is correct
9 Correct 166 ms 25048 KB Output is correct
10 Correct 174 ms 24260 KB Output is correct
11 Correct 62 ms 22096 KB Output is correct
12 Correct 163 ms 27336 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1368 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 2648 KB Output is correct
5 Correct 5 ms 1380 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 1368 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 22724 KB Output is correct
2 Correct 182 ms 22600 KB Output is correct
3 Correct 162 ms 27336 KB Output is correct
4 Correct 150 ms 22812 KB Output is correct
5 Correct 152 ms 22192 KB Output is correct
6 Correct 151 ms 22724 KB Output is correct
7 Correct 157 ms 22312 KB Output is correct
8 Correct 170 ms 22484 KB Output is correct
9 Correct 167 ms 22992 KB Output is correct
10 Correct 128 ms 22908 KB Output is correct
11 Correct 57 ms 20576 KB Output is correct
12 Correct 169 ms 22980 KB Output is correct
13 Correct 168 ms 24732 KB Output is correct
14 Correct 193 ms 24672 KB Output is correct
15 Correct 165 ms 24264 KB Output is correct
16 Correct 180 ms 24776 KB Output is correct
17 Correct 174 ms 25032 KB Output is correct
18 Correct 155 ms 26952 KB Output is correct
19 Correct 183 ms 27340 KB Output is correct
20 Correct 171 ms 24700 KB Output is correct
21 Correct 166 ms 25048 KB Output is correct
22 Correct 174 ms 24260 KB Output is correct
23 Correct 62 ms 22096 KB Output is correct
24 Correct 163 ms 27336 KB Output is correct
25 Correct 6 ms 1368 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 10 ms 2648 KB Output is correct
29 Correct 5 ms 1380 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 5 ms 1368 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 143 ms 23264 KB Output is correct
41 Correct 159 ms 22796 KB Output is correct
42 Correct 152 ms 22984 KB Output is correct
43 Correct 59 ms 21172 KB Output is correct
44 Correct 60 ms 21328 KB Output is correct
45 Correct 145 ms 21960 KB Output is correct
46 Correct 143 ms 21708 KB Output is correct
47 Correct 157 ms 22728 KB Output is correct
48 Correct 61 ms 17744 KB Output is correct
49 Correct 126 ms 22976 KB Output is correct
50 Correct 160 ms 21936 KB Output is correct
51 Correct 140 ms 21852 KB Output is correct