Submission #289252

# Submission time Handle Problem Language Result Execution time Memory
289252 2020-09-02T13:42:47 Z SamAnd Wiring (IOI17_wiring) C++17
100 / 100
80 ms 8052 KB
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 200005;
const ll INF = 1000000009000000009;

ll ans;
int rn, bn;

int n;
pair<int, int> a[N];
ll p[N];

ll dp[N];

void rec(int l, int r, int ul, int ur, int l0)
{
    if (l > r)
        return;
    int m = (l + r) / 2;

    dp[m] = INF;
    int u;
    for (int i = ul; i <= ur; ++i)
    {
        ll ans = dp[i - 1];
        ans += p[m] - p[l0 - 1];
        ans -= p[l0 - 1] - p[i - 1];
        int qr = (m - l0 + 1);
        int ql = (l0 - 1 - i + 1);
        if (qr > ql)
            ans -= (qr - ql) * 1LL * a[l0 - 1].fi;
        else
            ans += (ql - qr) * 1LL * a[l0].fi;
        if (ans < dp[m])
        {
            dp[m] = ans;
            u = i;
        }
    }
    rec(l, m - 1, u, ur, l0);
    rec(m + 1, r, ul, u, l0);
}

long long min_total_length(std::vector<int> r, std::vector<int> b)
{
    rn = sz(r);
    bn = sz(b);

    for (int i = 0; i < rn; ++i)
        a[++n] = m_p(r[i], 0);
    for (int i = 0; i < bn; ++i)
        a[++n] = m_p(b[i], 1);
    sort(a + 1, a + n + 1);

    for (int i = 1; i <= n; ++i)
    {
        p[i] = p[i - 1] + a[i].fi;
    }

    vector<pair<int, int> > v;
    int l = 1;
    for (int i = 2; i <= n; ++i)
    {
        if (a[i].se != a[i - 1].se)
        {
            v.push_back(m_p(l, i - 1));
            l = i;
        }
    }
    v.push_back(m_p(l, n));

    for (int i = v[0].fi; i <= v[0].se; ++i)
    {
        dp[i] = INF;
    }
    for (int i = 1; i < sz(v); ++i)
    {
        if (v[i - 1].fi == v[i - 1].se)
        {
            /*for (int j = v[i].fi; j <= v[i].se; ++j)
            {
                dp[j] = dp[v[i].fi - 1];
                dp[j] += p[j] - p[v[i].fi - 1];
                dp[j] -= (j - v[i].fi + 1) * 1LL * a[v[i].fi - 1].fi;
            }*/
            dp[v[i - 1].fi - 1] = min(dp[v[i - 1].fi - 1], dp[v[i - 1].fi]);
        }
        //else
        {
            rec(v[i].fi, v[i].se, v[i - 1].fi, v[i - 1].se, v[i].fi);
        }
    }

    return dp[n];
}

Compilation message

wiring.cpp: In function 'void rec(int, int, int, int, int)':
wiring.cpp:47:8: warning: 'u' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |     rec(l, m - 1, u, ur, l0);
      |     ~~~^~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 380 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 46 ms 4968 KB Output is correct
4 Correct 35 ms 4984 KB Output is correct
5 Correct 34 ms 4992 KB Output is correct
6 Correct 57 ms 6520 KB Output is correct
7 Correct 48 ms 6520 KB Output is correct
8 Correct 48 ms 6520 KB Output is correct
9 Correct 48 ms 6520 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 75 ms 7152 KB Output is correct
4 Correct 67 ms 7812 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 74 ms 8052 KB Output is correct
19 Correct 63 ms 8048 KB Output is correct
20 Correct 70 ms 7920 KB Output is correct
21 Correct 63 ms 7984 KB Output is correct
22 Correct 73 ms 7940 KB Output is correct
23 Correct 71 ms 7980 KB Output is correct
24 Correct 63 ms 8048 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 76 ms 6536 KB Output is correct
3 Correct 64 ms 6900 KB Output is correct
4 Correct 62 ms 6520 KB Output is correct
5 Correct 63 ms 6900 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 372 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 54 ms 7416 KB Output is correct
19 Correct 68 ms 7544 KB Output is correct
20 Correct 61 ms 7544 KB Output is correct
21 Correct 52 ms 7416 KB Output is correct
22 Correct 55 ms 7416 KB Output is correct
23 Correct 46 ms 7416 KB Output is correct
24 Correct 53 ms 7416 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 380 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 46 ms 4968 KB Output is correct
20 Correct 35 ms 4984 KB Output is correct
21 Correct 34 ms 4992 KB Output is correct
22 Correct 57 ms 6520 KB Output is correct
23 Correct 48 ms 6520 KB Output is correct
24 Correct 48 ms 6520 KB Output is correct
25 Correct 48 ms 6520 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 75 ms 7152 KB Output is correct
29 Correct 67 ms 7812 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 288 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 74 ms 8052 KB Output is correct
44 Correct 63 ms 8048 KB Output is correct
45 Correct 70 ms 7920 KB Output is correct
46 Correct 63 ms 7984 KB Output is correct
47 Correct 73 ms 7940 KB Output is correct
48 Correct 71 ms 7980 KB Output is correct
49 Correct 63 ms 8048 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 76 ms 6536 KB Output is correct
52 Correct 64 ms 6900 KB Output is correct
53 Correct 62 ms 6520 KB Output is correct
54 Correct 63 ms 6900 KB Output is correct
55 Correct 0 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 372 KB Output is correct
66 Correct 1 ms 384 KB Output is correct
67 Correct 54 ms 7416 KB Output is correct
68 Correct 68 ms 7544 KB Output is correct
69 Correct 61 ms 7544 KB Output is correct
70 Correct 52 ms 7416 KB Output is correct
71 Correct 55 ms 7416 KB Output is correct
72 Correct 46 ms 7416 KB Output is correct
73 Correct 53 ms 7416 KB Output is correct
74 Correct 52 ms 7416 KB Output is correct
75 Correct 80 ms 7564 KB Output is correct
76 Correct 76 ms 7548 KB Output is correct
77 Correct 57 ms 7416 KB Output is correct
78 Correct 63 ms 7440 KB Output is correct
79 Correct 57 ms 7416 KB Output is correct
80 Correct 51 ms 7416 KB Output is correct
81 Correct 55 ms 7416 KB Output is correct
82 Correct 48 ms 7416 KB Output is correct
83 Correct 52 ms 7420 KB Output is correct
84 Correct 49 ms 7416 KB Output is correct
85 Correct 61 ms 7416 KB Output is correct
86 Correct 55 ms 7416 KB Output is correct
87 Correct 54 ms 7416 KB Output is correct
88 Correct 57 ms 7416 KB Output is correct
89 Correct 54 ms 7416 KB Output is correct
90 Correct 61 ms 7416 KB Output is correct
91 Correct 57 ms 7440 KB Output is correct
92 Correct 66 ms 7416 KB Output is correct
93 Correct 56 ms 7416 KB Output is correct
94 Correct 63 ms 7416 KB Output is correct
95 Correct 63 ms 7544 KB Output is correct
96 Correct 69 ms 7420 KB Output is correct
97 Correct 54 ms 7416 KB Output is correct
98 Correct 55 ms 7416 KB Output is correct
99 Correct 55 ms 7416 KB Output is correct
100 Correct 61 ms 7440 KB Output is correct
101 Correct 55 ms 7440 KB Output is correct
102 Correct 60 ms 7544 KB Output is correct