oj.uz

Submission #859640

# Submission time Handle Problem Language Result Execution time Memory
859640 2023-10-10T11:59:07 Z boris_mihov Road Closures (APIO21_roads) C++17
24 / 100
 529 ms 71496 KB 
#include "roads.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 2000 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;

int n;
std::vector <std::pair <int,int>> g[MAXN];
bool bl[MAXN][MAXN][2];
llong dp[MAXN][MAXN][2];

void firstDFS(int node, int par)
{
    for (auto &curr : g[node])
    {
        if (curr.first == par)
        {
            std::swap(curr, g[node].back());
            g[node].pop_back();
            break;
        }
    }

    for (const auto &[u, w] : g[node])
    {
        firstDFS(u, node);
    }
}

llong f(int node, int k, bool k2)
{
    // if (k == 1) std::cout << "call: " << node << ' ' << g[node].size() << ' ' << k << '\n';
    if (g[node].empty())
    {
        return 0;
    }

    if (bl[node][k][k2])
    {
        return dp[node][k][k2];
    }

    bl[node][k][k2] = true;
    std::vector <llong> vals;
    for (const auto &[u, w] : g[node])
    {
        dp[node][k][k2] += w + f(u, k + k2, false);
        vals.push_back(f(u, k + k2 - 1, true) - (w + f(u, k + k2, false)));
    }

    std::sort(vals.begin(), vals.end());
    for (int i = 0 ; i < std::min((int)vals.size(), k) ; ++i)
    {
        if (vals[i] >= 0) break;
        dp[node][k][k2] += vals[i];
    }

    return dp[node][k][k2];
}

std::vector <llong> minimum_closure_costs(int N, std::vector <int> U, std::vector <int> V, std::vector <int> W)
{
    n = N;
    for (int i = 0 ; i < n - 1 ; ++i)
    {
        g[U[i] + 1].push_back({V[i] + 1, W[i]});
        g[V[i] + 1].push_back({U[i] + 1, W[i]});
    }

    firstDFS(1, 0);
    std::vector <llong> ans(n);
    for (int i = 0 ; i < n ; ++i)
    {
        ans[i] = f(1, i, false);
    }

    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 152 ms 668 KB Output is correct
3 Correct 186 ms 800 KB Output is correct
4 Correct 83 ms 708 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 74 ms 932 KB Output is correct
9 Correct 99 ms 688 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Runtime error 15 ms 4004 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 22 ms 4556 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 7084 KB Output is correct
5 Correct 4 ms 7192 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 4 ms 7004 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct
10 Correct 4 ms 7256 KB Output is correct
11 Correct 4 ms 7260 KB Output is correct
12 Correct 4 ms 7260 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 4 ms 7136 KB Output is correct
18 Correct 4 ms 7004 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 7084 KB Output is correct
5 Correct 4 ms 7192 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 4 ms 7004 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct
10 Correct 4 ms 7256 KB Output is correct
11 Correct 4 ms 7260 KB Output is correct
12 Correct 4 ms 7260 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 4 ms 7136 KB Output is correct
18 Correct 4 ms 7004 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 178 ms 43184 KB Output is correct
24 Correct 391 ms 69988 KB Output is correct
25 Correct 299 ms 61668 KB Output is correct
26 Correct 284 ms 67428 KB Output is correct
27 Correct 219 ms 11020 KB Output is correct
28 Correct 159 ms 12888 KB Output is correct
29 Correct 314 ms 65364 KB Output is correct
30 Correct 193 ms 44040 KB Output is correct
31 Correct 200 ms 60732 KB Output is correct
32 Correct 165 ms 27488 KB Output is correct
33 Correct 280 ms 63324 KB Output is correct
34 Correct 369 ms 71496 KB Output is correct
35 Correct 290 ms 65728 KB Output is correct
36 Correct 158 ms 600 KB Output is correct
37 Correct 191 ms 712 KB Output is correct
38 Correct 86 ms 1212 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 3 ms 7004 KB Output is correct
42 Correct 5 ms 7004 KB Output is correct
43 Correct 3 ms 6492 KB Output is correct
44 Correct 4 ms 7004 KB Output is correct
45 Correct 4 ms 7004 KB Output is correct
46 Correct 4 ms 6944 KB Output is correct
47 Correct 3 ms 7260 KB Output is correct
48 Correct 4 ms 7260 KB Output is correct
49 Correct 4 ms 7260 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 229 ms 54872 KB Output is correct
54 Correct 392 ms 69916 KB Output is correct
55 Correct 194 ms 11168 KB Output is correct
56 Correct 65 ms 600 KB Output is correct
57 Correct 100 ms 700 KB Output is correct
58 Correct 2 ms 4700 KB Output is correct
59 Correct 4 ms 7156 KB Output is correct
60 Correct 4 ms 7004 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 529 ms 68944 KB Output is correct
65 Correct 373 ms 69804 KB Output is correct
66 Correct 169 ms 56604 KB Output is correct
67 Correct 154 ms 23320 KB Output is correct
68 Correct 174 ms 46420 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 5232 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 5232 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 152 ms 668 KB Output is correct
3 Correct 186 ms 800 KB Output is correct
4 Correct 83 ms 708 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 74 ms 932 KB Output is correct
9 Correct 99 ms 688 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Runtime error 15 ms 4004 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -