oj.uz

답안 #444613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444613 2021-07-14T11:47:12 Z zaneyu Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 291 ms 2964 KB 
/*input
4 5
1 2 4 4
1 3 2 1
4 3 1 2
4 1 6 1
2 4 2 5
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=200+5;
const int maxlg=__lg(maxn)+2;
vector<int> vv[maxn];
vector<pair<pii,pii>> v;
ll d[maxn];
bool in[maxn];
int n;
ll dij(int s,int t){
    REP(i,n) d[i]=INF64,in[i]=0;
    d[s]=0;
    REP(asd,n){
        int p=-1;
        REP(i,n) if(!in[i] and (d[i]<d[p] or p==-1)) p=i;
        in[p]=1;
        for(auto x:vv[p]){
            int b=v[x].f.s;
            MNTO(d[b],d[p]+v[x].s.f);
        }
    }
    return d[t];
}
ll dist[maxn][maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int m;
    cin>>n>>m;
    REP(i,n) REP(j,n) dist[i][j]=INF64;
    REP(i,n) dist[i][i]=0;
    REP(i,m){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        --a,--b;
        MNTO(dist[a][b],c);
        vv[a].pb(i);
        v.pb({{a,b},{c,d}});
    } 
    REP(k,n){ 
        REP(i,n){
            REP(j,n){
                MNTO(dist[i][j],dist[i][k]+dist[k][j]);
            }
        }
    }
    ll ans=INF64;
    MNTO(ans,dist[0][n-1]+dist[n-1][0]);
    REP(i,m){
        auto x=v[i];
        int a=x.f.f,b=x.f.s,c=x.s.f,d=x.s.s;
        ll d1=min(dist[0][n-1],dist[0][b]+c+dist[a][n-1]),d2=min(dist[n-1][0],dist[n-1][b]+c+dist[a][0]);
        if(d1+d2+d<ans){
            vv[a].erase(find(ALL(vv[a]),i));
            vv[b].pb(i);
            swap(v[i].f.f,v[i].f.s);
            ll xx=dij(0,n-1),yy=dij(n-1,0);
            MNTO(ans,xx+yy+d);
            swap(v[i].f.f,v[i].f.s);
            vv[b].pop_back();
            vv[a].pb(i);
        }
    }
    if(ans==INF64) ans=-1;
    cout<<ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 588 KB Output is correct
2 Correct 10 ms 592 KB Output is correct
3 Correct 11 ms 716 KB Output is correct
4 Correct 11 ms 708 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 10 ms 668 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 20 ms 588 KB Output is correct
11 Correct 52 ms 588 KB Output is correct
12 Correct 12 ms 700 KB Output is correct
13 Correct 12 ms 708 KB Output is correct
14 Correct 11 ms 692 KB Output is correct
15 Correct 12 ms 588 KB Output is correct
16 Correct 11 ms 704 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 2828 KB Output is correct
2 Correct 37 ms 2748 KB Output is correct
3 Correct 38 ms 2964 KB Output is correct
4 Correct 12 ms 748 KB Output is correct
5 Correct 12 ms 588 KB Output is correct
6 Correct 11 ms 692 KB Output is correct
7 Correct 11 ms 588 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 60 ms 2568 KB Output is correct
10 Correct 45 ms 2864 KB Output is correct
11 Correct 42 ms 2912 KB Output is correct
12 Correct 38 ms 2904 KB Output is correct
13 Correct 35 ms 2924 KB Output is correct
14 Correct 45 ms 2816 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 588 KB Output is correct
2 Correct 10 ms 588 KB Output is correct
3 Correct 27 ms 2596 KB Output is correct
4 Correct 10 ms 588 KB Output is correct
5 Correct 33 ms 2560 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 57 ms 2612 KB Output is correct
9 Correct 71 ms 2684 KB Output is correct
10 Correct 41 ms 2728 KB Output is correct
11 Correct 33 ms 2696 KB Output is correct
12 Correct 41 ms 2684 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 34 ms 2732 KB Output is correct
20 Correct 36 ms 2608 KB Output is correct
21 Correct 35 ms 2644 KB Output is correct
22 Correct 34 ms 2696 KB Output is correct

Subtask #4
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 588 KB Output is correct
2 Correct 10 ms 592 KB Output is correct
3 Correct 11 ms 716 KB Output is correct
4 Correct 11 ms 708 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 10 ms 668 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 20 ms 588 KB Output is correct
11 Correct 52 ms 588 KB Output is correct
12 Correct 12 ms 700 KB Output is correct
13 Correct 12 ms 708 KB Output is correct
14 Correct 11 ms 692 KB Output is correct
15 Correct 12 ms 588 KB Output is correct
16 Correct 11 ms 704 KB Output is correct
17 Correct 33 ms 2828 KB Output is correct
18 Correct 37 ms 2748 KB Output is correct
19 Correct 38 ms 2964 KB Output is correct
20 Correct 12 ms 748 KB Output is correct
21 Correct 12 ms 588 KB Output is correct
22 Correct 11 ms 692 KB Output is correct
23 Correct 11 ms 588 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 60 ms 2568 KB Output is correct
26 Correct 45 ms 2864 KB Output is correct
27 Correct 42 ms 2912 KB Output is correct
28 Correct 38 ms 2904 KB Output is correct
29 Correct 35 ms 2924 KB Output is correct
30 Correct 45 ms 2816 KB Output is correct
31 Correct 11 ms 588 KB Output is correct
32 Correct 10 ms 588 KB Output is correct
33 Correct 27 ms 2596 KB Output is correct
34 Correct 10 ms 588 KB Output is correct
35 Correct 33 ms 2560 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 57 ms 2612 KB Output is correct
39 Correct 71 ms 2684 KB Output is correct
40 Correct 41 ms 2728 KB Output is correct
41 Correct 33 ms 2696 KB Output is correct
42 Correct 41 ms 2684 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 34 ms 2732 KB Output is correct
50 Correct 36 ms 2608 KB Output is correct
51 Correct 35 ms 2644 KB Output is correct
52 Correct 34 ms 2696 KB Output is correct
53 Correct 40 ms 2740 KB Output is correct
54 Correct 34 ms 2808 KB Output is correct
55 Correct 42 ms 2736 KB Output is correct
56 Correct 11 ms 708 KB Output is correct
57 Correct 11 ms 708 KB Output is correct
58 Correct 44 ms 2736 KB Output is correct
59 Correct 36 ms 2748 KB Output is correct
60 Correct 38 ms 2644 KB Output is correct
61 Correct 37 ms 2648 KB Output is correct
62 Correct 141 ms 2688 KB Output is correct
63 Correct 291 ms 2632 KB Output is correct
64 Correct 53 ms 2696 KB Output is correct
65 Correct 95 ms 2700 KB Output is correct
66 Correct 186 ms 2668 KB Output is correct
67 Correct 22 ms 2504 KB Output is correct
68 Correct 49 ms 2860 KB Output is correct
69 Correct 47 ms 2936 KB Output is correct
70 Correct 36 ms 2884 KB Output is correct
71 Correct 39 ms 2924 KB Output is correct
72 Correct 40 ms 2952 KB Output is correct
73 Correct 38 ms 2940 KB Output is correct
74 Correct 39 ms 2864 KB Output is correct