Submission #1263026

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263026		CodeLakVN	Dostavljač (COCI18_dostavljac)	C++20	140 / 140	131 ms	2428 KiB

dostavljac

#include <bits/stdc++.h>
using namespace std;

#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

const int MAX_N = 503;

int nNode, m;
int a[MAX_N];
int dp[2][MAX_N][MAX_N];
vector<int> adj[MAX_N];

void dfs(int u, int p) {
    FOR(i, 1, m) dp[0][u][i] = dp[1][u][i] = a[u];

    for (int v : adj[u]) if (v != p) {
        dfs(v, u);

        FOD(i, m, 1) {
            FOR(j, 0, i) {
                if (i - j - 1 >= 0)
                    maximize(dp[0][u][i], max(dp[0][v][j], dp[1][v][j]) + dp[1][u][i - j - 1]);
                if (i - j - 2 >= 0) {
                    maximize(dp[0][u][i], dp[1][v][j] + dp[0][u][i - j - 2]);
                    maximize(dp[1][u][i], dp[1][v][j] + dp[1][u][i - j - 2]);
                }
            }
        }
    }
}

void solve() {
    cin >> nNode >> m;
    FOR(i, 1, nNode) cin >> a[i];
    FOR(i, 1, nNode - 1) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs(1, -1);
    cout << max(dp[1][1][m], dp[0][1][m]);
}

int32_t main() {
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = 0;
    int numTest = 1;
    if (multitest) cin >> numTest;

    while (numTest--) {
        solve();
    }

    return 0;
}

/* Lak lu theo dieu nhac!!!! */

Compilation message (stderr)

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

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14