Submission #483174

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
483174	2021-10-28 03:22:30	ntabc05101	Dostavljač (COCI18_dostavljac)	C++14	140 / 140	253 ms	4252 KiB

dostavljac

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 mxN = 505;
int n, m;
int a[mxN];
vector<int> adj[mxN];
long long dp[mxN][mxN][2];
void dfs(int u, int p = -1) {
  dp[u][1][0] = 0;
  for (auto &to: adj[u]) {
    if (to != p) {
      dfs(to, u);
      for (int i = m; i; i--) {
        auto &res = dp[u][i][0];
        auto &res2 = dp[u][i][1];
        for (int j = 0; j < i; j++) {
          if (i - j > 2) {
            res = max(res, dp[u][i - j - 3][0] + dp[to][j][1]);
            //res2 = max(res2, dp[u][i - j - 3][1] + dp[to][j][1] + a[u]);
          }
          if (i - j > 1) {
            //res = max(res, dp[u][i - j - 2][1] + dp[to][j][0] + a[u]);
            res = max(res, dp[u][i - j - 2][0] + dp[to][j][1]);
            res2 = max(res2, dp[u][i - j - 2][1] + dp[to][j][1]);
          }
          //if (i > j) {
            res = max(res, dp[u][i - j - 1][1] + dp[to][j][0]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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