Submission #319342

#	Time	Username	Problem	Language	Result	Execution time	Memory
319342		caoash	Dostavljač (COCI18_dostavljac)	C++14	14 / 140	2091 ms	5100 KiB

dostavljac

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

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

int n, m;
vi adj[MX];
int a[MX];
int ans = 0;

void solve(int v, int x, int d, int mask) {
    if (x > m) return;
    ans = max(ans, d);
    for (int to : adj[v]) {
        solve(to, x + 1, d, mask); 
    }
    if (!(mask & (1 << v))) solve(v, x + 1, d + a[v], mask | (1 << v));
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v;
        u--, v--;
        adj[u].pb(v), adj[v].pb(u);
    }
    solve(0, 0, 0, 0);
    cout << ans << '\n';
}

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