Submission #580691

# Submission time Handle Problem Language Result Execution time Memory
580691 2022-06-21T16:30:49 Z SlavicG Wiring (IOI17_wiring) C++17
100 / 100
54 ms 11028 KB
#include "bits/stdc++.h"
#include "wiring.h"

using namespace std;
using ll = long long;

#define all(a) a.begin(),a.end()
#define pb push_back

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	vector<pair<ll, ll>> a(1, make_pair(INT_MIN, 0));
	map<int, int> mp;
	for(auto x: r) a.push_back(make_pair(x, 1));
	for(auto x: b) a.push_back(make_pair(x, 2));

    int n = a.size();
    sort(all(a));
	vector<ll> dp(n, (ll)1e17);
	dp[0] = 0;

    int j = -1, cnt_prev = 0, cnt_now = 0;

    ll sum_prev = 0, sum_now = 0;

    vector<ll> prefsum_prev, prefsum_cur;
	for(int i = 1; i < n; ++i) {
        int pos = a[i].first, type = a[i].second;
        ll mn = INT_MAX;

        if(type == 1) {
            auto it = upper_bound(all(b), pos);
            if(it != b.end()) {
                mn = min(mn, (ll)abs(*it - pos));
            }
            if(it != b.begin()) {
                --it;
                mn = min(mn, (ll)abs(*it - pos));
            }
        } else {
            auto it = upper_bound(all(r), pos);
            if(it != r.end()) {
                mn = min(mn, (ll)abs(*it - pos));
            }
            if(it != r.begin()) {
                --it;
                mn = min(mn, (ll)abs(*it - pos));
            }
        }
        dp[i] = min(dp[i], dp[i - 1] + mn);

        if(type == a[i - 1].second) {
            ++cnt_now;
            sum_now += pos;
            prefsum_cur.pb(sum_now);
        } else {
            cnt_prev = cnt_now;
            sum_prev = sum_now;
            prefsum_prev = prefsum_cur;

            cnt_now = 1;
            sum_now = pos;
            prefsum_cur = {sum_now};
        }

        if(cnt_prev && cnt_now && cnt_now <= cnt_prev) {
            int idx = i - 2 * cnt_now;
            assert(idx >= 0);
            ll substract = prefsum_prev.back();
            int left = cnt_prev - cnt_now;
            if(left > 0) substract -= prefsum_prev[left - 1];
            dp[i] = min(dp[i], dp[idx] + sum_now - substract);
        }
	}

	return dp[n - 1];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:21:9: warning: unused variable 'j' [-Wunused-variable]
   21 |     int j = -1, cnt_prev = 0, cnt_now = 0;
      |         ^
wiring.cpp:23:8: warning: variable 'sum_prev' set but not used [-Wunused-but-set-variable]
   23 |     ll sum_prev = 0, sum_now = 0;
      |        ^~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 27 ms 8156 KB Output is correct
4 Correct 27 ms 8144 KB Output is correct
5 Correct 27 ms 8208 KB Output is correct
6 Correct 36 ms 10264 KB Output is correct
7 Correct 36 ms 10256 KB Output is correct
8 Correct 34 ms 10296 KB Output is correct
9 Correct 34 ms 10256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 53 ms 8472 KB Output is correct
4 Correct 51 ms 8120 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 54 ms 8476 KB Output is correct
19 Correct 52 ms 8468 KB Output is correct
20 Correct 52 ms 8376 KB Output is correct
21 Correct 53 ms 8368 KB Output is correct
22 Correct 52 ms 8468 KB Output is correct
23 Correct 52 ms 8376 KB Output is correct
24 Correct 52 ms 8472 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 36 ms 6796 KB Output is correct
3 Correct 45 ms 7828 KB Output is correct
4 Correct 37 ms 7864 KB Output is correct
5 Correct 45 ms 7836 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 35 ms 8612 KB Output is correct
19 Correct 40 ms 7812 KB Output is correct
20 Correct 38 ms 7948 KB Output is correct
21 Correct 36 ms 8376 KB Output is correct
22 Correct 37 ms 10124 KB Output is correct
23 Correct 40 ms 9460 KB Output is correct
24 Correct 36 ms 9984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 27 ms 8156 KB Output is correct
20 Correct 27 ms 8144 KB Output is correct
21 Correct 27 ms 8208 KB Output is correct
22 Correct 36 ms 10264 KB Output is correct
23 Correct 36 ms 10256 KB Output is correct
24 Correct 34 ms 10296 KB Output is correct
25 Correct 34 ms 10256 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 300 KB Output is correct
28 Correct 53 ms 8472 KB Output is correct
29 Correct 51 ms 8120 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 300 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 54 ms 8476 KB Output is correct
44 Correct 52 ms 8468 KB Output is correct
45 Correct 52 ms 8376 KB Output is correct
46 Correct 53 ms 8368 KB Output is correct
47 Correct 52 ms 8468 KB Output is correct
48 Correct 52 ms 8376 KB Output is correct
49 Correct 52 ms 8472 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 36 ms 6796 KB Output is correct
52 Correct 45 ms 7828 KB Output is correct
53 Correct 37 ms 7864 KB Output is correct
54 Correct 45 ms 7836 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 296 KB Output is correct
58 Correct 1 ms 300 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 35 ms 8612 KB Output is correct
68 Correct 40 ms 7812 KB Output is correct
69 Correct 38 ms 7948 KB Output is correct
70 Correct 36 ms 8376 KB Output is correct
71 Correct 37 ms 10124 KB Output is correct
72 Correct 40 ms 9460 KB Output is correct
73 Correct 36 ms 9984 KB Output is correct
74 Correct 39 ms 10120 KB Output is correct
75 Correct 39 ms 9372 KB Output is correct
76 Correct 35 ms 10012 KB Output is correct
77 Correct 36 ms 9376 KB Output is correct
78 Correct 37 ms 9488 KB Output is correct
79 Correct 39 ms 9324 KB Output is correct
80 Correct 33 ms 9472 KB Output is correct
81 Correct 39 ms 9660 KB Output is correct
82 Correct 44 ms 9624 KB Output is correct
83 Correct 34 ms 9776 KB Output is correct
84 Correct 38 ms 10268 KB Output is correct
85 Correct 45 ms 9764 KB Output is correct
86 Correct 39 ms 10528 KB Output is correct
87 Correct 43 ms 10012 KB Output is correct
88 Correct 39 ms 9368 KB Output is correct
89 Correct 38 ms 9916 KB Output is correct
90 Correct 44 ms 9748 KB Output is correct
91 Correct 42 ms 10124 KB Output is correct
92 Correct 38 ms 10392 KB Output is correct
93 Correct 40 ms 10048 KB Output is correct
94 Correct 39 ms 10508 KB Output is correct
95 Correct 41 ms 9752 KB Output is correct
96 Correct 39 ms 10140 KB Output is correct
97 Correct 41 ms 11028 KB Output is correct
98 Correct 43 ms 10904 KB Output is correct
99 Correct 47 ms 10892 KB Output is correct
100 Correct 40 ms 10648 KB Output is correct
101 Correct 38 ms 10136 KB Output is correct
102 Correct 38 ms 10012 KB Output is correct