oj.uz

Submission #832261

# Submission time Handle Problem Language Result Execution time Memory
832261 2023-08-21T08:05:06 Z finn__ Wiring (IOI17_wiring) C++17
100 / 100
 56 ms 23896 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
using L = long long;

long long min_total_length(std::vector<int> r, std::vector<int> b)
{
    vector<vector<L>> a;
    auto it = r.begin(), jt = b.begin();

    while (it != r.end() || jt != b.end())
    {
        a.push_back({});
        if (it != r.end() && (jt == b.end() || *it < *jt))
        {
            while (it != r.end() && (jt == b.end() || *it < *jt))
                a.back().push_back(*it), ++it;
        }
        else
        {
            while (jt != b.end() && (it == r.end() || *jt < *it))
                a.back().push_back(*jt), ++jt;
        }
    }

    vector<vector<L>> p = a;
    for (auto &x : p)
        for (size_t i = 1; i < x.size(); ++i)
            x[i] += x[i - 1];

    // dp state, suffix min, prefix min - k * d
    vector<vector<L>> f(a.size()), g(a.size()), h(a.size());
    for (size_t i = 0; i < a.size(); ++i)
    {
        f[i].resize(a[i].size() + 1);
        g[i].resize(a[i].size() + 1);
        h[i].resize(a[i].size() + 1);
        fill(f[i].begin(), f[i].end(), LLONG_MAX / 4);
        fill(g[i].begin(), g[i].end(), LLONG_MAX / 4);
        fill(h[i].begin(), h[i].end(), LLONG_MAX / 4);

        for (L j = 0; j <= a[i].size(); ++j)
        {
            if ((!i && j) || (i == a.size() - 1 && j != a[i].size()))
                continue;
            L d = !i ? 0 : a[i][0] - a[i - 1].back();
            f[i][j] = (j ? p[i][j - 1] : 0) - j * a[i][0];
            if (i)
            {
                f[i][j] += min(j <= a[i - 1].size() ? g[i - 1][j] : LLONG_MAX / 4,
                               j ? (h[i - 1][min<size_t>(j - 1, a[i - 1].size())] + j * d) : LLONG_MAX / 4);
            }

            if (i + 1 < a.size())
            {
                L right_cost = -(p[i].back() - (j ? p[i][j - 1] : 0)) + (L)(a[i].size() - j) * a[i + 1][0];
                g[i][a[i].size() - j] = f[i][j] + right_cost;
                h[i][a[i].size() - j] = f[i][j] + right_cost - (L)(a[i].size() - j) * (a[i + 1][0] - a[i].back());
            }
        }

        for (size_t j = a[i].size() - 1; j < a[i].size(); --j)
            g[i][j] = min(g[i][j], g[i][j + 1]);
        for (size_t j = 1; j < h[i].size(); ++j)
            h[i][j] = min(h[i][j], h[i][j - 1]);
    }

    return f.back().back();
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:42:25: warning: comparison of integer expressions of different signedness: 'L' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (L j = 0; j <= a[i].size(); ++j)
      |                       ~~^~~~~~~~~~~~~~
wiring.cpp:44:54: warning: comparison of integer expressions of different signedness: 'L' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             if ((!i && j) || (i == a.size() - 1 && j != a[i].size()))
      |                                                    ~~^~~~~~~~~~~~~~
wiring.cpp:50:34: warning: comparison of integer expressions of different signedness: 'L' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |                 f[i][j] += min(j <= a[i - 1].size() ? g[i - 1][j] : LLONG_MAX / 4,
      |                                ~~^~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 17 ms 8924 KB Output is correct
4 Correct 18 ms 8860 KB Output is correct
5 Correct 17 ms 8800 KB Output is correct
6 Correct 24 ms 11672 KB Output is correct
7 Correct 23 ms 11692 KB Output is correct
8 Correct 23 ms 11716 KB Output is correct
9 Correct 24 ms 11708 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 56 ms 23896 KB Output is correct
4 Correct 34 ms 18304 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 50 ms 23768 KB Output is correct
19 Correct 48 ms 23764 KB Output is correct
20 Correct 40 ms 18652 KB Output is correct
21 Correct 49 ms 23812 KB Output is correct
22 Correct 45 ms 22116 KB Output is correct
23 Correct 44 ms 22128 KB Output is correct
24 Correct 45 ms 22144 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 22 ms 11064 KB Output is correct
3 Correct 30 ms 15204 KB Output is correct
4 Correct 24 ms 11568 KB Output is correct
5 Correct 29 ms 15204 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 28 ms 11056 KB Output is correct
19 Correct 23 ms 11180 KB Output is correct
20 Correct 22 ms 11444 KB Output is correct
21 Correct 21 ms 11060 KB Output is correct
22 Correct 24 ms 11084 KB Output is correct
23 Correct 23 ms 11172 KB Output is correct
24 Correct 25 ms 11048 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 17 ms 8924 KB Output is correct
20 Correct 18 ms 8860 KB Output is correct
21 Correct 17 ms 8800 KB Output is correct
22 Correct 24 ms 11672 KB Output is correct
23 Correct 23 ms 11692 KB Output is correct
24 Correct 23 ms 11716 KB Output is correct
25 Correct 24 ms 11708 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 56 ms 23896 KB Output is correct
29 Correct 34 ms 18304 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 296 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 300 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 50 ms 23768 KB Output is correct
44 Correct 48 ms 23764 KB Output is correct
45 Correct 40 ms 18652 KB Output is correct
46 Correct 49 ms 23812 KB Output is correct
47 Correct 45 ms 22116 KB Output is correct
48 Correct 44 ms 22128 KB Output is correct
49 Correct 45 ms 22144 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 22 ms 11064 KB Output is correct
52 Correct 30 ms 15204 KB Output is correct
53 Correct 24 ms 11568 KB Output is correct
54 Correct 29 ms 15204 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 296 KB Output is correct
63 Correct 0 ms 300 KB Output is correct
64 Correct 1 ms 300 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 28 ms 11056 KB Output is correct
68 Correct 23 ms 11180 KB Output is correct
69 Correct 22 ms 11444 KB Output is correct
70 Correct 21 ms 11060 KB Output is correct
71 Correct 24 ms 11084 KB Output is correct
72 Correct 23 ms 11172 KB Output is correct
73 Correct 25 ms 11048 KB Output is correct
74 Correct 33 ms 11660 KB Output is correct
75 Correct 24 ms 11416 KB Output is correct
76 Correct 24 ms 11684 KB Output is correct
77 Correct 22 ms 11168 KB Output is correct
78 Correct 21 ms 11048 KB Output is correct
79 Correct 23 ms 11048 KB Output is correct
80 Correct 22 ms 11180 KB Output is correct
81 Correct 22 ms 11072 KB Output is correct
82 Correct 21 ms 11236 KB Output is correct
83 Correct 24 ms 11436 KB Output is correct
84 Correct 24 ms 11828 KB Output is correct
85 Correct 24 ms 11636 KB Output is correct
86 Correct 25 ms 11684 KB Output is correct
87 Correct 26 ms 11680 KB Output is correct
88 Correct 26 ms 11656 KB Output is correct
89 Correct 25 ms 11696 KB Output is correct
90 Correct 27 ms 11572 KB Output is correct
91 Correct 25 ms 11712 KB Output is correct
92 Correct 25 ms 11692 KB Output is correct
93 Correct 24 ms 11684 KB Output is correct
94 Correct 26 ms 11672 KB Output is correct
95 Correct 34 ms 11632 KB Output is correct
96 Correct 26 ms 11672 KB Output is correct
97 Correct 25 ms 11556 KB Output is correct
98 Correct 24 ms 11696 KB Output is correct
99 Correct 25 ms 11680 KB Output is correct
100 Correct 26 ms 11596 KB Output is correct
101 Correct 26 ms 11680 KB Output is correct
102 Correct 27 ms 11680 KB Output is correct