oj.uz

Submission #98432

# Submission time Handle Problem Language Result Execution time Memory
98432 2019-02-23T15:30:51 Z bogdan10bos Wiring (IOI17_wiring) C++14
100 / 100
 177 ms 13080 KB 
#include <bits/stdc++.h>

#include "wiring.h"

using namespace std;

typedef long long LL;
typedef pair<int, int> pii;

LL min_total_length(vector<int> r, vector<int> b)
{
    int N = r.size(), M = b.size();
    int K = N + M;

	vector<pii> v;
	for(auto &x: r) v.emplace_back(x, 0);
	for(auto &x: b) v.emplace_back(x, 1);
	sort(begin(v), end(v));

	vector<LL> sum;
	sum.resize(K + 5);
	sum[0] = v[0].first;
	for(int i = 1; i < K; i++)  sum[i] = sum[i - 1] + v[i].first;

	vector<LL> dp;
	dp.resize(K + 5);

    multiset<LL> lessK, moreK;

	int st = -1, lstst = -1, lstdr = -1, col = -1;
	for(int i = 0; i < K; i++)
    {
        if(col != v[i].second)
        {
            lstst = st, lstdr = i - 1;
            st = i, col = v[i].second;
            lessK.clear(), moreK.clear();

            if(lstst != -1)
            {
                LL cost = 0LL;
                for(int i = lstdr; i >= lstst; i--)
                {
                    cost += v[st].first - v[i].first;
                    LL dpcost = cost;
                    if(i > 0)   dpcost += dp[i - 1];
                    lessK.insert(dpcost);
                }
                moreK.insert(dp[lstdr]);
            }
        }

        dp[i] = 1LL << 60;
        if(lstst == -1) continue;

        LL sumRight = (sum[i] - sum[st]) - 1LL * (i - st) * v[st].first;
        int lgt = (i - st + 1);

        if(!lessK.empty())
        {
            LL cost = sumRight + (*lessK.begin());
            dp[i] = min(dp[i], cost);
        }
        if(!moreK.empty())
        {
            LL cost = sumRight + 1LL * lgt * (v[st].first - v[lstdr].first) + (*moreK.begin());
            dp[i] = min(dp[i], cost);
        }

        if(lstdr - lstst + 1 >= lgt)
        {
            LL sumLeft = 1LL * lgt * v[lstdr].first - (sum[lstdr] - sum[lstdr - lgt + 1] + v[lstdr - lgt + 1].first);
            LL cost = sumLeft;
            if(lstdr - lgt + 1 > 0) cost += dp[lstdr - lgt];
            moreK.insert(cost);
            cost += 1LL * lgt * (v[st].first - v[lstdr].first);
            lessK.erase( lessK.find(cost) );
        }
    }

    return dp[K - 1];
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 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 3 ms 256 KB Output is correct
3 Correct 86 ms 9704 KB Output is correct
4 Correct 87 ms 9796 KB Output is correct
5 Correct 69 ms 7400 KB Output is correct
6 Correct 116 ms 11240 KB Output is correct
7 Correct 107 ms 11368 KB Output is correct
8 Correct 106 ms 11372 KB Output is correct
9 Correct 118 ms 11240 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 96 ms 6732 KB Output is correct
4 Correct 101 ms 8424 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 0 ms 128 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 256 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 3 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 117 ms 8780 KB Output is correct
19 Correct 124 ms 8672 KB Output is correct
20 Correct 111 ms 8680 KB Output is correct
21 Correct 89 ms 8808 KB Output is correct
22 Correct 113 ms 8756 KB Output is correct
23 Correct 105 ms 8716 KB Output is correct
24 Correct 140 ms 8684 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 107 ms 7016 KB Output is correct
3 Correct 75 ms 6760 KB Output is correct
4 Correct 117 ms 6732 KB Output is correct
5 Correct 115 ms 6768 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 128 KB Output is correct
18 Correct 166 ms 9876 KB Output is correct
19 Correct 127 ms 8040 KB Output is correct
20 Correct 90 ms 8040 KB Output is correct
21 Correct 124 ms 8808 KB Output is correct
22 Correct 127 ms 11628 KB Output is correct
23 Correct 117 ms 12100 KB Output is correct
24 Correct 141 ms 11240 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 3 ms 256 KB Output is correct
19 Correct 86 ms 9704 KB Output is correct
20 Correct 87 ms 9796 KB Output is correct
21 Correct 69 ms 7400 KB Output is correct
22 Correct 116 ms 11240 KB Output is correct
23 Correct 107 ms 11368 KB Output is correct
24 Correct 106 ms 11372 KB Output is correct
25 Correct 118 ms 11240 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 96 ms 6732 KB Output is correct
29 Correct 101 ms 8424 KB Output is correct
30 Correct 3 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 0 ms 128 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 3 ms 256 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 3 ms 256 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 4 ms 384 KB Output is correct
41 Correct 3 ms 256 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 117 ms 8780 KB Output is correct
44 Correct 124 ms 8672 KB Output is correct
45 Correct 111 ms 8680 KB Output is correct
46 Correct 89 ms 8808 KB Output is correct
47 Correct 113 ms 8756 KB Output is correct
48 Correct 105 ms 8716 KB Output is correct
49 Correct 140 ms 8684 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 107 ms 7016 KB Output is correct
52 Correct 75 ms 6760 KB Output is correct
53 Correct 117 ms 6732 KB Output is correct
54 Correct 115 ms 6768 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 0 ms 384 KB Output is correct
58 Correct 3 ms 256 KB Output is correct
59 Correct 3 ms 384 KB Output is correct
60 Correct 3 ms 384 KB Output is correct
61 Correct 3 ms 384 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 3 ms 384 KB Output is correct
65 Correct 2 ms 384 KB Output is correct
66 Correct 2 ms 128 KB Output is correct
67 Correct 166 ms 9876 KB Output is correct
68 Correct 127 ms 8040 KB Output is correct
69 Correct 90 ms 8040 KB Output is correct
70 Correct 124 ms 8808 KB Output is correct
71 Correct 127 ms 11628 KB Output is correct
72 Correct 117 ms 12100 KB Output is correct
73 Correct 141 ms 11240 KB Output is correct
74 Correct 121 ms 12772 KB Output is correct
75 Correct 105 ms 10600 KB Output is correct
76 Correct 114 ms 11624 KB Output is correct
77 Correct 159 ms 10984 KB Output is correct
78 Correct 111 ms 11372 KB Output is correct
79 Correct 108 ms 10980 KB Output is correct
80 Correct 108 ms 11240 KB Output is correct
81 Correct 130 ms 12272 KB Output is correct
82 Correct 123 ms 12432 KB Output is correct
83 Correct 124 ms 12136 KB Output is correct
84 Correct 114 ms 13028 KB Output is correct
85 Correct 118 ms 10804 KB Output is correct
86 Correct 123 ms 11880 KB Output is correct
87 Correct 161 ms 11880 KB Output is correct
88 Correct 122 ms 11368 KB Output is correct
89 Correct 121 ms 11508 KB Output is correct
90 Correct 177 ms 11360 KB Output is correct
91 Correct 131 ms 12648 KB Output is correct
92 Correct 115 ms 11752 KB Output is correct
93 Correct 161 ms 11880 KB Output is correct
94 Correct 108 ms 12376 KB Output is correct
95 Correct 135 ms 11316 KB Output is correct
96 Correct 148 ms 12136 KB Output is correct
97 Correct 123 ms 13080 KB Output is correct
98 Correct 139 ms 12668 KB Output is correct
99 Correct 129 ms 12776 KB Output is correct
100 Correct 128 ms 11752 KB Output is correct
101 Correct 140 ms 12428 KB Output is correct
102 Correct 151 ms 11940 KB Output is correct