oj.uz

Submission #748319

# Submission time Handle Problem Language Result Execution time Memory
748319 2023-05-26T06:08:01 Z Pacybwoah Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 6980 KB 
#pragma GCC optimize("O3","unroll-loops")
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#define ll long long
using namespace std;
int n,m;
set<int> crit;
vector<pair<pair<int,int>,pair<ll,ll>>> edges;
vector<ll> dijk(vector<vector<pair<pair<int,int>,pair<ll,ll>>>> &g,int s,int skip,bool flag){
    vector<ll> dist(n+1,1e18);
    dist[s]=0;
    priority_queue<pair<int,ll>,vector<pair<int,ll>>,greater<pair<int,ll>>> pq;
    pq.push(make_pair(0,s));
    while(!pq.empty()){
        auto node=pq.top();
        pq.pop();
        if(dist[node.second]<node.first) continue;
        for(auto x:g[node.second]){
            if(x.first.second==skip) continue;
            if(dist[x.first.first]>dist[node.second]+x.second.first){
                if(flag) crit.insert(x.first.second);
                dist[x.first.first]=dist[node.second]+x.second.first;
                pq.push(make_pair(dist[x.first.first],x.first.first));
            }
        }
        if(skip!=-1&&edges[skip].first.second==node.second){
            if(dist[edges[skip].first.first]>dist[node.second]+edges[skip].second.first){
                dist[edges[skip].first.first]=dist[node.second]+edges[skip].second.first;
                pq.push(make_pair(dist[edges[skip].first.first],edges[skip].first.first));
            }
        }
    }
    return dist;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll a,b,c,d;
    cin>>n>>m;
    vector<vector<pair<pair<int,int>,pair<ll,ll>>>> graph(n+1),hparg(n+1);
    for(int i=0;i<m;i++){
        cin>>a>>b>>c>>d;
        edges.push_back(make_pair(make_pair(a,b),make_pair(c,d)));
        graph[a].push_back(make_pair(make_pair(b,i),make_pair(c,d)));
        hparg[b].push_back(make_pair(make_pair(a,i),make_pair(c,d)));
    }
    vector<ll> from1,fromn,to1,ton;
    from1=dijk(graph,1,-1,1);
    fromn=dijk(graph,n,-1,1);
    to1=dijk(hparg,1,-1,1);
    ton=dijk(hparg,n,-1,1);
    ll ans=from1[n]+fromn[1];
    for(int i=0;i<m;i++){
        if(crit.count(i)){
            vector<ll> tmp1=dijk(graph,1,i,0),tmp2=dijk(graph,n,i,0);
            ans=min(ans,tmp1[n]+tmp2[1]+edges[i].second.second);
        }
        else{
            ans=min(ans,min(from1[n],from1[edges[i].first.second]+edges[i].second.first+ton[edges[i].first.first])+min(fromn[1],fromn[edges[i].first.second]+edges[i].second.first+to1[edges[i].first.first])+edges[i].second.second);
        }
    }
    if(ans>=1e18) cout<<-1;
    else cout<<ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 460 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 28 ms 468 KB Output is correct
4 Correct 35 ms 468 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 1 ms 356 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 58 ms 468 KB Output is correct
11 Correct 57 ms 468 KB Output is correct
12 Correct 56 ms 468 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 18 ms 464 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 18 ms 468 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 856 ms 5444 KB Output is correct
2 Correct 792 ms 6432 KB Output is correct
3 Correct 827 ms 6720 KB Output is correct
4 Correct 29 ms 596 KB Output is correct
5 Correct 14 ms 472 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 179 ms 6316 KB Output is correct
10 Correct 179 ms 6436 KB Output is correct
11 Correct 474 ms 6288 KB Output is correct
12 Correct 472 ms 6584 KB Output is correct
13 Correct 477 ms 6652 KB Output is correct
14 Correct 394 ms 6980 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 106 ms 4556 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 132 ms 5116 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 49 ms 5256 KB Output is correct
9 Correct 52 ms 5172 KB Output is correct
10 Correct 88 ms 4956 KB Output is correct
11 Correct 83 ms 5004 KB Output is correct
12 Correct 97 ms 5312 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 98 ms 5344 KB Output is correct
20 Correct 85 ms 5104 KB Output is correct
21 Correct 87 ms 5324 KB Output is correct
22 Correct 86 ms 5000 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 460 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 28 ms 468 KB Output is correct
4 Correct 35 ms 468 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 1 ms 356 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 58 ms 468 KB Output is correct
11 Correct 57 ms 468 KB Output is correct
12 Correct 56 ms 468 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 18 ms 464 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 18 ms 468 KB Output is correct
17 Correct 856 ms 5444 KB Output is correct
18 Correct 792 ms 6432 KB Output is correct
19 Correct 827 ms 6720 KB Output is correct
20 Correct 29 ms 596 KB Output is correct
21 Correct 14 ms 472 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 179 ms 6316 KB Output is correct
26 Correct 179 ms 6436 KB Output is correct
27 Correct 474 ms 6288 KB Output is correct
28 Correct 472 ms 6584 KB Output is correct
29 Correct 477 ms 6652 KB Output is correct
30 Correct 394 ms 6980 KB Output is correct
31 Correct 12 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 106 ms 4556 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 132 ms 5116 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 49 ms 5256 KB Output is correct
39 Correct 52 ms 5172 KB Output is correct
40 Correct 88 ms 4956 KB Output is correct
41 Correct 83 ms 5004 KB Output is correct
42 Correct 97 ms 5312 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 98 ms 5344 KB Output is correct
50 Correct 85 ms 5104 KB Output is correct
51 Correct 87 ms 5324 KB Output is correct
52 Correct 86 ms 5000 KB Output is correct
53 Execution timed out 1063 ms 6040 KB Time limit exceeded
54 Halted 0 ms 0 KB -