oj.uz

Submission #83397

# Submission time Handle Problem Language Result Execution time Memory
83397 2018-11-07T13:42:49 Z charlies_moo Dostavljač (COCI18_dostavljac) C++17
140 / 140
 206 ms 804 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.dp2[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;
    }
 
    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:46: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:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
dostavljac.cpp:54: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 292 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 408 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 4 ms 604 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 34 ms 624 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 760 KB Output is correct
2 Correct 19 ms 760 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 760 KB Output is correct
2 Correct 135 ms 784 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 784 KB Output is correct
2 Correct 43 ms 784 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 804 KB Output is correct
2 Correct 21 ms 804 KB Output is correct