oj.uz

Submission #787819

# Submission time Handle Problem Language Result Execution time Memory
787819 2023-07-19T12:59:17 Z guagua0407 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 287 ms 25400 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=1e5+5;
vector<pair<int,ll>> adj[mxn];
int n,m;
int S,T,U,V;
vector<int> vec;

vector<ll> dij(int node){
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
    vector<ll> d(n,(ll)1e18);
    d[node]=0;
    pq.push({0,node});
    while(!pq.empty()){
        auto v=pq.top();
        pq.pop();
        if(v.f!=d[v.s]) continue;
        for(auto u:adj[v.s]){
            if(d[v.s]+u.s<d[u.f]){
                d[u.f]=d[v.s]+u.s;
                pq.push({d[u.f],u.f});
            }
        }
    }
    return d;
}

vector<vector<ll>> d;

bool comp(int a,int b){
    return d[S][a]<d[S][b];
}

int main() {_
    cin>>n>>m;
    cin>>S>>T>>U>>V;
    S--;
    T--;
    U--;
    V--;
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        a--;
        b--;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    d.resize(n);
    for(int i=0;i<n;i++){
        if(i!=S and i!=T and i!=U and i!=V) continue;
        d[i]=dij(i);
    }
    ll ans=(ll)1e18;
    vector<int> vec;
    for(int i=0;i<n;i++){
        if(d[S][i]+d[T][i]==d[S][T]) vec.push_back(i);
    }
    sort(all(vec),comp);
    vector<ll> mn(n,(ll)1e18);
    for(auto v:vec){
        mn[v]=d[U][v];
        for(auto u:adj[v]){
            if(d[S][u.f]+u.s==d[S][v]) mn[v]=min(mn[v],mn[u.f]);
        }
        //cout<<v+1<<' '<<mn[v]<<'\n';
        ans=min(ans,mn[v]+d[V][v]);
    }
    mn=vector<ll>(n,(ll)1e18);
    for(auto v:vec){
        mn[v]=d[V][v];
        for(auto u:adj[v]){
            if(d[S][u.f]+u.s==d[S][v]) mn[v]=min(mn[v],mn[u.f]);
        }
        //cout<<v+1<<' '<<mn[v]<<'\n';
        ans=min(ans,mn[v]+d[U][v]);
    }
    cout<<min(d[U][V],ans)<<'\n';
    return 0;
}
//maybe its multiset not set

Compilation message

commuter_pass.cpp: In function 'void setIO(std::string)':
commuter_pass.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 20856 KB Output is correct
2 Correct 208 ms 23148 KB Output is correct
3 Correct 191 ms 24512 KB Output is correct
4 Correct 172 ms 23540 KB Output is correct
5 Correct 174 ms 23120 KB Output is correct
6 Correct 190 ms 24808 KB Output is correct
7 Correct 201 ms 23220 KB Output is correct
8 Correct 178 ms 23104 KB Output is correct
9 Correct 174 ms 23944 KB Output is correct
10 Correct 135 ms 23764 KB Output is correct
11 Correct 82 ms 16616 KB Output is correct
12 Correct 172 ms 23816 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 20424 KB Output is correct
2 Correct 232 ms 20424 KB Output is correct
3 Correct 206 ms 20352 KB Output is correct
4 Correct 262 ms 20464 KB Output is correct
5 Correct 275 ms 23980 KB Output is correct
6 Correct 215 ms 24192 KB Output is correct
7 Correct 232 ms 24252 KB Output is correct
8 Correct 287 ms 23896 KB Output is correct
9 Correct 282 ms 23872 KB Output is correct
10 Correct 245 ms 23880 KB Output is correct
11 Correct 128 ms 17360 KB Output is correct
12 Correct 216 ms 24372 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4052 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2680 KB Output is correct
4 Correct 11 ms 6080 KB Output is correct
5 Correct 7 ms 4352 KB Output is correct
6 Correct 2 ms 2680 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 4 ms 2944 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 10 ms 4348 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 2684 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 20856 KB Output is correct
2 Correct 208 ms 23148 KB Output is correct
3 Correct 191 ms 24512 KB Output is correct
4 Correct 172 ms 23540 KB Output is correct
5 Correct 174 ms 23120 KB Output is correct
6 Correct 190 ms 24808 KB Output is correct
7 Correct 201 ms 23220 KB Output is correct
8 Correct 178 ms 23104 KB Output is correct
9 Correct 174 ms 23944 KB Output is correct
10 Correct 135 ms 23764 KB Output is correct
11 Correct 82 ms 16616 KB Output is correct
12 Correct 172 ms 23816 KB Output is correct
13 Correct 205 ms 20424 KB Output is correct
14 Correct 232 ms 20424 KB Output is correct
15 Correct 206 ms 20352 KB Output is correct
16 Correct 262 ms 20464 KB Output is correct
17 Correct 275 ms 23980 KB Output is correct
18 Correct 215 ms 24192 KB Output is correct
19 Correct 232 ms 24252 KB Output is correct
20 Correct 287 ms 23896 KB Output is correct
21 Correct 282 ms 23872 KB Output is correct
22 Correct 245 ms 23880 KB Output is correct
23 Correct 128 ms 17360 KB Output is correct
24 Correct 216 ms 24372 KB Output is correct
25 Correct 7 ms 4052 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2680 KB Output is correct
28 Correct 11 ms 6080 KB Output is correct
29 Correct 7 ms 4352 KB Output is correct
30 Correct 2 ms 2680 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 4 ms 2944 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 10 ms 4348 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 3 ms 2684 KB Output is correct
40 Correct 258 ms 25400 KB Output is correct
41 Correct 265 ms 24500 KB Output is correct
42 Correct 215 ms 24568 KB Output is correct
43 Correct 86 ms 17592 KB Output is correct
44 Correct 106 ms 17580 KB Output is correct
45 Correct 266 ms 24540 KB Output is correct
46 Correct 228 ms 24152 KB Output is correct
47 Correct 222 ms 24532 KB Output is correct
48 Correct 111 ms 16976 KB Output is correct
49 Correct 158 ms 25016 KB Output is correct
50 Correct 190 ms 24300 KB Output is correct
51 Correct 184 ms 24380 KB Output is correct