oj.uz

Submission #774191

# Submission time Handle Problem Language Result Execution time Memory
774191 2023-07-05T12:50:22 Z bachhoangxuan Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 803 ms 3180 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=1e9+7;
const int maxn=205;
const int bl=650;
const int maxs=655;
const int maxm=50005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
struct ed{
    int u,v,c,d;
};

int n,m,dist[maxn],trace[maxn];
vector<pii> edge[maxn];
bool check[maxm];
ed e[maxm];
void del(int u,int v,int id){
    for(int i=0;i<(int)edge[u].size();i++){
        if(edge[u][i]==mpp(v,id)){
            edge[u].erase(edge[u].begin()+i);
            return;
        }
    }
}
void add(int u,int v,int id){
    edge[u].push_back({v,id});
}
int dijisktra(int s,int t){
    for(int i=1;i<=n;i++) dist[i]=inf,trace[i]=0;
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    dist[s]=0;pq.push({0,s});
    while(!pq.empty()){
        auto [d,u]=pq.top();pq.pop();
        if(u==t) return d;
        if(d!=dist[u]) continue;
        for(auto &[v,id]:edge[u]){
            if(d+e[id].c<dist[v]){
                dist[v]=d+e[id].c;trace[v]=id;
                pq.push({dist[v],v});
            }
        }
    }
    return inf;
}
int d[maxn][maxn];
void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) d[i][j]=inf*(i!=j);
    for(int i=1;i<=m;i++){
        cin >> e[i].u >> e[i].v >> e[i].c >> e[i].d;
        add(e[i].u,e[i].v,i);
        d[e[i].u][e[i].v]=min(d[e[i].u][e[i].v],e[i].c);
    }
    for(int k=1;k<=n;k++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    int res=dijisktra(1,n);
    int cur=n;
    while(trace[cur]){
        int id=trace[cur];check[id]=true;
        cur=(e[id].u==cur?e[id].v:e[id].u);
    }
    res+=dijisktra(n,1);
    cur=1;
    while(trace[cur]){
        int id=trace[cur];check[id]=true;
        cur=(e[id].u==cur?e[id].v:e[id].u);
    }
    if(res>=inf) res=2*inf;
    /*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++) cout << d[i][j] << ' ';
        cout << '\n';
    }
    */
    for(int i=1;i<=m;i++){
        //cout << i << ' ' << check[i] << '\n';
        if(check[i]){
            del(e[i].u,e[i].v,i);
            add(e[i].v,e[i].u,i);
            int d1=dijisktra(1,n),d2=dijisktra(n,1);
            if(d1<inf && d2<inf) res=min(res,d1+d2+e[i].d);
            del(e[i].v,e[i].u,i);
            add(e[i].u,e[i].v,i);
        }
        else{
            int d1=min(d[1][n],d[1][e[i].v]+e[i].c+d[e[i].u][n]);
            int d2=min(d[n][1],d[n][e[i].v]+e[i].c+d[e[i].u][1]);
            //cout << i << ' ' << d1 << ' ' << d2 << '\n';
            if(d1<inf && d2<inf) res=min(res,d1+d2+e[i].d);
        }
    }
    cout << (res==2*inf?-1:res) << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 468 KB Output is correct
2 Correct 8 ms 508 KB Output is correct
3 Correct 8 ms 568 KB Output is correct
4 Correct 8 ms 484 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 8 ms 520 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 20 ms 560 KB Output is correct
11 Correct 23 ms 548 KB Output is correct
12 Correct 32 ms 552 KB Output is correct
13 Correct 8 ms 560 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 13 ms 468 KB Output is correct
16 Correct 8 ms 560 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2980 KB Output is correct
2 Correct 21 ms 2940 KB Output is correct
3 Correct 21 ms 3144 KB Output is correct
4 Correct 9 ms 640 KB Output is correct
5 Correct 8 ms 480 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 8 ms 520 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 27 ms 3052 KB Output is correct
10 Correct 21 ms 3116 KB Output is correct
11 Correct 23 ms 3128 KB Output is correct
12 Correct 24 ms 3108 KB Output is correct
13 Correct 22 ms 3156 KB Output is correct
14 Correct 22 ms 3180 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 468 KB Output is correct
2 Correct 9 ms 468 KB Output is correct
3 Correct 22 ms 2284 KB Output is correct
4 Correct 11 ms 520 KB Output is correct
5 Correct 24 ms 2772 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 24 ms 2808 KB Output is correct
9 Correct 22 ms 2812 KB Output is correct
10 Correct 25 ms 2948 KB Output is correct
11 Correct 23 ms 2772 KB Output is correct
12 Correct 28 ms 2896 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 20 ms 2852 KB Output is correct
20 Correct 22 ms 2796 KB Output is correct
21 Correct 20 ms 2796 KB Output is correct
22 Correct 24 ms 2812 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 468 KB Output is correct
2 Correct 8 ms 508 KB Output is correct
3 Correct 8 ms 568 KB Output is correct
4 Correct 8 ms 484 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 8 ms 520 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 20 ms 560 KB Output is correct
11 Correct 23 ms 548 KB Output is correct
12 Correct 32 ms 552 KB Output is correct
13 Correct 8 ms 560 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 13 ms 468 KB Output is correct
16 Correct 8 ms 560 KB Output is correct
17 Correct 21 ms 2980 KB Output is correct
18 Correct 21 ms 2940 KB Output is correct
19 Correct 21 ms 3144 KB Output is correct
20 Correct 9 ms 640 KB Output is correct
21 Correct 8 ms 480 KB Output is correct
22 Correct 8 ms 468 KB Output is correct
23 Correct 8 ms 520 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 27 ms 3052 KB Output is correct
26 Correct 21 ms 3116 KB Output is correct
27 Correct 23 ms 3128 KB Output is correct
28 Correct 24 ms 3108 KB Output is correct
29 Correct 22 ms 3156 KB Output is correct
30 Correct 22 ms 3180 KB Output is correct
31 Correct 11 ms 468 KB Output is correct
32 Correct 9 ms 468 KB Output is correct
33 Correct 22 ms 2284 KB Output is correct
34 Correct 11 ms 520 KB Output is correct
35 Correct 24 ms 2772 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 24 ms 2808 KB Output is correct
39 Correct 22 ms 2812 KB Output is correct
40 Correct 25 ms 2948 KB Output is correct
41 Correct 23 ms 2772 KB Output is correct
42 Correct 28 ms 2896 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 20 ms 2852 KB Output is correct
50 Correct 22 ms 2796 KB Output is correct
51 Correct 20 ms 2796 KB Output is correct
52 Correct 24 ms 2812 KB Output is correct
53 Correct 29 ms 2856 KB Output is correct
54 Correct 21 ms 2848 KB Output is correct
55 Correct 22 ms 2908 KB Output is correct
56 Correct 12 ms 468 KB Output is correct
57 Correct 12 ms 564 KB Output is correct
58 Correct 78 ms 2432 KB Output is correct
59 Correct 106 ms 2436 KB Output is correct
60 Correct 126 ms 2476 KB Output is correct
61 Correct 74 ms 2480 KB Output is correct
62 Correct 87 ms 2396 KB Output is correct
63 Correct 129 ms 2396 KB Output is correct
64 Correct 556 ms 2720 KB Output is correct
65 Correct 608 ms 2748 KB Output is correct
66 Correct 803 ms 2744 KB Output is correct
67 Correct 10 ms 2264 KB Output is correct
68 Correct 21 ms 3056 KB Output is correct
69 Correct 30 ms 3100 KB Output is correct
70 Correct 23 ms 3116 KB Output is correct
71 Correct 23 ms 3080 KB Output is correct
72 Correct 21 ms 3024 KB Output is correct
73 Correct 22 ms 3156 KB Output is correct
74 Correct 22 ms 3144 KB Output is correct