oj.uz

Submission #440744

# Submission time Handle Problem Language Result Execution time Memory
440744 2021-07-02T21:40:23 Z nickmet2004 Cities (BOI16_cities) C++11
14 / 100
 1516 ms 35520 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n , k , m , A[6];
int d[6][N] , F[6][6][N];
vector<pair<int , int>> adj[N];
void go(int a , int b , int *ans){
    priority_queue<pair<int , int> > pq;
    for(int y = 1; y <= n; ++y) {
        if(b!=0) ans[y] = d[a][y] + d[b][y], pq.push({-ans[y] , y});
        else ans[y] = 1e18;

    }
    if(b==0)pq.push({0 , a}) , ans[a] = 0;
    int u , w;
    while(pq.size()){
        auto T = pq.top(); pq.pop();
        u = T.second , w = -T.first;
        int v , D;
        for(auto V : adj[u]){
            v = V.first , D = V.second;
            if(ans[v] > D + w){ans[v] = D + w; pq.push({-ans[v] , v});}
        }
    }
}
 main (){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> k >> m;
    for(int i = 0; i< k; ++i)cin >> A[i];
    int u , v , w;
    for(int i = 1; i<= m; ++i){
        cin >> u >> v >> w;
        adj[u].emplace_back(v , w);
        adj[v].emplace_back(u , w);
    }
    for(int i = 0; i < k; ++i) go(A[i] , 0 , d[i]);
    for(int i = 0; i< k; ++i){
        for(int j = i + 1; j < k; ++j){
            go(i , j , F[i][j]);
        }
    }
    /*
    for(int i = 0; i< k; ++i){
        for(int x= 1; x <= n; ++x)cout << d[i][x] << " ";
        cout << endl;
    }
    */
    if(k == 2)cout << d[0][A[1]]<<endl;
    if(k == 3)cout << F[0][1][A[2]] << endl;
    int ans = 1e8;
    if(k == 4){
        vector<int> P = {0 , 1, 2, 3,};
        //if(P[0] > P[1] || P[2] > P[3])continue;
        do{
            for(int i = 1; i<= n; ++i)ans = min(ans , F[P[0]][P[1]][i] + F[P[2]][P[3]][i]);
        }while(next_permutation(P.begin(), P.end()));
        cout << ans;
    }
    if(k == 5){
        vector<int> P = {0 ,1 , 2, 3 , 4};
        //if(P[0] > P[1] || P[2] > P[3] || P[3] > P[4])continue;
        do{
            for(int i = 1; i<= n; ++i)ans = min(ans , F[P[0]][P[1]][i] + F[P[2]][P[3]][i] + d[P[4]][i]);
        }while(next_permutation(P.begin() , P.end()));
        cout << ans;
    }
}

Compilation message

cities.cpp:27:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 |  main (){
      |  ^~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Incorrect 2 ms 2764 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 604 ms 28324 KB Output is correct
2 Correct 591 ms 27844 KB Output is correct
3 Correct 352 ms 18424 KB Output is correct
4 Correct 117 ms 15204 KB Output is correct
5 Correct 354 ms 23760 KB Output is correct
6 Correct 82 ms 15144 KB Output is correct
7 Correct 4 ms 2892 KB Output is correct
8 Correct 3 ms 2892 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 26.0

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