Submission #233722

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
233722	2020-05-21 14:37:55	jungsnow	Džumbus (COCI19_dzumbus)	C++14	0 / 110	639 ms	8312 KiB

dzumbus

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m, Q, S, dp[N][N], M[N], A[N], F[N][N];
vector<int> adj[N];
void dfs(int par, int u) {
    M[u] = A[u];
    dp[u][A[u]] = 1;
    for (int v : adj[u]) if (v != par) {
        dfs(u, v);
        M[u] += M[v];
        for (int j = M[u]; j > A[u]; j--) {
            for (int iv = min(j, M[v]); iv >= 0; iv--) {
                if (j - iv < A[u]) continue;
                dp[u][j] = max(dp[u][j], dp[v][iv] + dp[u][j - iv]);
            }
        }
    }
}
void getF(int par, int u) {
    int sum = 0;
    for (int v : adj[u]) if (v != par) {
        getF(u, v);
        sum += M[v];
        for (int j = sum; j > 0; j--) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30