oj.uz

답안 #37754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
37754 2017-12-28T02:23:31 Z imaxblue Museum (CEOI17_museum) C++14
100 / 100
 346 ms 784976 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, k, x, a, b, d, hi[10005], dp[2][10005][10005];
vector<pii> v[10005];
void dfs(int N, int P){
    dp[0][N][1]=dp[1][N][1]=0;
    hi[N]=1;
    int c;
    fox(l, v[N].size()){
        c=v[N][l].x;
        if (c==P) continue;
        dfs(c, N);
        fox1r(l2, hi[N]){
            fox1(l3, hi[c]){
                dp[0][N][l2+l3]=min(dp[0][N][l2+l3], dp[0][N][l2]+dp[0][c][l3]+v[N][l].y*2);
                dp[1][N][l2+l3]=min(dp[1][N][l2+l3], dp[1][N][l2]+dp[0][c][l3]+v[N][l].y*2);
                dp[1][N][l2+l3]=min(dp[1][N][l2+l3], dp[0][N][l2]+dp[1][c][l3]+v[N][l].y);
            }
        }
        hi[N]+=hi[c];
    }
    /*cout << N<< ' ' << hi[N] << endl;
    fox1(l, hi[N]){
        cout << dp[0][N][l] << ' ';
    } cout << endl;*/
}
int main(){
    flood(dp);
    cin >> n >> k >> x;
    fox(l, n-1){
        cin >> a >> b >> d;
        v[a].pb(mp(b, d));
        v[b].pb(mp(a, d));
    }
    dfs(x, -1);
    cout << dp[1][x][k];
    return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 784320 KB Output is correct
2 Correct 66 ms 784320 KB Output is correct
3 Correct 66 ms 784320 KB Output is correct
4 Correct 56 ms 784320 KB Output is correct
5 Correct 66 ms 784320 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 784716 KB Output is correct
2 Correct 289 ms 784716 KB Output is correct
3 Correct 296 ms 784920 KB Output is correct
4 Correct 289 ms 784716 KB Output is correct
5 Correct 279 ms 784716 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 784716 KB Output is correct
2 Correct 289 ms 784716 KB Output is correct
3 Correct 296 ms 784920 KB Output is correct
4 Correct 289 ms 784716 KB Output is correct
5 Correct 279 ms 784716 KB Output is correct
6 Correct 273 ms 784716 KB Output is correct
7 Correct 289 ms 784820 KB Output is correct
8 Correct 319 ms 784752 KB Output is correct
9 Correct 296 ms 784716 KB Output is correct
10 Correct 286 ms 784716 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 784320 KB Output is correct
2 Correct 66 ms 784320 KB Output is correct
3 Correct 66 ms 784320 KB Output is correct
4 Correct 56 ms 784320 KB Output is correct
5 Correct 66 ms 784320 KB Output is correct
6 Correct 253 ms 784716 KB Output is correct
7 Correct 289 ms 784716 KB Output is correct
8 Correct 296 ms 784920 KB Output is correct
9 Correct 289 ms 784716 KB Output is correct
10 Correct 279 ms 784716 KB Output is correct
11 Correct 273 ms 784716 KB Output is correct
12 Correct 289 ms 784820 KB Output is correct
13 Correct 319 ms 784752 KB Output is correct
14 Correct 296 ms 784716 KB Output is correct
15 Correct 286 ms 784716 KB Output is correct
16 Correct 303 ms 784716 KB Output is correct
17 Correct 256 ms 784716 KB Output is correct
18 Correct 346 ms 784736 KB Output is correct
19 Correct 299 ms 784776 KB Output is correct
20 Correct 303 ms 784716 KB Output is correct
21 Correct 276 ms 784804 KB Output is correct
22 Correct 279 ms 784716 KB Output is correct
23 Correct 299 ms 784716 KB Output is correct
24 Correct 279 ms 784716 KB Output is correct
25 Correct 263 ms 784976 KB Output is correct