oj.uz

답안 #32131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
32131 2017-09-27T18:42:43 Z imaxblue Cities (BOI16_cities) C++14
51 / 100
 1993 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()

int n, m, k, a, b, c, N, B;
ll dis[33][100005], D;
vector<pii> v[100005];
pq<pair<pair<ll, int>, int> > q;
int main(){
    flood(dis);
    cin >> n >> k >> m;
    fox(l, k){
        cin >> a;
        q.push(mp(mp(0, 1 << l), a));
    }
    fox(l, m){
        cin >> a >> b >> c;
        v[a].pb(mp(b, c));
        v[b].pb(mp(a, c));
    }
    while(!q.empty()){
        N=q.top().y; D=-q.top().x.x; B=q.top().x.y; q.pop();
        if (dis[B][N]<=D) continue;
        dis[B][N]=D;
        //cout << N << ' ' << B << endl;
        if (B==(1 << k)-1){
            cout << D << endl;
            return 0;
        }
        fox(l, (1 << k)){
            q.push(mp(mp(-D-dis[l][N], B|l), N));
        }
        fox(l, v[N].size()){
            q.push(mp(mp(-D-v[N][l].y, B), v[N][l].x));
        }
    }
    return 0;
}

Compilation message

cities.cpp: In function 'int main()':
cities.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
                                  ^
cities.cpp:55:9: note: in expansion of macro 'fox'
         fox(l, v[N].size()){
         ^

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 30140 KB Output is correct
2 Correct 0 ms 30140 KB Output is correct
3 Correct 9 ms 30140 KB Output is correct
4 Correct 6 ms 30312 KB Output is correct
5 Correct 0 ms 31376 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1943 ms 183904 KB Output is correct
2 Correct 1993 ms 183836 KB Output is correct
3 Correct 463 ms 107076 KB Output is correct
4 Correct 359 ms 108340 KB Output is correct
5 Correct 639 ms 73308 KB Output is correct
6 Correct 229 ms 43788 KB Output is correct
7 Correct 9 ms 32592 KB Output is correct
8 Correct 6 ms 30668 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 39504 KB Output is correct
2 Correct 29 ms 39500 KB Output is correct
3 Correct 19 ms 39472 KB Output is correct
4 Correct 13 ms 34892 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Memory limit exceeded 1106 ms 262144 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Memory limit exceeded 856 ms 262144 KB Memory limit exceeded
2 Halted 0 ms 0 KB -