oj.uz

답안 #640897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
640897 2022-09-15T13:49:40 Z GaLz Cities (BOI16_cities) C++14
29 / 100
 325 ms 16016 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;
ll dis[maxn][5], ans=INF;
vector<pii> adj[maxn];
int main() {
    ok
    cin >> n >> k >> m;
    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
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2684 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 2 ms 2644 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 14812 KB Output is correct
2 Correct 235 ms 16016 KB Output is correct
3 Correct 84 ms 9948 KB Output is correct
4 Correct 54 ms 7624 KB Output is correct
5 Correct 182 ms 14896 KB Output is correct
6 Correct 55 ms 7560 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 3 ms 2740 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 10644 KB Output is correct
2 Correct 266 ms 10636 KB Output is correct
3 Correct 156 ms 10556 KB Output is correct
4 Correct 82 ms 4752 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 265 ms 14836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 325 ms 14812 KB Output isn't correct
2 Halted 0 ms 0 KB -