oj.uz

Submission #647324

# Submission time Handle Problem Language Result Execution time Memory
647324 2022-10-02T08:13:43 Z fatemetmhr Cities (BOI16_cities) C++17
22 / 100
 768 ms 34344 KB 
//  ~ Be Name Khoda ~  //

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  1e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   +  7;
const ll  inf   =  1e18;

vector <pair<int, int>> adj[maxn5];
ll dp[(1 << 5) + 1][maxn5];
int imp[maxn5], per[maxn5], cmpmask;

inline bool cmp(int i, int j){return dp[cmpmask][i] < dp[cmpmask][j];}

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

    int n, k, m; cin >> n >> k >> m;
    for(int i = 0; i < k; i++){
        cin >> imp[i];
        imp[i]--;
    }
    for(int i = 0; i < m; i++){
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        adj[a].pb({b, c});
        adj[b].pb({a, c});
    }

    for(int mask = 0; mask < (1 << k); mask++) for(int i = 0; i < n; i++)
        dp[mask][i] = inf;

    for(int i = 0; i < n; i++)
        dp[0][i] = 0;

    for(int i = 0; i < k; i++){
        dp[1 << i][imp[i]] = 0;
        for(auto [u, w] : adj[imp[i]])
            dp[1 << i][u] = w;
    }

    for(int i = 0; i < n; i++)
        per[i] = i;

    for(int mask = 0; mask < (1 << k); mask++){
        cmpmask = mask;
        sort(per, per + n, cmp);
        for(int i = 0; i < n; i++){
            int v = per[i];
            int nmask = (1 << k) - 1 - mask;
            for(int sub = nmask; sub; sub = (sub - 1) & nmask){
                dp[mask^sub][v] = min(dp[mask^sub][v], dp[mask][v] + dp[sub][v]);
            }
            for(auto [u, w] : adj[v])
                dp[mask][u] = min(dp[mask][u], dp[mask][v] + w);
        }
    }

    ll ans = inf;
    for(int i = 0; i < n; i++)
        ans = min(ans, dp[(1 << k) - 1][i]);
    cout << ans << endl;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 232 ms 15440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2900 KB Output is correct
2 Correct 3 ms 2900 KB Output is correct
3 Incorrect 2 ms 2900 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 393 ms 21908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 768 ms 34344 KB Output isn't correct
2 Halted 0 ms 0 KB -