oj.uz

Submission #988926

# Submission time Handle Problem Language Result Execution time Memory
988926 2024-05-27T02:43:13 Z steveonalex Wiring (IOI17_wiring) C++17
100 / 100
 59 ms 18976 KB 
#include <bits/stdc++.h>
#include "wiring.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#define sz(v) ((int)v.size())
 
const int N = 1e5 + 69;
const ll INF = 1e18 + 69;
 
int n, m;

vector<ll> dp[N];
vector<ll> bruh[N];
 
ll min_total_length(vector<int> a, vector<int> b) {
    n = a.size(), m = b.size();
    vector<pair<int, int>> point;
    for(int i: a) point.push_back({i, 0});
    for(int i: b) point.push_back({i, 1});

    sort(ALL(point));   
    vector<vector<int>> component;
    for(int i = 0; i<sz(point); ++i){
        if (i == 0) {
            component.push_back({point[i].first});
        }
        else{
            if (point[i].second != point[i-1].second){
                component.push_back({point[i].first});
            }
            else component.back().push_back(point[i].first);
        }
    }

    int k = component.size();
    for(int i = 0; i<k; ++i){
        dp[i].resize(sz(component[i]) + 1, INF);
    }

    for(int i = 0; i<k; ++i){
        bruh[i].resize(sz(component[i]) + 1, 0);

        ll s = 0;
        for(int j = 0; j < sz(component[i]); ++j){
            s += abs(component[i][j] - component[i][0]);
            bruh[i][j+1] += s;
        }

        s = 0;
        for(int j = component[i].size() - 1; j>=0; --j){
            s += abs(component[i].back() - component[i][j]);
            bruh[i][j] += s;
        }
    }

    for(int j = 1; j < sz(bruh[0]); ++j) bruh[0][j] = INF;
    for(int j = 0; j+1 < sz(bruh[k-1]); ++j) bruh[k-1][j] = INF;
    dp[0][0] = bruh[0][0];


    for(int i = 1; i<k; ++i){
        ll dis = (component[i][0] - component[i-1].back());

        vector<ll> suff_min(sz(dp[i]), INF);
        for(int t = 0; t < sz(dp[i-1]); ++t){
            int r = sz(dp[i-1]) - t - 1;
            ll cost = dp[i-1][t] + dis * r;
            minimize(r, sz(dp[i]) - 1);
            minimize(suff_min[r], cost);
        }

        for(int t = sz(dp[i]) - 2; t >= 0; --t) minimize(suff_min[t], suff_min[t+1]);
        for(int t = 0; t < sz(dp[i]); ++t) minimize(dp[i][t], suff_min[t] + bruh[i][t]);

        suff_min = dp[i-1];
        for(int t = sz(suff_min) - 2; t>= 0; --t) minimize(suff_min[t], suff_min[t+1]);
        for(int t = 0; t < sz(dp[i]); ++t){
            ll cost = bruh[i][t] + dis * t;
            int r = sz(dp[i-1]) - t - 1;
            maximize(r, 0);
            cost += suff_min[r];
            minimize(dp[i][t], cost);
        }
    }

    return dp[k-1].back();
}
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     int n, m; cin >> n >> m;
//     vector<int> a(n), b(m);
//     for(int i = 0 ; i<n; ++i) cin >> a[i];
//     for(int j = 0; j<m; ++j) cin >> b[j];
//     cout << min_total_length(a, b) << "\n";
    
 
//     return 0;
// }

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 20 ms 11736 KB Output is correct
4 Correct 20 ms 11724 KB Output is correct
5 Correct 19 ms 11736 KB Output is correct
6 Correct 35 ms 13692 KB Output is correct
7 Correct 26 ms 14488 KB Output is correct
8 Correct 26 ms 13556 KB Output is correct
9 Correct 26 ms 13728 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 47 ms 16868 KB Output is correct
4 Correct 45 ms 16140 KB Output is correct
5 Correct 2 ms 4960 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5020 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4960 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 1 ms 4960 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 59 ms 18948 KB Output is correct
19 Correct 46 ms 18884 KB Output is correct
20 Correct 45 ms 16680 KB Output is correct
21 Correct 47 ms 18976 KB Output is correct
22 Correct 50 ms 18116 KB Output is correct
23 Correct 48 ms 18184 KB Output is correct
24 Correct 45 ms 18116 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 29 ms 12492 KB Output is correct
3 Correct 38 ms 13760 KB Output is correct
4 Correct 33 ms 13756 KB Output is correct
5 Correct 38 ms 15048 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 5112 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 30 ms 14272 KB Output is correct
19 Correct 32 ms 13512 KB Output is correct
20 Correct 30 ms 13564 KB Output is correct
21 Correct 30 ms 13772 KB Output is correct
22 Correct 31 ms 14788 KB Output is correct
23 Correct 26 ms 14536 KB Output is correct
24 Correct 27 ms 14460 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 5032 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4996 KB Output is correct
8 Correct 2 ms 4952 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 20 ms 11736 KB Output is correct
20 Correct 20 ms 11724 KB Output is correct
21 Correct 19 ms 11736 KB Output is correct
22 Correct 35 ms 13692 KB Output is correct
23 Correct 26 ms 14488 KB Output is correct
24 Correct 26 ms 13556 KB Output is correct
25 Correct 26 ms 13728 KB Output is correct
26 Correct 2 ms 4952 KB Output is correct
27 Correct 2 ms 4952 KB Output is correct
28 Correct 47 ms 16868 KB Output is correct
29 Correct 45 ms 16140 KB Output is correct
30 Correct 2 ms 4960 KB Output is correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 2 ms 5020 KB Output is correct
33 Correct 2 ms 4956 KB Output is correct
34 Correct 2 ms 4960 KB Output is correct
35 Correct 2 ms 4956 KB Output is correct
36 Correct 1 ms 4960 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 2 ms 4956 KB Output is correct
39 Correct 2 ms 4956 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 2 ms 4952 KB Output is correct
43 Correct 59 ms 18948 KB Output is correct
44 Correct 46 ms 18884 KB Output is correct
45 Correct 45 ms 16680 KB Output is correct
46 Correct 47 ms 18976 KB Output is correct
47 Correct 50 ms 18116 KB Output is correct
48 Correct 48 ms 18184 KB Output is correct
49 Correct 45 ms 18116 KB Output is correct
50 Correct 2 ms 4956 KB Output is correct
51 Correct 29 ms 12492 KB Output is correct
52 Correct 38 ms 13760 KB Output is correct
53 Correct 33 ms 13756 KB Output is correct
54 Correct 38 ms 15048 KB Output is correct
55 Correct 2 ms 4956 KB Output is correct
56 Correct 2 ms 4956 KB Output is correct
57 Correct 2 ms 5112 KB Output is correct
58 Correct 2 ms 4956 KB Output is correct
59 Correct 1 ms 4956 KB Output is correct
60 Correct 2 ms 4956 KB Output is correct
61 Correct 1 ms 4956 KB Output is correct
62 Correct 2 ms 4956 KB Output is correct
63 Correct 2 ms 4956 KB Output is correct
64 Correct 2 ms 4956 KB Output is correct
65 Correct 2 ms 4956 KB Output is correct
66 Correct 1 ms 4956 KB Output is correct
67 Correct 30 ms 14272 KB Output is correct
68 Correct 32 ms 13512 KB Output is correct
69 Correct 30 ms 13564 KB Output is correct
70 Correct 30 ms 13772 KB Output is correct
71 Correct 31 ms 14788 KB Output is correct
72 Correct 26 ms 14536 KB Output is correct
73 Correct 27 ms 14460 KB Output is correct
74 Correct 27 ms 15296 KB Output is correct
75 Correct 33 ms 14276 KB Output is correct
76 Correct 34 ms 14952 KB Output is correct
77 Correct 36 ms 14464 KB Output is correct
78 Correct 29 ms 14280 KB Output is correct
79 Correct 31 ms 14540 KB Output is correct
80 Correct 39 ms 14372 KB Output is correct
81 Correct 39 ms 14528 KB Output is correct
82 Correct 25 ms 14796 KB Output is correct
83 Correct 26 ms 14784 KB Output is correct
84 Correct 26 ms 15304 KB Output is correct
85 Correct 38 ms 14996 KB Output is correct
86 Correct 29 ms 15136 KB Output is correct
87 Correct 30 ms 15300 KB Output is correct
88 Correct 34 ms 15044 KB Output is correct
89 Correct 30 ms 14792 KB Output is correct
90 Correct 35 ms 15296 KB Output is correct
91 Correct 28 ms 15304 KB Output is correct
92 Correct 42 ms 15040 KB Output is correct
93 Correct 28 ms 15108 KB Output is correct
94 Correct 30 ms 14788 KB Output is correct
95 Correct 33 ms 14992 KB Output is correct
96 Correct 28 ms 15464 KB Output is correct
97 Correct 31 ms 15040 KB Output is correct
98 Correct 30 ms 15364 KB Output is correct
99 Correct 37 ms 15208 KB Output is correct
100 Correct 43 ms 14728 KB Output is correct
101 Correct 30 ms 15296 KB Output is correct
102 Correct 34 ms 15052 KB Output is correct