oj.uz

Submission #68796

# Submission time Handle Problem Language Result Execution time Memory
68796 2018-08-18T12:30:19 Z evpipis Wiring (IOI17_wiring) C++11
100 / 100
 171 ms 48908 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

//#define TEST

#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;

const int len = 2e5+5;
const ll inf = 1e17;
vector<ii> arr;
vector<ll> dp[len], pref[len], suf[len], vec[len], best[2][len];
int sz[len];
ll mx[len], mn[len];

ll min_total_length(vector<int> red, vector<int> blue) {
    for (int i = 0; i < red.size(); i++)
        arr.pb(mp(red[i], 0));
    for (int i = 0; i < blue.size(); i++)
        arr.pb(mp(blue[i], 1));
    sort(arr.begin(), arr.end());

    int n = arr.size(), m = -1;
    for (int i = 0; i < n; i++){
        if (i == 0 || arr[i].se != arr[i-1].se)
            m++;
        vec[m].pb(arr[i].fi);
    }

    for (int i = 0; i <= m; i++){
        sz[i] = vec[i].size();
        pref[i].resize(sz[i]);
        suf[i].resize(sz[i]);
        dp[i].resize(sz[i]+1);
        best[0][i].resize(sz[i]+1);
        best[1][i].resize(sz[i]+1);

        pref[i][0] = vec[i][0];
        for (int j = 1; j < sz[i]; j++)
            pref[i][j] = pref[i][j-1] + vec[i][j];

        suf[i][sz[i]-1] = vec[i][sz[i]-1];
        for (int j = sz[i]-2; j >= 0; j--)
            suf[i][j] = suf[i][j+1] + vec[i][j];

        mn[i] = vec[i][0];
        mx[i] = vec[i][sz[i]-1];
    }

    /*for (int i = 0; i <= m; i++){
        printf("bucket %d:\n", i);
        for (int j = 0; j < sz[i]; j++)
            printf("%d ", vec[i][j]);
        printf("\n");
    }*/

    for (int j = 0; j <= sz[0]; j++)
        dp[0][j] = inf;
    dp[0][sz[0]] = 0;

    best[0][0][0] = inf;
    for (int k = 1; k <= sz[0]; k++)
        best[0][0][k] = min(best[0][0][k-1], k*mx[0]-suf[0][sz[0]-k]+dp[0][k]);

    best[1][0][sz[0]] = sz[0]*mn[0+1]-suf[0][0]+dp[0][sz[0]];
    for (int k = sz[0]-1; k >= 1; k--)
        best[1][0][k] = min(best[1][0][k+1], k*mn[0+1]-suf[0][sz[0]-k]+dp[0][k]);

    for (int i = 1; i <= m; i++){
        for (int j = 0; j < sz[i]; j++){
            int x = sz[i]-j;
            /*ll ans = inf, cur = pref[i][x-1] - x*mx[i-1];
            for (int k = 1; k <= min(x, sz[i-1]); k++)
                ans = min(ans, cur + k*mx[i-1]-suf[i-1][sz[i-1]-k]+dp[i-1][k]);

            cur = pref[i][x-1] - x*mn[i];
            for (int k = x; k <= sz[i-1]; k++)
                ans = min(ans, cur + k*mn[i]-suf[i-1][sz[i-1]-k]+dp[i-1][k]);
            */
            dp[i][j] = inf;

            ll cur = pref[i][x-1] - x*mx[i-1];
            dp[i][j] = min(dp[i][j], cur + best[0][i-1][min(x, sz[i-1])]);

            cur = pref[i][x-1] - x*mn[i];
            if (x <= sz[i-1])
                dp[i][j] = min(dp[i][j], cur + best[1][i-1][x]);
            //dp[i][j] = ans;
        }
        dp[i][sz[i]] = min(dp[i-1][0], dp[i][sz[i]-1]);

        best[0][i][0] = inf;
        for (int k = 1; k <= sz[i]; k++)
            best[0][i][k] = min(best[0][i][k-1], k*mx[i]-suf[i][sz[i]-k]+dp[i][k]);

        best[1][i][sz[i]] = sz[i]*mn[i+1]-suf[i][0]+dp[i][sz[i]];
        for (int k = sz[i]-1; k >= 1; k--)
            best[1][i][k] = min(best[1][i][k+1], k*mn[i+1]-suf[i][sz[i]-k]+dp[i][k]);
    }

    //for (int i = 0; i <= m; i++)
      //  for (int j = 0; j <= sz[i]; j++)
        //    printf("(%d, %d) = %lld\n", i, j, dp[i][j]);

    return dp[m][0];
}

#ifdef TEST
int main() {
    //freopen("01.in", "r", stdin);
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> r(n), b(m);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));
	for(int i = 0; i < m; i++)
		assert(1 == scanf("%d", &b[i]));

	long long res = min_total_length(r, b);
	printf("%lld\n", res);

	return 0;
}
#endif

/*
4 3
0 2 4 6
1 3 5
*/

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < red.size(); i++)
                     ~~^~~~~~~~~~~~
wiring.cpp:24:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < blue.size(); i++)
                     ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28536 KB Output is correct
2 Correct 28 ms 28648 KB Output is correct
3 Correct 27 ms 28648 KB Output is correct
4 Correct 27 ms 28648 KB Output is correct
5 Correct 26 ms 28692 KB Output is correct
6 Correct 25 ms 28696 KB Output is correct
7 Correct 25 ms 28696 KB Output is correct
8 Correct 29 ms 28700 KB Output is correct
9 Correct 25 ms 28724 KB Output is correct
10 Correct 27 ms 28852 KB Output is correct
11 Correct 25 ms 28868 KB Output is correct
12 Correct 27 ms 28868 KB Output is correct
13 Correct 30 ms 28868 KB Output is correct
14 Correct 27 ms 28868 KB Output is correct
15 Correct 33 ms 28868 KB Output is correct
16 Correct 26 ms 28868 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 28868 KB Output is correct
2 Correct 24 ms 28868 KB Output is correct
3 Correct 67 ms 38368 KB Output is correct
4 Correct 80 ms 38368 KB Output is correct
5 Correct 80 ms 38368 KB Output is correct
6 Correct 79 ms 41564 KB Output is correct
7 Correct 94 ms 41564 KB Output is correct
8 Correct 92 ms 41696 KB Output is correct
9 Correct 104 ms 41696 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 41696 KB Output is correct
2 Correct 37 ms 41696 KB Output is correct
3 Correct 147 ms 48844 KB Output is correct
4 Correct 140 ms 48844 KB Output is correct
5 Correct 27 ms 48844 KB Output is correct
6 Correct 28 ms 48844 KB Output is correct
7 Correct 31 ms 48844 KB Output is correct
8 Correct 28 ms 48844 KB Output is correct
9 Correct 29 ms 48844 KB Output is correct
10 Correct 28 ms 48844 KB Output is correct
11 Correct 27 ms 48844 KB Output is correct
12 Correct 28 ms 48844 KB Output is correct
13 Correct 27 ms 48844 KB Output is correct
14 Correct 28 ms 48844 KB Output is correct
15 Correct 31 ms 48844 KB Output is correct
16 Correct 27 ms 48844 KB Output is correct
17 Correct 28 ms 48844 KB Output is correct
18 Correct 137 ms 48908 KB Output is correct
19 Correct 162 ms 48908 KB Output is correct
20 Correct 147 ms 48908 KB Output is correct
21 Correct 166 ms 48908 KB Output is correct
22 Correct 171 ms 48908 KB Output is correct
23 Correct 134 ms 48908 KB Output is correct
24 Correct 138 ms 48908 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 48908 KB Output is correct
2 Correct 86 ms 48908 KB Output is correct
3 Correct 138 ms 48908 KB Output is correct
4 Correct 95 ms 48908 KB Output is correct
5 Correct 125 ms 48908 KB Output is correct
6 Correct 30 ms 48908 KB Output is correct
7 Correct 32 ms 48908 KB Output is correct
8 Correct 28 ms 48908 KB Output is correct
9 Correct 28 ms 48908 KB Output is correct
10 Correct 26 ms 48908 KB Output is correct
11 Correct 26 ms 48908 KB Output is correct
12 Correct 27 ms 48908 KB Output is correct
13 Correct 27 ms 48908 KB Output is correct
14 Correct 29 ms 48908 KB Output is correct
15 Correct 25 ms 48908 KB Output is correct
16 Correct 31 ms 48908 KB Output is correct
17 Correct 28 ms 48908 KB Output is correct
18 Correct 82 ms 48908 KB Output is correct
19 Correct 103 ms 48908 KB Output is correct
20 Correct 91 ms 48908 KB Output is correct
21 Correct 105 ms 48908 KB Output is correct
22 Correct 93 ms 48908 KB Output is correct
23 Correct 72 ms 48908 KB Output is correct
24 Correct 88 ms 48908 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28536 KB Output is correct
2 Correct 28 ms 28648 KB Output is correct
3 Correct 27 ms 28648 KB Output is correct
4 Correct 27 ms 28648 KB Output is correct
5 Correct 26 ms 28692 KB Output is correct
6 Correct 25 ms 28696 KB Output is correct
7 Correct 25 ms 28696 KB Output is correct
8 Correct 29 ms 28700 KB Output is correct
9 Correct 25 ms 28724 KB Output is correct
10 Correct 27 ms 28852 KB Output is correct
11 Correct 25 ms 28868 KB Output is correct
12 Correct 27 ms 28868 KB Output is correct
13 Correct 30 ms 28868 KB Output is correct
14 Correct 27 ms 28868 KB Output is correct
15 Correct 33 ms 28868 KB Output is correct
16 Correct 26 ms 28868 KB Output is correct
17 Correct 26 ms 28868 KB Output is correct
18 Correct 24 ms 28868 KB Output is correct
19 Correct 67 ms 38368 KB Output is correct
20 Correct 80 ms 38368 KB Output is correct
21 Correct 80 ms 38368 KB Output is correct
22 Correct 79 ms 41564 KB Output is correct
23 Correct 94 ms 41564 KB Output is correct
24 Correct 92 ms 41696 KB Output is correct
25 Correct 104 ms 41696 KB Output is correct
26 Correct 31 ms 41696 KB Output is correct
27 Correct 37 ms 41696 KB Output is correct
28 Correct 147 ms 48844 KB Output is correct
29 Correct 140 ms 48844 KB Output is correct
30 Correct 27 ms 48844 KB Output is correct
31 Correct 28 ms 48844 KB Output is correct
32 Correct 31 ms 48844 KB Output is correct
33 Correct 28 ms 48844 KB Output is correct
34 Correct 29 ms 48844 KB Output is correct
35 Correct 28 ms 48844 KB Output is correct
36 Correct 27 ms 48844 KB Output is correct
37 Correct 28 ms 48844 KB Output is correct
38 Correct 27 ms 48844 KB Output is correct
39 Correct 28 ms 48844 KB Output is correct
40 Correct 31 ms 48844 KB Output is correct
41 Correct 27 ms 48844 KB Output is correct
42 Correct 28 ms 48844 KB Output is correct
43 Correct 137 ms 48908 KB Output is correct
44 Correct 162 ms 48908 KB Output is correct
45 Correct 147 ms 48908 KB Output is correct
46 Correct 166 ms 48908 KB Output is correct
47 Correct 171 ms 48908 KB Output is correct
48 Correct 134 ms 48908 KB Output is correct
49 Correct 138 ms 48908 KB Output is correct
50 Correct 25 ms 48908 KB Output is correct
51 Correct 86 ms 48908 KB Output is correct
52 Correct 138 ms 48908 KB Output is correct
53 Correct 95 ms 48908 KB Output is correct
54 Correct 125 ms 48908 KB Output is correct
55 Correct 30 ms 48908 KB Output is correct
56 Correct 32 ms 48908 KB Output is correct
57 Correct 28 ms 48908 KB Output is correct
58 Correct 28 ms 48908 KB Output is correct
59 Correct 26 ms 48908 KB Output is correct
60 Correct 26 ms 48908 KB Output is correct
61 Correct 27 ms 48908 KB Output is correct
62 Correct 27 ms 48908 KB Output is correct
63 Correct 29 ms 48908 KB Output is correct
64 Correct 25 ms 48908 KB Output is correct
65 Correct 31 ms 48908 KB Output is correct
66 Correct 28 ms 48908 KB Output is correct
67 Correct 82 ms 48908 KB Output is correct
68 Correct 103 ms 48908 KB Output is correct
69 Correct 91 ms 48908 KB Output is correct
70 Correct 105 ms 48908 KB Output is correct
71 Correct 93 ms 48908 KB Output is correct
72 Correct 72 ms 48908 KB Output is correct
73 Correct 88 ms 48908 KB Output is correct
74 Correct 97 ms 48908 KB Output is correct
75 Correct 103 ms 48908 KB Output is correct
76 Correct 111 ms 48908 KB Output is correct
77 Correct 100 ms 48908 KB Output is correct
78 Correct 120 ms 48908 KB Output is correct
79 Correct 86 ms 48908 KB Output is correct
80 Correct 80 ms 48908 KB Output is correct
81 Correct 98 ms 48908 KB Output is correct
82 Correct 85 ms 48908 KB Output is correct
83 Correct 92 ms 48908 KB Output is correct
84 Correct 84 ms 48908 KB Output is correct
85 Correct 100 ms 48908 KB Output is correct
86 Correct 82 ms 48908 KB Output is correct
87 Correct 82 ms 48908 KB Output is correct
88 Correct 84 ms 48908 KB Output is correct
89 Correct 85 ms 48908 KB Output is correct
90 Correct 91 ms 48908 KB Output is correct
91 Correct 84 ms 48908 KB Output is correct
92 Correct 90 ms 48908 KB Output is correct
93 Correct 86 ms 48908 KB Output is correct
94 Correct 91 ms 48908 KB Output is correct
95 Correct 93 ms 48908 KB Output is correct
96 Correct 80 ms 48908 KB Output is correct
97 Correct 81 ms 48908 KB Output is correct
98 Correct 84 ms 48908 KB Output is correct
99 Correct 88 ms 48908 KB Output is correct
100 Correct 91 ms 48908 KB Output is correct
101 Correct 95 ms 48908 KB Output is correct
102 Correct 96 ms 48908 KB Output is correct