結果

問題 No.1690 Power Grid
ユーザー 👑 deuteridayodeuteridayo
提出日時 2021-09-24 23:19:26
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,923 ms / 3,000 ms
コード長 3,165 bytes
コンパイル時間 4,606 ms
コンパイル使用メモリ 235,864 KB
実行使用メモリ 81,308 KB
最終ジャッジ日時 2023-09-18 22:22:24
合計ジャッジ時間 18,746 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
42,116 KB
testcase_01 AC 31 ms
41,920 KB
testcase_02 AC 31 ms
42,116 KB
testcase_03 AC 31 ms
42,152 KB
testcase_04 AC 31 ms
42,040 KB
testcase_05 AC 31 ms
42,180 KB
testcase_06 AC 264 ms
62,644 KB
testcase_07 AC 260 ms
62,508 KB
testcase_08 AC 273 ms
62,560 KB
testcase_09 AC 270 ms
62,432 KB
testcase_10 AC 152 ms
48,376 KB
testcase_11 AC 1,724 ms
79,004 KB
testcase_12 AC 32 ms
42,044 KB
testcase_13 AC 32 ms
42,172 KB
testcase_14 AC 55 ms
42,644 KB
testcase_15 AC 1,921 ms
80,916 KB
testcase_16 AC 263 ms
62,612 KB
testcase_17 AC 143 ms
51,480 KB
testcase_18 AC 70 ms
45,280 KB
testcase_19 AC 268 ms
62,644 KB
testcase_20 AC 270 ms
62,644 KB
testcase_21 AC 151 ms
46,092 KB
testcase_22 AC 858 ms
70,696 KB
testcase_23 AC 1,923 ms
81,308 KB
testcase_24 AC 1,298 ms
74,628 KB
testcase_25 AC 1,498 ms
76,772 KB
testcase_26 AC 1,692 ms
78,868 KB
testcase_27 AC 31 ms
42,156 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod = 1e9+7;
//long const mod = 998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
struct edge{
    int to;
    lint len;
};
using graph = vector<vector<edge>>;
vector<vector<lint>>cost(18, vector<lint>(1<<18, INF64));
vector<vector<lint>>d(18,vector<lint>(18, INF64));
int n;
lint f(int k, lint bit, vector<vector<lint>>&dp) {
    // 
    if(k == 0)return 0;
    if(dp[k][bit] != -1)return dp[k][bit];
    lint ans = INF64;
    for(int i  =0;i<n;i++) {
        if(bit & (1<<n))continue;
        ans = min(ans, cost[i][bit] + f(k-1, bit | (1<<i), dp));
    }
    // cerr << k <<  " " << bit <<" " << ans<< endl;
    return dp[k][bit] = ans;
}

int main(){ 
    int m,k;
    cin >> n >> m >> k;
    graph g(n);
    lint a[n];
    for(int i = 0;i<n;i++)cin >> a[i];
    for(int i = 0;i<m;i++) {
        int x,y;
        lint z;
        cin >> x >> y >> z;
        x--;y--;
        d[x][y] = z;
        d[y][x] = z;
    }    
    for(int k=0;k<n;k++){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++) {
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
    for(int i= 0;i<(1<<n);i++){
        for(int j = 0;j<n;j++) {
            if(i & (1<<j)){
                cost[j][i] = INF64;
                continue;
            }
            if(i == 0){
                cost[j][i] = a[j];
                continue;
            }
            lint tmp = INF64;
            for(int k = 0;k<n;k++ ) {
                
                if(i &(1<<k))tmp = min(tmp, d[j][k]);
            }
            cost[j][i] = tmp + a[j];
        }
    }


    vector<vector<lint>>dp(k+1,vector<lint>(1<<n, -1));
    dp[0][0] = 0;

    cout << f(k,0, dp) << endl;


}
0