oj.uz

Submission #208576

# Submission time Handle Problem Language Result Execution time Memory
208576 2020-03-11T17:26:22 Z DodgeBallMan Cities (BOI16_cities) C++14
74 / 100
 6000 ms 172728 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define pil pair<int, long long>
#define x first
#define y second

using namespace std;

const int N = 1e5 + 10;
vector<pil> g[N];
vector<int> bit[10];
long long d[N][35], ans = 1e18;
int n, k, m, id[N];
int main()
{
    fill( id, id+N, -1 );
    fill( d[0], d[0]+N*35, ans );
    scanf("%d %d %d",&n,&k,&m);
    for( int i = 0, a ; i < k ; i++ ) {
        scanf("%d",&a);
        id[a] = i;
    }
    for( int i = 0, a, b ; i < m ; i++ ) {
        long long d;
        scanf("%d %d %lld",&a,&b,&d);
        g[a].emplace_back( pil( b, d ) ), g[b].emplace_back( pil( a, d ));
    }
    for( int i = 1 ; i < ( 1 << k ) ; i++ ){
        bit[__builtin_popcount( i )].emplace_back( i );
    }
    for( int b = 1 ; b <= k ; b++ ) {
        priority_queue<pair<long long, pii>> q;
        if( b == 1 ) {
            for( int i = 1 ; i <= n ; i++ ) if( id[i] != -1 ) q.emplace( d[i][(1<<id[i])] = 0, pii( i, (1<<id[i] ) ) );
        }
        else {
            for( int i = 1 ; i <= n ; i++ ) for( int x : bit[b] ) {
                for( int j = 0 ; j < ( 1 << k ) ; j++ ) {
                    if( ( x & j ) != j ) continue ;
                    d[i][x] = min( d[i][x], d[i][j] + d[i][x^j] );
                    q.emplace( -1*d[i][x], pii( i, x ) );
                }
            }
        }
        while( !q.empty() ) {
            long long di = -1*q.top().x;
            int u = q.top().y.x, bi = q.top().y.y;
            q.pop();
            if( d[u][bi] != di ) continue ;
            for( pil v : g[u] ) if( d[v.x][bi] > di + v.y ) {
                d[v.x][bi] = di + v.y;
                q.emplace( -1*d[v.x][bi], pii( v.x, bi ) );
            }
        }
    }
    for( int i = 0 ; i < n ; i++ ) ans = min( ans, d[i][(1<<k)-1] );
    printf("%lld",ans);
    return 0;
}

Compilation message

cities.cpp: In function 'int main()':
cities.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&n,&k,&m);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
cities.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a);
         ~~~~~^~~~~~~~~
cities.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld",&a,&b,&d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 30456 KB Output is correct
2 Correct 18 ms 30328 KB Output is correct
3 Correct 19 ms 30456 KB Output is correct
4 Correct 20 ms 30456 KB Output is correct
5 Correct 19 ms 30584 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1348 ms 73796 KB Output is correct
2 Correct 1364 ms 72964 KB Output is correct
3 Correct 1025 ms 68720 KB Output is correct
4 Correct 121 ms 39708 KB Output is correct
5 Correct 548 ms 49192 KB Output is correct
6 Correct 113 ms 39544 KB Output is correct
7 Correct 24 ms 30968 KB Output is correct
8 Correct 22 ms 30796 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 31584 KB Output is correct
2 Correct 35 ms 31572 KB Output is correct
3 Correct 42 ms 31592 KB Output is correct
4 Correct 28 ms 31016 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3993 ms 106896 KB Output is correct
2 Correct 4006 ms 105960 KB Output is correct
3 Correct 3343 ms 101484 KB Output is correct
4 Correct 1995 ms 90212 KB Output is correct
5 Correct 431 ms 52560 KB Output is correct
6 Correct 135 ms 42244 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6045 ms 172728 KB Time limit exceeded
2 Halted 0 ms 0 KB -