Submission #444276

#	Time	Username	Problem	Language	Result	Execution time	Memory
444276		zaneyu	Olympic Bus (JOI20_ho_t4)	C++14	0 / 100	71 ms	5048 KiB

ho_t4

/*input
2 4
1 2 8 0
1 2 8 0
1 2 0 9
1 2 0 10 
*/
#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<ll,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;
int dist[maxn][maxn];
bool con(int a,int b,int x,int y,int c){
    return (dist[a][b]==dist[a][x]+c+dist[y][b]);
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    vector<pair<pii,pii>> v;
    map<pair<pii,int>,int> mp;
    REP(i,n) REP(j,n) dist[i][j]=INF;
    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);
        mp[{{a,b},c}]++;
        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]);
            }
        }
    }
    int ans=INF;
    MNTO(ans,dist[0][n-1]+dist[n-1][0]);
    for(auto x:v){
        int a=x.f.f,b=x.f.s,c=x.s.f,d=x.s.s;
        if(mp[{{a,b},c}]>1){
            MNTO(ans,dist[0][b]+dist[a][n-1]+c+d+dist[n-1][0]);
            MNTO(ans,dist[0][n-1]+c+d+dist[n-1][b]+dist[a][0]);
        }
        else{
            int mn=INF;
            REP(i,n){
                if(!con(n-1,i,a,b,c) and !con(i,0,a,b,c)){
                    MNTO(mn,dist[n-1][i]+dist[i][0]);
                }
            }
            MNTO(ans,dist[0][b]+dist[a][n-1]+c+d+mn);
            mn=INF;
            REP(i,n){
                if(!con(0,i,a,b,c) and !con(i,n-1,a,b,c)){
                    MNTO(mn,dist[0][i]+dist[i][n-1]);
                }
            }
            MNTO(ans,mn+c+d+dist[n-1][b]+dist[a][0]);
        }
    }
    if(ans==INF) ans=-1;
    cout<<ans;
}  

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 21
• Subtask 4: 0 / 63