oj.uz

Submission #904330

# Submission time Handle Problem Language Result Execution time Memory
904330 2024-01-12T03:53:46 Z aqxa Wiring (IOI17_wiring) C++17
100 / 100
 122 ms 14404 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long

const ll inf = 1e18; 

#include "wiring.h"

struct segtree {
    struct node {
        long long add = 0; 
        long long mv = 0; 
        void apply(int l, int r, long long x) {
            add += x; 
			mv += x; 
        } 
    }; 

    node unite(const node & x, const node & y) const {
        node res; 
        res.mv = min(x.mv, y.mv); 
        return res; 
    }

    inline void push(int x, int l, int r) {
        int y = (l + r) >> 1; 
        int z = x + ((y - l + 1) << 1);
        if (tree[x].add != 0) {
            tree[x + 1].apply(l, y, tree[x].add);
            tree[z].apply(y + 1, r, tree[x].add);
            tree[x].add = 0; 
        }
    }

    inline void pull(int x, int z) {
        tree[x] = unite(tree[x + 1], tree[z]);
    }

    int n; 
    vector<node> tree; 

    void build(int x, int l, int r) {
        if (l == r) {
            return;
        }
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        build(x + 1, l, y);
        build(z, y + 1, r);
        pull(x, z);
    }

    template <typename M>
    void build(int x, int l, int r, const vector<M> &v) {
        if (l == r) {
            tree[x].apply(l, r, v[l]);
            return;
        }
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        build(x + 1, l, y, v);
        build(z, y + 1, r, v);
        pull(x, z);
    }

    node get(int x, int l, int r, int L, int R) {
        if (L <= l && r <= R) {
            return tree[x];
        }
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        push(x, l, r);
        node res{};
        if (R <= y) {
            res = get(x + 1, l, y, L, R);
        } else {
            if (L > y) {
                res = get(z, y + 1, r, L, R);
            } else {
                res = unite(get(x + 1, l, y, L, R), get(z, y + 1, r, L, R));
            }
        }
        pull(x, z);
        return res;
    }

    template <typename... M>
    void modify(int x, int l, int r, int L, int R, const M&... v) {
        if (L <= l && r <= R) {
            tree[x].apply(l, r, v...);
            return;
        }
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        push(x, l, r);
        if (L <= y) {
            modify(x + 1, l, y, L, R, v...);
        }
        if (R > y) {
            modify(z, y + 1, r, L, R, v...);
        }
        pull(x, z);
    }

    int find_first_knowingly(int x, int l, int r, const function<bool(const node&)> &f) {
        if (l == r) {
            return l;
        }
        push(x, l, r);
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        int res;
        if (f(tree[x + 1])) {
            res = find_first_knowingly(x + 1, l, y, f);
        } else {
            res = find_first_knowingly(z, y + 1, r, f);
        }
        pull(x, z);
        return res;
    }

    int find_first(int x, int l, int r, int L, int R, const function<bool(const node&)> &f) {
        if (L <= l && r <= R) {
            if (!f(tree[x])) {
                return -1;
            }
            return find_first_knowingly(x, l, r, f);
        }
        push(x, l, r);
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        int res = -1;
        if (L <= y) {
            res = find_first(x + 1, l, y, L, R, f);
        }
        if (R > y && res == -1) {
            res = find_first(z, y + 1, r, L, R, f);
        }
        pull(x, z);
        return res;
    }

    int find_last_knowingly(int x, int l, int r, const function<bool(const node&)> &f) {
        if (l == r) {
            return l;
        }
        push(x, l, r);
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        int res;
        if (f(tree[z])) {
            res = find_last_knowingly(z, y + 1, r, f);
        } else {
            res = find_last_knowingly(x + 1, l, y, f);
        }
        pull(x, z);
        return res;
    }

    int find_last(int x, int l, int r, int L, int R, const function<bool(const node&)> &f) {
        if (L <= l && r <= R) {
            if (!f(tree[x])) {
                return -1;
            }
            return find_last_knowingly(x, l, r, f);
        }
        push(x, l, r);
        int y = (l + r) >> 1;
        int z = x + ((y - l + 1) << 1);
        int res = -1;
        if (R > y) {
            res = find_last(z, y + 1, r, L, R, f);
        }
        if (L <= y && res == -1) {
            res = find_last(x + 1, l, y, L, R, f);
        }
        pull(x, z);
        return res;
    }

    segtree(int _n) {
        n = _n;
        tree.resize(2 * n - 1);
        build(0, 0, n - 1);
    }

    template <typename M>
    segtree(const vector<M> &v) {
        n = v.size();
        tree.resize(2 * n - 1);
        build(0, 0, n - 1, v);
    }

    node get(int L, int R) {
        assert(0 <= L && L <= R && R <= n - 1);
        return get(0, 0, n - 1, L, R);
    }

    template <typename... M>
    void modify(int L, int R, const M&... v) {
        assert(0 <= L && L <= R && R <= n - 1);
        modify(0, 0, n - 1, L, R, v...);
    }
    // find_first and find_last call all FALSE elements
    // to the left (right) of the sought position exactly once

    int find_first(int L, int R, const function<bool(const node&)> &f) {
        assert(0 <= L && L <= R && R <= n - 1);
        return find_first(0, 0, n - 1, L, R, f);
    }

    int find_last(int L, int R, const function<bool(const node&)> &f) {
        assert(0 <= L && L <= R && R <= n - 1);
        return find_last(0, 0, n - 1, L, R, f);
    }
};

long long min_total_length(std::vector<int> a, std::vector<int> b) {
	vector<array<int, 2>> f; 
	for (auto x: a) f.push_back({x, 0}); 
	for (auto x: b) f.push_back({x, 1}); 
	sort(f.begin(), f.end()); 
	int cc = f[0][1] ^ 1; 
	
	vector<vector<ll>> segs; 
	for (auto [x, v]: f) {
		if (v == cc) {
			segs.back().push_back(x); 
		} else {
			segs.push_back({(ll)x}); 
			cc ^= 1; 
		}
	}	

	vector<ll> dp(segs[0].size() + 1, inf); 
	dp[0] = 0; 

	for (int i = 1; i < segs.size(); ++i) {
		vector<ll> a = segs[i - 1], b = segs[i]; 
		int n = a.size(), m = b.size(); 
		ll A = a.back(), B = b[0]; 
		
		segtree st(n); 

		ll sa = 0, cnt = 0; 
		for (int j = n - 1; j >= 0; --j) {
			dp[j] = min(dp[j], dp[j + 1]); 
			sa += a[j]; 
			cnt++; 
			st.modify(j, j, dp[j] + cnt * B - sa); 
			// st[j] = dp[j] + cnt * B - sa; 
		} 
		
		vector<ll> ans(m + 1, inf); 
		ans[0] = dp[n]; 
		// ans[1] = min on st 
		ans[1] = st.get(0, n - 1).mv; 
		for (int j = 2; j <= m; ++j) {
            // cout << "before " << j << '\n';
            // for (int k = 0; k < n; ++k) cout << st.get(k, k).mv << " \n"[k == n - 1]; 
			if (n - j >= 0) {
                // cout << 0 << ' ' << n - j << ' ' << b[j] - B << '\n';
				st.modify(0, min(n - j, n - 1), b[j - 1] - B); 
			}
			if (n - j < n - 1) {
                // cout << n - j + 1 << ' ' << n - 1 << ' ' << b[j] - A << '\n';
				st.modify(max(n - j + 1, 0), n - 1, b[j - 1] - A); 
			}
			// s.x += b[j] - B for x <= n - j
			// s.x += b[j] - A for x > n - j 

			// ans[j] = min on st 
			ans[j] = min(st.get(0, n - 1).mv, ans[j]); 
            // cout << "!!! " << j << ' ' << ans[j] << '\n';
		}
		dp = ans; 
        // for (auto x: dp) cout << x << ' '; 
        // cout << '\n';
	}

	return dp.back();
}


// int main() {
// 	ios_base::sync_with_stdio(false); 
// 	cin.tie(0); 
	
//     int tt; 
//     cin >> tt; 
//     for (int t = 0; t < tt; ++t) {
//         int n, m;
//         cin >> n >> m; 
//         vector<int> a(n); 
//         for (auto & x: a) cin >> x; 
//         vector<int> b(m); 
//         for (auto & x: b) cin >> x; 
//         sort(a.begin(), a.end()); 
//         sort(b.begin(), b.end()); 
//         cout << "!!! \n" << min_total_length(a, b) << "\n";        
//     }

// 	return 0;
// }

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:239:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  239 |  for (int i = 1; i < segs.size(); ++i) {
      |                  ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 50 ms 9564 KB Output is correct
4 Correct 59 ms 9664 KB Output is correct
5 Correct 42 ms 9156 KB Output is correct
6 Correct 71 ms 12852 KB Output is correct
7 Correct 73 ms 12056 KB Output is correct
8 Correct 72 ms 11972 KB Output is correct
9 Correct 70 ms 12136 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 56 ms 7728 KB Output is correct
4 Correct 58 ms 7616 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 56 ms 7876 KB Output is correct
19 Correct 56 ms 7620 KB Output is correct
20 Correct 57 ms 7552 KB Output is correct
21 Correct 58 ms 8128 KB Output is correct
22 Correct 65 ms 7556 KB Output is correct
23 Correct 56 ms 7476 KB Output is correct
24 Correct 56 ms 7552 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 84 ms 6000 KB Output is correct
3 Correct 54 ms 7876 KB Output is correct
4 Correct 77 ms 7108 KB Output is correct
5 Correct 56 ms 7876 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 101 ms 9512 KB Output is correct
19 Correct 83 ms 6500 KB Output is correct
20 Correct 84 ms 6948 KB Output is correct
21 Correct 98 ms 8208 KB Output is correct
22 Correct 95 ms 12424 KB Output is correct
23 Correct 83 ms 11792 KB Output is correct
24 Correct 89 ms 12060 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 50 ms 9564 KB Output is correct
20 Correct 59 ms 9664 KB Output is correct
21 Correct 42 ms 9156 KB Output is correct
22 Correct 71 ms 12852 KB Output is correct
23 Correct 73 ms 12056 KB Output is correct
24 Correct 72 ms 11972 KB Output is correct
25 Correct 70 ms 12136 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 56 ms 7728 KB Output is correct
29 Correct 58 ms 7616 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 56 ms 7876 KB Output is correct
44 Correct 56 ms 7620 KB Output is correct
45 Correct 57 ms 7552 KB Output is correct
46 Correct 58 ms 8128 KB Output is correct
47 Correct 65 ms 7556 KB Output is correct
48 Correct 56 ms 7476 KB Output is correct
49 Correct 56 ms 7552 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 84 ms 6000 KB Output is correct
52 Correct 54 ms 7876 KB Output is correct
53 Correct 77 ms 7108 KB Output is correct
54 Correct 56 ms 7876 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 600 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 436 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 600 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 360 KB Output is correct
67 Correct 101 ms 9512 KB Output is correct
68 Correct 83 ms 6500 KB Output is correct
69 Correct 84 ms 6948 KB Output is correct
70 Correct 98 ms 8208 KB Output is correct
71 Correct 95 ms 12424 KB Output is correct
72 Correct 83 ms 11792 KB Output is correct
73 Correct 89 ms 12060 KB Output is correct
74 Correct 83 ms 12740 KB Output is correct
75 Correct 80 ms 11084 KB Output is correct
76 Correct 83 ms 10936 KB Output is correct
77 Correct 96 ms 11104 KB Output is correct
78 Correct 90 ms 12764 KB Output is correct
79 Correct 92 ms 10536 KB Output is correct
80 Correct 83 ms 11204 KB Output is correct
81 Correct 70 ms 11988 KB Output is correct
82 Correct 73 ms 12260 KB Output is correct
83 Correct 67 ms 11680 KB Output is correct
84 Correct 64 ms 12472 KB Output is correct
85 Correct 88 ms 10496 KB Output is correct
86 Correct 91 ms 12992 KB Output is correct
87 Correct 85 ms 11508 KB Output is correct
88 Correct 87 ms 10760 KB Output is correct
89 Correct 87 ms 11496 KB Output is correct
90 Correct 103 ms 11336 KB Output is correct
91 Correct 79 ms 12232 KB Output is correct
92 Correct 85 ms 12048 KB Output is correct
93 Correct 100 ms 11712 KB Output is correct
94 Correct 87 ms 12848 KB Output is correct
95 Correct 122 ms 11352 KB Output is correct
96 Correct 81 ms 12200 KB Output is correct
97 Correct 86 ms 14404 KB Output is correct
98 Correct 90 ms 13324 KB Output is correct
99 Correct 93 ms 13288 KB Output is correct
100 Correct 94 ms 11972 KB Output is correct
101 Correct 89 ms 12816 KB Output is correct
102 Correct 89 ms 11204 KB Output is correct