oj.uz

Submission #485804

# Submission time Handle Problem Language Result Execution time Memory
485804 2021-11-09T11:57:08 Z radal Cities (BOI16_cities) C++14
14 / 100
 369 ms 36224 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC target("avx2,fma")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<ll,int> pll;
typedef pair<long double,long double> pld;
const long long int N = 2e5+10,mod = 998244353,inf = 1e18,maxm = (1 << 24);
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
inline int poww(int n,ll k){
    int c = 1;
    while (k){
        if (k&1) c = (1ll*c*n)%mod;
        n = (1ll*n*n)%mod;
        k >>= 1;
    }
    return c;
}
vector<pll> adj[N];
int n,k;
ll d[N][10];
void dij(int v,int i){
    d[v][i] = 0;
    priority_queue<pll> pq;
    pq.push({0,v});
    while (!pq.empty()){
        pll u = pq.top();
        pq.pop();
        if (-u.X != d[u.Y][i]) continue;
        for (pll v : adj[u.Y]){
            if (d[v.X][i] > v.Y+d[u.Y][i]){
                d[v.X][i] = v.Y+d[u.Y][i];
                pq.push({-d[v.X][i],v.X});
            }
        }
    }
}
int main(){
    ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    memset(d,63,sizeof d);
    int m;
    cin >> n >> k >> m;
    vector<int> ve;
    rep(i,0,k){
        int x;
        cin >> x;
        ve.pb(x);
    }
    rep(i,0,m){
        int u,v,w;
        cin >> u >> v >> w;
        adj[u].pb({v,w});
        adj[v].pb({u,w});
    }
    rep(i,0,k) dij(ve[i],i);
    ll ans = inf;
    rep(i,1,n+1){
        ll cost = 0;
        rep(j,0,k) cost += d[i][j];
        ans = min(ans,cost);
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 22.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 35600 KB Output is correct
2 Correct 265 ms 36224 KB Output is correct
3 Correct 97 ms 28016 KB Output is correct
4 Correct 88 ms 32508 KB Output is correct
5 Correct 210 ms 35672 KB Output is correct
6 Correct 61 ms 32464 KB Output is correct
7 Correct 10 ms 20812 KB Output is correct
8 Correct 11 ms 20812 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 26.0

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