oj.uz

Submission #554712

# Submission time Handle Problem Language Result Execution time Memory
554712 2022-04-29T09:00:28 Z Yazan_Alattar Dostavljač (COCI18_dostavljac) C++14
140 / 140
 283 ms 4352 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 2007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

vector <int> adj[M];
ll n, m, dp[M][M][2], ans;

void dfs(int node, int p){
    for(auto i : adj[node]) if(i != p){
        dfs(i, node);

        for(int j = m; j; --j)
            for(int k = 0; k < j; ++k){
                if(k + 1 < j) dp[node][j][0] = max(dp[node][j][0], dp[node][j - k - 2][0] + dp[i][k][0]);
                if(k + 1 < j) dp[node][j][1] = max(dp[node][j][1], dp[node][j - k - 2][1] + dp[i][k][0]);
                dp[node][j][1] = max(dp[node][j][1], dp[node][j - k - 1][0] + dp[i][k][1]);
        }
    }
    return;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> dp[i][1][0], dp[i][1][1] = dp[i][1][0];
    for(int i = 1; i < n; ++i){
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }

    dfs(1, 0);

    for(int i = 1; i <= m; ++i) for(int j = 0; j < 2; ++j) ans = max(ans, dp[1][i][j]);
    cout << ans << endl;

    return 0;
}

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 8 ms 852 KB Output is correct
2 Correct 3 ms 860 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 41 ms 1176 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 1732 KB Output is correct
2 Correct 26 ms 1552 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1940 KB Output is correct
2 Correct 188 ms 1860 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 3248 KB Output is correct
2 Correct 56 ms 2996 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 4352 KB Output is correct
2 Correct 28 ms 2480 KB Output is correct