답안 #40229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40229 2018-01-30T08:10:58 Z jackyliuxx 전선 연결 (IOI17_wiring) C++14
100 / 100
101 ms 17148 KB
//#define DEBUG

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

#define INF 9000000000000000000L
#define RED true
#define BLUE false

typedef long long LL;

struct P {
    bool color;
    LL pos;
};

bool cmp(P a, P b) {
    return a.pos < b.pos;
}

vector<P> arr;
vector<int> head;
vector<LL> lsum, lcnt;
vector<int> tail;
vector<LL> rsum, rcnt;
vector<LL> dp;

LL dpv(int x) {
    if (x < 0) {
        return 0;
    } else {
        return dp[x];
    }
}

LL calc(int l, int r) {
#ifdef DEBUG
    cout << "calc " << l << ' ' << r << endl;
    cout << "rsum l: " << rsum[l] << endl;
    cout << "lsum r: " << lsum[r] << endl;
    cout << "rcnt l: " << rcnt[l] << endl;
    cout << "lcnt r: " << rcnt[r] << endl;
    cout << "tail l: " << tail[l] << endl;
    cout << "head r: " << head[r] << endl;
#endif
    LL ret = min(dpv(l), dpv(l - 1)) + rsum[l] + lsum[r] + max(rcnt[l], lcnt[r]) * (arr[head[r]].pos - arr[tail[l]].pos);
#ifdef DEBUG
    cout << "ret: " << ret << endl;
#endif
    return ret;
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    for (size_t i = 0; i < r.size(); i++) {
        arr.push_back({RED, r[i]});
    }
    for (size_t i = 0; i < b.size(); i++) {
        arr.push_back({BLUE, b[i]});
    }
    int n = arr.size();

    head.assign(n, 0);
    lsum.assign(n, 0);
    lcnt.assign(n, 1);
    tail.assign(n, 0);
    rsum.assign(n, 0);
    rcnt.assign(n, 1);
    dp.assign(n, INF);

    sort(arr.begin(), arr.end(), cmp);

    head[0] = 0;
    for (int i = 1; i < n; i++) {
        if (arr[i].color != arr[i - 1].color) {
            head[i] = i;
            lsum[i] = 0;
            lcnt[i] = 1;
        } else {
            head[i] = head[i - 1];
            lsum[i] = lsum[i - 1] + (arr[i].pos - arr[head[i]].pos);
            lcnt[i] = lcnt[i - 1] + 1;
        }
    }

    tail[n - 1] = n - 1;
    for (int i = n - 2; i >= 0; i--) {
        if (arr[i].color != arr[i + 1].color) {
            tail[i] = i;
            rsum[i] = 0;
            rcnt[i] = 1;
        } else {
            tail[i] = tail[i + 1];
            rsum[i] = rsum[i + 1] + (arr[tail[i]].pos - arr[i].pos);
            rcnt[i] = rcnt[i + 1] + 1;
        }
    }
    int prehead = -1;
    int prepos = -1;
    for (int i = 1; i < n; i++) {
        if (arr[i].color != arr[i - 1].color) {
            prehead = head[i - 1];
            for (int j = i - 1; j >= prehead; j--) {
                if (calc(j, i) <= dp[i]) {
                    dp[i] = calc(j, i);
                    prepos = j;
                }
            }
        } else if (head[i] > 0) {
            dp[i] = calc(prepos, i);
            if (prepos > prehead && calc(prepos - 1, i) <= dp[i]) {
                dp[i] = calc(prepos - 1, i);
                prepos--;
            }
        }
#ifdef DEBUG
        cout << i << " pos: " << arr[i].pos << " dp: " << dp[i] << " spos:" << prepos << endl;
#endif
    }
    return dp[n - 1];
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 48 ms 14412 KB Output is correct
4 Correct 47 ms 14412 KB Output is correct
5 Correct 47 ms 14408 KB Output is correct
6 Correct 63 ms 17144 KB Output is correct
7 Correct 77 ms 17144 KB Output is correct
8 Correct 63 ms 17148 KB Output is correct
9 Correct 60 ms 17148 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 88 ms 17144 KB Output is correct
4 Correct 89 ms 17148 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 84 ms 17128 KB Output is correct
19 Correct 91 ms 17124 KB Output is correct
20 Correct 76 ms 17148 KB Output is correct
21 Correct 81 ms 17120 KB Output is correct
22 Correct 72 ms 17132 KB Output is correct
23 Correct 82 ms 17132 KB Output is correct
24 Correct 74 ms 17140 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 73 ms 17148 KB Output is correct
3 Correct 70 ms 17148 KB Output is correct
4 Correct 83 ms 17148 KB Output is correct
5 Correct 70 ms 17148 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 62 ms 17148 KB Output is correct
19 Correct 73 ms 17148 KB Output is correct
20 Correct 79 ms 17148 KB Output is correct
21 Correct 59 ms 17148 KB Output is correct
22 Correct 75 ms 17148 KB Output is correct
23 Correct 45 ms 17148 KB Output is correct
24 Correct 59 ms 17148 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 0 ms 2028 KB Output is correct
19 Correct 48 ms 14412 KB Output is correct
20 Correct 47 ms 14412 KB Output is correct
21 Correct 47 ms 14408 KB Output is correct
22 Correct 63 ms 17144 KB Output is correct
23 Correct 77 ms 17144 KB Output is correct
24 Correct 63 ms 17148 KB Output is correct
25 Correct 60 ms 17148 KB Output is correct
26 Correct 0 ms 2028 KB Output is correct
27 Correct 0 ms 2028 KB Output is correct
28 Correct 88 ms 17144 KB Output is correct
29 Correct 89 ms 17148 KB Output is correct
30 Correct 0 ms 2028 KB Output is correct
31 Correct 0 ms 2028 KB Output is correct
32 Correct 0 ms 2028 KB Output is correct
33 Correct 0 ms 2028 KB Output is correct
34 Correct 0 ms 2028 KB Output is correct
35 Correct 0 ms 2028 KB Output is correct
36 Correct 0 ms 2028 KB Output is correct
37 Correct 0 ms 2028 KB Output is correct
38 Correct 0 ms 2028 KB Output is correct
39 Correct 0 ms 2028 KB Output is correct
40 Correct 0 ms 2028 KB Output is correct
41 Correct 0 ms 2028 KB Output is correct
42 Correct 0 ms 2028 KB Output is correct
43 Correct 84 ms 17128 KB Output is correct
44 Correct 91 ms 17124 KB Output is correct
45 Correct 76 ms 17148 KB Output is correct
46 Correct 81 ms 17120 KB Output is correct
47 Correct 72 ms 17132 KB Output is correct
48 Correct 82 ms 17132 KB Output is correct
49 Correct 74 ms 17140 KB Output is correct
50 Correct 0 ms 2028 KB Output is correct
51 Correct 73 ms 17148 KB Output is correct
52 Correct 70 ms 17148 KB Output is correct
53 Correct 83 ms 17148 KB Output is correct
54 Correct 70 ms 17148 KB Output is correct
55 Correct 0 ms 2028 KB Output is correct
56 Correct 0 ms 2028 KB Output is correct
57 Correct 0 ms 2028 KB Output is correct
58 Correct 0 ms 2028 KB Output is correct
59 Correct 0 ms 2028 KB Output is correct
60 Correct 0 ms 2028 KB Output is correct
61 Correct 0 ms 2028 KB Output is correct
62 Correct 0 ms 2028 KB Output is correct
63 Correct 0 ms 2028 KB Output is correct
64 Correct 0 ms 2028 KB Output is correct
65 Correct 0 ms 2028 KB Output is correct
66 Correct 0 ms 2028 KB Output is correct
67 Correct 62 ms 17148 KB Output is correct
68 Correct 73 ms 17148 KB Output is correct
69 Correct 79 ms 17148 KB Output is correct
70 Correct 59 ms 17148 KB Output is correct
71 Correct 75 ms 17148 KB Output is correct
72 Correct 45 ms 17148 KB Output is correct
73 Correct 59 ms 17148 KB Output is correct
74 Correct 65 ms 17148 KB Output is correct
75 Correct 78 ms 17148 KB Output is correct
76 Correct 66 ms 17148 KB Output is correct
77 Correct 89 ms 17148 KB Output is correct
78 Correct 75 ms 17148 KB Output is correct
79 Correct 71 ms 17148 KB Output is correct
80 Correct 92 ms 17148 KB Output is correct
81 Correct 65 ms 17148 KB Output is correct
82 Correct 53 ms 17148 KB Output is correct
83 Correct 59 ms 17148 KB Output is correct
84 Correct 66 ms 17148 KB Output is correct
85 Correct 79 ms 17148 KB Output is correct
86 Correct 58 ms 17148 KB Output is correct
87 Correct 73 ms 17148 KB Output is correct
88 Correct 74 ms 17148 KB Output is correct
89 Correct 101 ms 17148 KB Output is correct
90 Correct 81 ms 17148 KB Output is correct
91 Correct 55 ms 17148 KB Output is correct
92 Correct 61 ms 17148 KB Output is correct
93 Correct 71 ms 17148 KB Output is correct
94 Correct 58 ms 17148 KB Output is correct
95 Correct 88 ms 17148 KB Output is correct
96 Correct 58 ms 17148 KB Output is correct
97 Correct 66 ms 17148 KB Output is correct
98 Correct 69 ms 17148 KB Output is correct
99 Correct 60 ms 17148 KB Output is correct
100 Correct 75 ms 17148 KB Output is correct
101 Correct 91 ms 17148 KB Output is correct
102 Correct 72 ms 17148 KB Output is correct