oj.uz

Submission #859641

# Submission time Handle Problem Language Result Execution time Memory
859641 2023-10-10T12:03:32 Z boris_mihov Road Closures (APIO21_roads) C++17
24 / 100
 486 ms 71672 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 <std::pair <llong,int>> 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)), u});
    }

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

    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);
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        for (int k = 0 ; k + 1 < n ; ++k)
        {
            assert(f(i, k, false) - f(i, k + 1, false) >= f(i, k + 1, false) - f(i, k + 2, false));
        }
    }

    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 251 ms 692 KB Output is correct
3 Correct 283 ms 600 KB Output is correct
4 Correct 302 ms 852 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 215 ms 692 KB Output is correct
9 Correct 299 ms 856 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Runtime error 14 ms 3500 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 596 KB Output is correct
2 Runtime error 22 ms 4700 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 3 ms 7004 KB Output is correct
5 Correct 5 ms 7004 KB Output is correct
6 Correct 4 ms 6488 KB Output is correct
7 Correct 4 ms 7000 KB Output is correct
8 Correct 5 ms 7104 KB Output is correct
9 Correct 5 ms 7200 KB Output is correct
10 Correct 4 ms 7356 KB Output is correct
11 Correct 5 ms 7260 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 5 ms 7132 KB Output is correct
18 Correct 5 ms 7004 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 3 ms 7004 KB Output is correct
5 Correct 5 ms 7004 KB Output is correct
6 Correct 4 ms 6488 KB Output is correct
7 Correct 4 ms 7000 KB Output is correct
8 Correct 5 ms 7104 KB Output is correct
9 Correct 5 ms 7200 KB Output is correct
10 Correct 4 ms 7356 KB Output is correct
11 Correct 5 ms 7260 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 5 ms 7132 KB Output is correct
18 Correct 5 ms 7004 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 165 ms 43132 KB Output is correct
24 Correct 445 ms 69968 KB Output is correct
25 Correct 329 ms 61844 KB Output is correct
26 Correct 396 ms 67336 KB Output is correct
27 Correct 383 ms 11224 KB Output is correct
28 Correct 413 ms 13024 KB Output is correct
29 Correct 365 ms 65564 KB Output is correct
30 Correct 313 ms 43940 KB Output is correct
31 Correct 371 ms 60668 KB Output is correct
32 Correct 447 ms 27476 KB Output is correct
33 Correct 333 ms 63064 KB Output is correct
34 Correct 439 ms 71672 KB Output is correct
35 Correct 377 ms 65692 KB Output is correct
36 Correct 246 ms 600 KB Output is correct
37 Correct 290 ms 1112 KB Output is correct
38 Correct 315 ms 604 KB Output is correct
39 Correct 0 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 4 ms 6492 KB Output is correct
44 Correct 5 ms 7000 KB Output is correct
45 Correct 5 ms 7096 KB Output is correct
46 Correct 4 ms 7000 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 5 ms 7260 KB Output is correct
49 Correct 5 ms 7260 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 2 ms 348 KB Output is correct
53 Correct 283 ms 54612 KB Output is correct
54 Correct 445 ms 69976 KB Output is correct
55 Correct 383 ms 11252 KB Output is correct
56 Correct 223 ms 676 KB Output is correct
57 Correct 326 ms 704 KB Output is correct
58 Correct 2 ms 4700 KB Output is correct
59 Correct 5 ms 7148 KB Output is correct
60 Correct 7 ms 7004 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 2 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 451 ms 69148 KB Output is correct
65 Correct 486 ms 69784 KB Output is correct
66 Correct 471 ms 56600 KB Output is correct
67 Correct 463 ms 23384 KB Output is correct
68 Correct 327 ms 46240 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 25 ms 5216 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 25 ms 5216 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 1 ms 600 KB Output is correct
2 Correct 251 ms 692 KB Output is correct
3 Correct 283 ms 600 KB Output is correct
4 Correct 302 ms 852 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 215 ms 692 KB Output is correct
9 Correct 299 ms 856 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Runtime error 14 ms 3500 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -