oj.uz

Submission #748373

# Submission time Handle Problem Language Result Execution time Memory
748373 2023-05-26T07:53:11 Z Pacybwoah Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 7048 KB 
#pragma GCC optimize("O3","unroll-loops","Ofast")
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#define ll long long
using namespace std;
int n,m;
vector<bool> crit;
vector<pair<pair<int,int>,pair<ll,ll>>> edges;
void dijk(vector<vector<pair<pair<int,int>,pair<ll,ll>>>> &g,vector<ll> &dist,int s,int skip,bool flag){
    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[x.first.second]=1;
                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));
            }
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll a,b,c,d;
    cin>>n>>m;
    crit.resize(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(n+1,1e18),fromn(n+1,1e18),to1(n+1,1e18),ton(n+1,1e18);
    dijk(graph,from1,1,-1,1);
    dijk(graph,fromn,n,-1,1);
    dijk(hparg,to1,1,-1,1);
    dijk(hparg,ton,n,-1,1);
    ll ans=from1[n]+fromn[1];
    for(int i=0;i<m;i++){
        if(crit[i]){
            vector<ll> tmp1(n+1,1e18),tmp2(n+1,1e18);
            dijk(graph,tmp1,1,i,0);
            dijk(graph,tmp2,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 13 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 29 ms 468 KB Output is correct
4 Correct 34 ms 468 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 60 ms 456 KB Output is correct
11 Correct 61 ms 468 KB Output is correct
12 Correct 56 ms 468 KB Output is correct
13 Correct 7 ms 392 KB Output is correct
14 Correct 18 ms 468 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 18 ms 452 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 902 ms 6484 KB Output is correct
2 Correct 807 ms 6112 KB Output is correct
3 Correct 840 ms 6644 KB Output is correct
4 Correct 31 ms 460 KB Output is correct
5 Correct 10 ms 456 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 212 KB Output is correct
9 Correct 189 ms 6412 KB Output is correct
10 Correct 173 ms 6280 KB Output is correct
11 Correct 511 ms 6392 KB Output is correct
12 Correct 464 ms 6280 KB Output is correct
13 Correct 467 ms 6224 KB Output is correct
14 Correct 392 ms 7048 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 113 ms 5260 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 132 ms 6216 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 54 ms 6232 KB Output is correct
9 Correct 55 ms 6216 KB Output is correct
10 Correct 91 ms 5960 KB Output is correct
11 Correct 85 ms 6016 KB Output is correct
12 Correct 91 ms 6028 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 95 ms 6200 KB Output is correct
20 Correct 87 ms 5884 KB Output is correct
21 Correct 96 ms 6280 KB Output is correct
22 Correct 97 ms 6016 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 29 ms 468 KB Output is correct
4 Correct 34 ms 468 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 60 ms 456 KB Output is correct
11 Correct 61 ms 468 KB Output is correct
12 Correct 56 ms 468 KB Output is correct
13 Correct 7 ms 392 KB Output is correct
14 Correct 18 ms 468 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 18 ms 452 KB Output is correct
17 Correct 902 ms 6484 KB Output is correct
18 Correct 807 ms 6112 KB Output is correct
19 Correct 840 ms 6644 KB Output is correct
20 Correct 31 ms 460 KB Output is correct
21 Correct 10 ms 456 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 212 KB Output is correct
25 Correct 189 ms 6412 KB Output is correct
26 Correct 173 ms 6280 KB Output is correct
27 Correct 511 ms 6392 KB Output is correct
28 Correct 464 ms 6280 KB Output is correct
29 Correct 467 ms 6224 KB Output is correct
30 Correct 392 ms 7048 KB Output is correct
31 Correct 13 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 113 ms 5260 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 132 ms 6216 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 54 ms 6232 KB Output is correct
39 Correct 55 ms 6216 KB Output is correct
40 Correct 91 ms 5960 KB Output is correct
41 Correct 85 ms 6016 KB Output is correct
42 Correct 91 ms 6028 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 320 KB Output is correct
47 Correct 1 ms 320 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 95 ms 6200 KB Output is correct
50 Correct 87 ms 5884 KB Output is correct
51 Correct 96 ms 6280 KB Output is correct
52 Correct 97 ms 6016 KB Output is correct
53 Execution timed out 1087 ms 5804 KB Time limit exceeded
54 Halted 0 ms 0 KB -