제출 #1207509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207509		dksnfjkfnwkfw	Cities (BOI16_cities)	C++20	100 / 100	1472 ms	67308 KiB

cities

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

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
#define int ll
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
const ll INF = 1e18 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x , Y y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool add(X &x , Y y){
    if((x + y ) >= mod){
        ll tmp  = x + y;
        x = tmp - mod;
        return true;
    }
    return false;
}
void Solve(){

}
int n, dp[N][MASK(5) + 2], m;
int ct[N], k;
vector<pii>adj[N];
void calc(){
    FOR(i, 1, n)FOR(mask,0, MASK(k) - 1)dp[i][mask] = INF;
    FOR(i, 0, k - 1)dp[ct[i]][MASK(i)] = 0;
    FOR(mask, 0, MASK(k) - 1){
        for(int submask = mask; submask > 0; submask = (submask - 1) & mask){
           FOR(i, 1, n)
            dp[i][mask] = min(dp[i][mask], dp[i][mask ^ submask] + dp[i][submask]);
        }
        priority_queue<pii, vector<pii>, greater<pii>>q;
        FOR(i, 1, n)if(dp[i][mask] != INF)q.push({dp[i][mask], i});
        while(q.size()){
            int u = q.top().se;
            int cost = q.top().fi;
            q.pop();
            if(cost > dp[u][mask])continue;
            for(pii v : adj[u]){
                if(dp[v.fi][mask] > dp[u][mask] + v.se){
                    dp[v.fi][mask] = dp[u][mask] + v.se;
                    q.push({dp[v.fi][mask], v.fi});
                }
            }
        }
    }
    ///
    int ans = INF;
    FOR(i, 1, n)ans = min(ans, dp[i][MASK(k) - 1]);
    cout << ans;
}
void Read(){
    cin >> n >> k >> m;
    FOR(i, 0, k - 1)cin >> ct[i];
    FOR(i, 1, m){
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }
    calc();
}


signed main()
{
    sonic;

    int TEST = 1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

• Subtask 1: 22 / 22
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 23 / 23
• Subtask 5: 26 / 26