oj.uz

Submission #126371

# Submission time Handle Problem Language Result Execution time Memory
126371 2019-07-07T13:53:15 Z Vlatko Wiring (IOI17_wiring) C++14
100 / 100
 102 ms 17160 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const ll inf = 1e18;

inline void min_self(ll& a, ll b) {
    a = min(a, b);
}

ll min_total_length(vector<int> r, vector<int> b) {
    vector<pii> data;
    for (int i = 0, j = 0; i < (int)r.size() || j < (int)b.size();) {
        if (i == r.size()) {
            data.emplace_back(b[j++], 1);
        } else if (j == b.size()) {
            data.emplace_back(r[i++], 0);
        } else if (r[i] <= b[j]) {
            data.emplace_back(r[i++], 0);
        } else {
            data.emplace_back(b[j++], 1);
        }
    }
    vector<vector<ll>> pos, pre, dp;
    for (int i = 0; i < (int)data.size();) {
        vector<ll> cpos, cpre;
        int j = i;
        while (j < (int)data.size() && data[j].second == data[i].second) {
            cpos.push_back(data[j].first);
            cpre.push_back(cpre.empty() ? data[j].first : cpre.back() + data[j].first);
            ++j;
        }
        pos.push_back(cpos);
        pre.push_back(cpre);
        dp.push_back(vector<ll>(cpos.size()+1, inf));
        i = j;
    }
    // dp[i][j] = min cost for blocks 0 to i, if at j-th item in i-th group
    // (already processed items 0 to j-1)
    int n = dp.size();
    dp[0][0] = 0;
    for (int i = 0; i < n; ++i) {
        int sz = pos[i].size();
        for (int j = 0; j < sz; ++j) {
            if (i > 0) {
                // connect current to last of previous block
                min_self(dp[i][j+1], dp[i][j] + pos[i][j] - pos[i-1].back());
            }
            if (i+1 < n) {
                // connect current to first of next block
                min_self(dp[i][j+1], dp[i][j] + pos[i+1].front() - pos[i][j]);
                if (sz-j <= pos[i+1].size()) {
                    // connect all remaining of this block to those of next block
                    // continue from there
                    // note that the individual costs can be calculated quickly
                    // with prefix sums
                    ll totalwiringcost = pre[i+1][sz-j-1] - pre[i][sz-1];
                    if (j > 0) totalwiringcost += pre[i][j-1];
                    min_self(dp[i+1][sz-j], dp[i][j] + totalwiringcost);
                }
            }
        }
        if (i+1 < n) {
            min_self(dp[i+1][0], dp[i][sz]);
        }
    }
    return dp.back().back();
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:16:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i == r.size()) {
             ~~^~~~~~~~~~~
wiring.cpp:18:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         } else if (j == b.size()) {
                    ~~^~~~~~~~~~~
wiring.cpp:54:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (sz-j <= pos[i+1].size()) {
                     ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 7 ms 380 KB Output is correct
3 Correct 39 ms 9064 KB Output is correct
4 Correct 37 ms 9064 KB Output is correct
5 Correct 37 ms 10216 KB Output is correct
6 Correct 48 ms 12520 KB Output is correct
7 Correct 49 ms 12520 KB Output is correct
8 Correct 51 ms 12520 KB Output is correct
9 Correct 48 ms 12520 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 83 ms 17148 KB Output is correct
4 Correct 66 ms 15848 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 404 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 81 ms 16972 KB Output is correct
19 Correct 82 ms 17032 KB Output is correct
20 Correct 72 ms 16232 KB Output is correct
21 Correct 102 ms 17160 KB Output is correct
22 Correct 80 ms 16204 KB Output is correct
23 Correct 79 ms 15840 KB Output is correct
24 Correct 78 ms 15848 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 40 ms 9576 KB Output is correct
3 Correct 57 ms 11824 KB Output is correct
4 Correct 40 ms 9704 KB Output is correct
5 Correct 57 ms 11880 KB Output is correct
6 Correct 2 ms 360 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 40 ms 10024 KB Output is correct
19 Correct 40 ms 9576 KB Output is correct
20 Correct 40 ms 9680 KB Output is correct
21 Correct 40 ms 10472 KB Output is correct
22 Correct 40 ms 10824 KB Output is correct
23 Correct 39 ms 10600 KB Output is correct
24 Correct 40 ms 10728 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 7 ms 380 KB Output is correct
19 Correct 39 ms 9064 KB Output is correct
20 Correct 37 ms 9064 KB Output is correct
21 Correct 37 ms 10216 KB Output is correct
22 Correct 48 ms 12520 KB Output is correct
23 Correct 49 ms 12520 KB Output is correct
24 Correct 51 ms 12520 KB Output is correct
25 Correct 48 ms 12520 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 83 ms 17148 KB Output is correct
29 Correct 66 ms 15848 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 404 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 81 ms 16972 KB Output is correct
44 Correct 82 ms 17032 KB Output is correct
45 Correct 72 ms 16232 KB Output is correct
46 Correct 102 ms 17160 KB Output is correct
47 Correct 80 ms 16204 KB Output is correct
48 Correct 79 ms 15840 KB Output is correct
49 Correct 78 ms 15848 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 40 ms 9576 KB Output is correct
52 Correct 57 ms 11824 KB Output is correct
53 Correct 40 ms 9704 KB Output is correct
54 Correct 57 ms 11880 KB Output is correct
55 Correct 2 ms 360 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 256 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 256 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 40 ms 10024 KB Output is correct
68 Correct 40 ms 9576 KB Output is correct
69 Correct 40 ms 9680 KB Output is correct
70 Correct 40 ms 10472 KB Output is correct
71 Correct 40 ms 10824 KB Output is correct
72 Correct 39 ms 10600 KB Output is correct
73 Correct 40 ms 10728 KB Output is correct
74 Correct 48 ms 11904 KB Output is correct
75 Correct 43 ms 10344 KB Output is correct
76 Correct 47 ms 10600 KB Output is correct
77 Correct 42 ms 10472 KB Output is correct
78 Correct 42 ms 11240 KB Output is correct
79 Correct 41 ms 10984 KB Output is correct
80 Correct 41 ms 10724 KB Output is correct
81 Correct 42 ms 11752 KB Output is correct
82 Correct 41 ms 10188 KB Output is correct
83 Correct 43 ms 11624 KB Output is correct
84 Correct 47 ms 11672 KB Output is correct
85 Correct 47 ms 10728 KB Output is correct
86 Correct 48 ms 11368 KB Output is correct
87 Correct 48 ms 11748 KB Output is correct
88 Correct 47 ms 10600 KB Output is correct
89 Correct 47 ms 10316 KB Output is correct
90 Correct 48 ms 11240 KB Output is correct
91 Correct 48 ms 11140 KB Output is correct
92 Correct 48 ms 11752 KB Output is correct
93 Correct 48 ms 10344 KB Output is correct
94 Correct 48 ms 10984 KB Output is correct
95 Correct 48 ms 10572 KB Output is correct
96 Correct 47 ms 11240 KB Output is correct
97 Correct 52 ms 12136 KB Output is correct
98 Correct 48 ms 11848 KB Output is correct
99 Correct 51 ms 12012 KB Output is correct
100 Correct 48 ms 10976 KB Output is correct
101 Correct 50 ms 12008 KB Output is correct
102 Correct 47 ms 10472 KB Output is correct