#1175509 (C++17) No.3616 WK vs AT vs MT vs SP

• 問題: No.3616 WK vs AT vs MT vs SP
• ユーザー: GOTKAKO
• 提出日時: 2026-08-06 18:58:12
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 171 ms / 2,000 ms
• コード長: 3,065 bytes
• コンパイル時間: 1,663 ms
• コンパイル使用メモリ: 229,988 KB
• 実行使用メモリ: 41,404 KB
• 最終ジャッジ日時: 2026-08-06 18:58:18
• 合計ジャッジ時間: 6,057 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_0

サブタスク	配点	結果
サンプル	0 %	AC * 1
小課題1	8 %	AC * 9
小課題2	16 %	AC * 5
小課題3	20 %	AC * 10
小課題4	20 %	AC * 15
小課題5	20 %	AC * 15
小課題6	16 %	AC * 36
合計	2.5 * 100% = 250 点

ソースコード

#include <bits/stdc++.h>
using namespace std;

vector<long long> dijkstra(vector<vector<pair<int,long long>>> &Graph,int start){
int N = Graph.size();
//O((V+E)logV) 一般最短経路魔法.
long long inf = 3e18;
    vector<bool> used(N);
    vector<long long> ret(N,inf);
    priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>> Q;
    ret.at(start) = 0; Q.push({0,start});
    while(Q.size()){
        auto[nowd,pos] = Q.top(); Q.pop();
        if(used.at(pos)) continue;
        used.at(pos) = true;
        for(auto [to,w] : Graph.at(pos)){
            if(ret.at(to) > nowd+w){
                ret.at(to) = nowd+w;
                Q.push({ret.at(to),to});
            }
        }
    }
    return ret;
}
vector<long long> dijkstra2(vector<vector<pair<int,long long>>> &Graph,int start){
    int N = Graph.size();
    //O(V^2) 密グラフ専用.
    long long inf = 3e18;
    vector<bool> used(N);
    vector<long long> ret(N,inf);
    ret.at(start) = 0;
    while(true){
        long long nowd = inf,pos = -1;
        for(int i=0; i<N; i++){
            if(used.at(i)) continue;
            if(nowd > ret.at(i)) nowd = ret.at(i),pos = i;
        }
        if(pos == -1) break;
        used.at(pos) = true;
 
        for(auto [to,w] : Graph.at(pos)){if(ret.at(to) > nowd+w) ret.at(to) = nowd+w;}
    }
    return ret;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N,R,C; cin >> N >> R >> C;
    vector<long long> X(N),Y(N),Z(N),S(N);
    for(auto &x : X) cin >> x;
    for(auto &x : Y) cin >> x;
    for(auto &x : Z) cin >> x;
    for(auto &x : S) cin >> x;
 
    vector<vector<pair<int,long long>>> Graph(6*N+6);
    for(int t=0; t<6; t++){
        int add = (N+1)*t;
        if(t >= 3) for(int i=0; i<N; i++){
            Graph.at(add+i).push_back({add+N,S.at(i)+C});
            Graph.at(add+N).push_back({add+i,S.at(i)});
        }
        if(t%3 == 0){for(int i=0; i<N; i++){
            Graph.at(add+i).push_back({add+N+1+i,X.at(i)});
            Graph.at(add+i).push_back({add+N+1+N+1+i,Y.at(i)});
        }}
        else if(t%3 == 1) for(int i=0; i<N; i++) Graph.at(add+i).push_back({add+N+1+i,Y.at(i)});
        if(t < 3) for(int i=0; i<N; i++) Graph.at(add+i).push_back({add+(N+1)*3+i,Z.at(i)});

        if(t) Graph.at(add+N-1).push_back({N-1,0});
    }
    while(R--){
        long long u,v,w,a,m; cin >> u >> v >> w >> a >> m,u--,v--;
        a = min(a,w),m = min(m,a);
        for(int t=0; t<6; t++){
            int add = (N+1)*t;
            if(t%3 == 0){
                Graph.at(add+u).push_back({add+v,w});
                Graph.at(add+v).push_back({add+u,w});
            }
            if(t%3 == 1){
                Graph.at(add+u).push_back({add+v,a});
                Graph.at(add+v).push_back({add+u,a});
            }
            if(t%3 == 2){
                Graph.at(add+u).push_back({add+v,m});
                Graph.at(add+v).push_back({add+u,m});
            }
        }
    }
    auto dist = dijkstra(Graph,0);
    cout << dist.at(N-1) << endl;
}