oj.uz

Submission #640913

# Submission time Handle Problem Language Result Execution time Memory
640913 2022-09-15T14:11:14 Z kebine Cities (BOI16_cities) C++17
51 / 100
 331 ms 15872 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1e9+7;
const ll maxn=1e5+5;
const ll INF=1e18;
#define ok ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define endl '\n'
int n, k, m, arr[5], u, v, w, bit, par[21];
ll dis[maxn][5], ans=INF;
vector<pii> adj[maxn];
vector<pair<int, pii>> edge;
int find(int a) {
    return par[a]=(par[a]==a? a : find(par[a]));
}
int main() {
    ok
    cin >> n >> k >> m;
    if(k==5 && n<=20) {
        for(int i=0; i<k; i++) {
            cin >> arr[i];
            bit|=(1<<arr[i]);
        }
        for(int i=0; i<m; i++) {
            cin >> u >> v >> w;
            edge.pb({w, {u, v}});
        }
        sort(edge.begin(), edge.end());
        for(int i=1; i<(1<<(n+1)); i++) {
            if((i&bit)!=bit) continue;
            for(int j=1; j<=n; j++) par[j]=j;
            ll cur=0;
            for(auto it : edge) {
                if(find(it.se.fi)!=find(it.se.se) && (i&(1<<it.se.fi)) && (i&(1<<it.se.se))) {
                    cur+=it.fi;
                    par[find(it.se.fi)]=find(it.se.se);
                }
            }
            bool bisa=1;
            for(int j=1; j<k; j++) {
                if(find(arr[j])!=find(arr[j-1])) {
                    bisa=0;
                    break;
                }
            }
            if(!bisa) continue;
            ans=min(ans, cur);
        }
        cout << ans;
        return 0;
    }
    for(int i=0; i<k; i++) cin >> arr[i];
    for(int i=0; i<m; i++) {
        cin >> u >> v >> w;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }
    if(k==4 && n<=1000) {
        ll dist[n+1][n+1];
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=n; j++) dist[i][j]=INF;
        }
        for(int i=1; i<=n; i++) {
            dist[i][i]=0;
            priority_queue<pll, vector<pll>, greater<pll>> pq;
            pq.push({0, i});
            while(!pq.empty()) {
                pll fr=pq.top();
                pq.pop();
                if(fr.fi>dist[fr.se][i]) continue;
                for(auto it : adj[fr.se]) {
                    if(dist[it.fi][i]>dist[fr.se][i]+it.se) {
                        dist[it.fi][i]=dist[fr.se][i]+it.se;
                        pq.push({dist[it.fi][i], it.fi});
                    }
                }
            }
        }
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=n; j++) {
                for(int l=1; l<16; l++) {
                    ll cur=dist[i][j];
                    for(int m=0; m<4; m++) {
                        if(l&(1<<m)) {
                            cur+=dist[arr[m]][i];
                        } else cur+=dist[arr[m]][j];
                    }
                    ans=min(ans, cur);
                }
            }
        }
        cout << ans;
        return 0;
    }
    for(int i=0; i<k; i++) {
        for(int j=1; j<=n; j++) dis[j][i]=INF;
        dis[arr[i]][i]=0;
        priority_queue<pll, vector<pll>, greater<pll>> pq;
        pq.push({0, arr[i]});
        while(!pq.empty()) {
            pll fr=pq.top();
            pq.pop();
            if(fr.fi>dis[fr.se][i]) continue;
            for(auto it : adj[fr.se]) {
                if(dis[it.fi][i]>dis[fr.se][i]+it.se) {
                    dis[it.fi][i]=dis[fr.se][i]+it.se;
                    pq.push({dis[it.fi][i], it.fi});
                }
            }
        }
    }
    for(int i=1; i<=n; i++) {
        ll cur=0;
        for(int j=0; j<k; j++) cur+=dis[i][j];
        ans=min(ans, cur);
    }
    cout << ans;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 14600 KB Output is correct
2 Correct 239 ms 15872 KB Output is correct
3 Correct 80 ms 9692 KB Output is correct
4 Correct 50 ms 7436 KB Output is correct
5 Correct 176 ms 14672 KB Output is correct
6 Correct 50 ms 7304 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2724 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 10604 KB Output is correct
2 Correct 246 ms 10596 KB Output is correct
3 Correct 127 ms 10540 KB Output is correct
4 Correct 90 ms 4692 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
0 / 26.0

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