oj.uz

답안 #83357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
83357 2018-11-07T10:30:17 Z charlies_moo Dostavljač (COCI18_dostavljac) C++17
14 / 140
 195 ms 748 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

typedef vector<int> vi;
typedef struct {
    int *dp1, *dp2;
} node;

node dfs(vi e[], int a[], int x, int p, int m) {
    node ret;
    ret.dp1 = new int[m+1];
    ret.dp2 = new int[m+1];
    memset(ret.dp1, 0, sizeof(int) * (m+1));
    memset(ret.dp2, 0, sizeof(int) * (m+1));
    ret.dp1[1] = ret.dp2[1] = a[x];

    for (int i = 0; i < e[x].size(); i++) {
        if (e[x][i] == p) {
            continue;
        }

        node t = dfs(e, a, e[x][i], x, m);
        for (int j = m; j >= 0; j--) {
            for (int k = 0; k <= j - 1; k++) {
            	if (j - k - 2 >= 0) {
            		ret.dp1[j] = max(ret.dp1[j], ret.dp1[j-k-2] + t.dp1[k]);
				}
                ret.dp2[j] = max(ret.dp2[j], ret.dp1[j-k-1] + t.dp2[k]);
            }
        }
        
        delete[] t.dp1;
        delete[] t.dp2;
    }
    
//    printf("%d:\n", x);
//    for (int i = 0; i <= m; i++) {
//    	printf("%d %d %d\n", i, ret.dp1[i], ret.dp2[i]);
//	}

    return ret;
}

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    int a[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    vi e[n];
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        scanf("%d %d", &u, &v);
        u--, v--;
        e[u].push_back(v);
        e[v].push_back(u);
    }

    node ret = dfs(e, a, 0, -1, m);
    int ans = 0;
	for (int i = 0; i <= m; i++) {
		ans = max(ans, ret.dp2[i]);
	}
    printf("%d\n", ans);

    return 0;
}

Compilation message

dostavljac.cpp: In function 'node dfs(vi*, int*, int, int, int)':
dostavljac.cpp:21:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < e[x].size(); i++) {
                     ~~^~~~~~~~~~~~~
dostavljac.cpp: In function 'int main()':
dostavljac.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
dostavljac.cpp:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
dostavljac.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 464 KB Output isn't correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 464 KB Output isn't correct

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 52 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 104 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 195 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -