oj.uz

Submission #701003

# Submission time Handle Problem Language Result Execution time Memory
701003 2023-02-19T17:11:55 Z Do_you_copy Dostavljač (COCI18_dostavljac) C++17
140 / 140
 348 ms 4300 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back

using namespace std;
using ll = long long;
using pii = pair <int, int>;

const int maxN = 506 + 1;
const int inf = 0x3f3f3f3f;
//const int Mod =
int n, m;
int a[maxN];
vector <int> adj[maxN];

ll dp[maxN][maxN][2];
int sz[maxN];

void dfs(int u, int p){
    sz[u] = 1;
    for (int i: adj[u]){
        if (i == p) continue;
        dfs(i, u);
        sz[u] += sz[i];
        vector <ll> tem[2];
        tem[0].resize(m + 1, 0);
        tem[1].resize(m + 1, 0);
        for (int j = 0; j <= m; ++j){
            for (int k = 0; k < j; ++k){
                if (j - k > 1){
                    tem[0][j] = max(tem[0][j], dp[u][j - k - 2][0] + dp[i][k][0]);
                    tem[1][j] = max(tem[1][j], dp[u][j - k - 2][1] + dp[i][k][0]);
                }
                tem[1][j] = max(tem[1][j], dp[u][j - k - 1][0] + dp[i][k][1]);
            }
        }
        for (int j = 0; j <= m; ++j){
            dp[u][j][0] = max(dp[u][j][0], tem[0][j]);
            dp[u][j][1] = max(dp[u][j][1], tem[1][j]);
        }
    }
    for (int j = m; j >= 1; --j){
        dp[u][j][0] = max(dp[u][j][0], dp[u][j - 1][0] + a[u]);
        dp[u][j][1] = max(dp[u][j][1], dp[u][j - 1][1] + a[u]);
    }
}

void Init(){
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i < n; ++i){
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    dfs(1, 0);
    ll ans = 0;
    for (int i = 0; i <= m; ++i) ans = max(ans, dp[1][i][1]);
    cout << ans;
}

#define taskname "test"
signed main(){
    faster
    if (fopen(taskname ".inp", "r")){
        freopen(taskname ".inp", "r", stdin);
        freopen(taskname ".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
    }
}

Compilation message

dostavljac.cpp: In function 'int main()':
dostavljac.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen(taskname ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dostavljac.cpp:70:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         freopen(taskname ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
14.0 / 14.0

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

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 944 KB Output is correct
2 Correct 3 ms 852 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1108 KB Output is correct
2 Correct 54 ms 1476 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 1924 KB Output is correct
2 Correct 34 ms 1760 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2380 KB Output is correct
2 Correct 225 ms 2648 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 3464 KB Output is correct
2 Correct 68 ms 3436 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 4300 KB Output is correct
2 Correct 34 ms 3440 KB Output is correct