oj.uz

Submission #978691

# Submission time Handle Problem Language Result Execution time Memory
978691 2024-05-09T14:03:54 Z GrindMachine Wiring (IOI17_wiring) C++17
100 / 100
 130 ms 13240 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

slope trick solution
knew the solution idea beforehand

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "wiring.h"

struct SlopeTrick{
    ll l,r,dir;
    ll first_pos,first_val;
    priority_queue<ll,vector<ll>,greater<ll>> pq;

    SlopeTrick(ll l_, ll r_, ll dir_){
        l = l_, r = r_, dir = dir_;
        if(dir == 1) first_pos = l;
        else first_pos = r;
        first_val = inf2;
    }

    void min_conv(vector<pair<ll,ll>> v){
        if(l == r){
            for(auto [x,y] : v){
                if(x == 0){
                    first_val += y;
                }
            }

            return;
        }

        if(first_val >= inf2) return;

        if(dir == 1){
            pq.push(v[1].ss-v[0].ss);
            first_val += v[0].ss;
            first_pos += v[0].ff;

            while(first_pos < l){
                first_val += pq.top();
                pq.pop();
                first_pos++;
            }
        }
        else{
            pq.push(v[0].ss-v[1].ss);
            first_val += v[1].ss;
            first_pos += v[1].ff;

            while(first_pos > r){
                first_val += pq.top();
                pq.pop();
                first_pos--;
            }
        }
    }

    void upd(ll x){
        if(x > first_val) return;
        ll sub = first_val-x;
        first_val = x;
        if(!pq.empty()){
            ll mn = pq.top();
            pq.pop();
            pq.push(mn+sub);
        }
    }
};

long long min_total_length(std::vector<int> a, std::vector<int> b) {
    ll n = sz(a), m = sz(b);
    sort(all(a)), sort(all(b));

    vector<array<ll,3>> c;
    
    rep(i,n){
        ll x = a[i];
        auto it = lower_bound(all(b),x);
        ll bef = -inf2, aft = inf2;
        if(it != b.end()) aft = *it;
        if(it != b.begin()) bef = *prev(it);
        ll mn_dis = min(abs(x-bef),abs(x-aft));
        c.pb({x,mn_dis,1});         
    }

    rep(i,m){
        ll x = b[i];
        auto it = lower_bound(all(a),x);
        ll bef = -inf2, aft = inf2;
        if(it != a.end()) aft = *it;
        if(it != a.begin()) bef = *prev(it);
        ll mn_dis = min(abs(x-bef),abs(x-aft));
        c.pb({x,mn_dis,2});
    }
    
    sort(all(c));

    SlopeTrick small(-inf1,-1,-1), med(0,0,1), big(1,inf1,1);
    med.upd(0);

    for(auto [x,y,t] : c){
        if(t == 1){
            // red
            // small: min conv with (0,y),(1,x)
            // med:   min conv with (0,y),(1,-x)
            // big:   min conv with (0,y),(1,-x)

            ll small_to_med = small.first_val+x;
            ll med_to_big = med.first_val-x;

            small.min_conv({{0,y},{1,x}});
            med.min_conv({{0,y},{1,-x}});
            big.min_conv({{0,y},{1,-x}});

            med.upd(small_to_med);
            big.upd(med_to_big);
        }
        else{
            // blue
            // small: min conv with (-1,-x),(0,y)
            // med:   min conv with (-1,-x),(0,y)
            // big:   min conv with (-1,x),(0,y)

            ll big_to_med = big.first_val+x;
            ll med_to_small = med.first_val-x;

            small.min_conv({{-1,-x},{0,y}});
            med.min_conv({{-1,-x},{0,y}});
            big.min_conv({{-1,x},{0,y}});

            med.upd(big_to_med);
            small.upd(med_to_small);
        }

        // vector<ll> v;
        // auto curr = big.pq;
        // while(!curr.empty()){
        //     v.pb(curr.top());
        //     curr.pop();
        // }
        // debug(big.first_val);
        // debug(v);

        // debug(small.first_val);
        // debug(med.first_val);
        // debug(big.first_val);
        // cout << endl;
    }

    ll ans = med.first_val;
    ll oans = -1;

    // {
    //     ll siz = sz(c);
    //     c.insert(c.begin(),{0,0});
     
    //     vector<ll> p(siz+5), pref(siz+5);
    //     rep1(i,siz){
    //         p[i] = p[i-1], pref[i] = pref[i-1];
    //         if(c[i][2] == 1) p[i]++, pref[i] += c[i][0];
    //         else p[i]--, pref[i] -= c[i][0];
    //     }
     
    //     vector<ll> dp(siz+5,inf2);
    //     vector<ll> prev_occ(2*siz+5,-1);
    //     dp[0] = 0;
    //     prev_occ[siz] = 0;
     
    //     rep1(i,siz){
    //         dp[i] = dp[i-1]+c[i][1];
    //         if(prev_occ[p[i]+siz] != -1){
    //             ll j = prev_occ[p[i]+siz];
    //             ll diff = pref[i]-pref[j];
    //             amin(dp[i],dp[j]+abs(diff));
    //         }
     
    //         prev_occ[p[i]+siz] = i;
    //     }

    //     oans = dp[siz];
    // }

    // debug(ans,oans);
    // assert(ans == oans);

    return ans;
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:205:8: warning: unused variable 'oans' [-Wunused-variable]
  205 |     ll oans = -1;
      |        ^~~~

Subtask #1
7.0 / 7.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 0 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 0 ms 348 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 436 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 64 ms 11080 KB Output is correct
4 Correct 41 ms 10076 KB Output is correct
5 Correct 60 ms 9996 KB Output is correct
6 Correct 60 ms 12240 KB Output is correct
7 Correct 59 ms 11816 KB Output is correct
8 Correct 59 ms 11212 KB Output is correct
9 Correct 58 ms 11208 KB Output is correct

Subtask #3
10.0 / 10.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 120 ms 11676 KB Output is correct
4 Correct 102 ms 11804 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 748 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 96 ms 11976 KB Output is correct
19 Correct 97 ms 12448 KB Output is correct
20 Correct 96 ms 11808 KB Output is correct
21 Correct 94 ms 11284 KB Output is correct
22 Correct 96 ms 11992 KB Output is correct
23 Correct 93 ms 11556 KB Output is correct
24 Correct 130 ms 12448 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 75 ms 11212 KB Output is correct
3 Correct 95 ms 10956 KB Output is correct
4 Correct 79 ms 10904 KB Output is correct
5 Correct 112 ms 11612 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 73 ms 11032 KB Output is correct
19 Correct 80 ms 10956 KB Output is correct
20 Correct 80 ms 11304 KB Output is correct
21 Correct 73 ms 11052 KB Output is correct
22 Correct 76 ms 12404 KB Output is correct
23 Correct 62 ms 11700 KB Output is correct
24 Correct 67 ms 12216 KB Output is correct

Subtask #5
45.0 / 45.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 0 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 0 ms 348 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 436 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 64 ms 11080 KB Output is correct
20 Correct 41 ms 10076 KB Output is correct
21 Correct 60 ms 9996 KB Output is correct
22 Correct 60 ms 12240 KB Output is correct
23 Correct 59 ms 11816 KB Output is correct
24 Correct 59 ms 11212 KB Output is correct
25 Correct 58 ms 11208 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 120 ms 11676 KB Output is correct
29 Correct 102 ms 11804 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 440 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 436 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 748 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 440 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 96 ms 11976 KB Output is correct
44 Correct 97 ms 12448 KB Output is correct
45 Correct 96 ms 11808 KB Output is correct
46 Correct 94 ms 11284 KB Output is correct
47 Correct 96 ms 11992 KB Output is correct
48 Correct 93 ms 11556 KB Output is correct
49 Correct 130 ms 12448 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 75 ms 11212 KB Output is correct
52 Correct 95 ms 10956 KB Output is correct
53 Correct 79 ms 10904 KB Output is correct
54 Correct 112 ms 11612 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 73 ms 11032 KB Output is correct
68 Correct 80 ms 10956 KB Output is correct
69 Correct 80 ms 11304 KB Output is correct
70 Correct 73 ms 11052 KB Output is correct
71 Correct 76 ms 12404 KB Output is correct
72 Correct 62 ms 11700 KB Output is correct
73 Correct 67 ms 12216 KB Output is correct
74 Correct 70 ms 11236 KB Output is correct
75 Correct 78 ms 12344 KB Output is correct
76 Correct 71 ms 11684 KB Output is correct
77 Correct 76 ms 12716 KB Output is correct
78 Correct 68 ms 11564 KB Output is correct
79 Correct 77 ms 10892 KB Output is correct
80 Correct 66 ms 11536 KB Output is correct
81 Correct 66 ms 10952 KB Output is correct
82 Correct 61 ms 12068 KB Output is correct
83 Correct 65 ms 11724 KB Output is correct
84 Correct 56 ms 11852 KB Output is correct
85 Correct 92 ms 11800 KB Output is correct
86 Correct 72 ms 11292 KB Output is correct
87 Correct 67 ms 11564 KB Output is correct
88 Correct 98 ms 11664 KB Output is correct
89 Correct 92 ms 12184 KB Output is correct
90 Correct 87 ms 11848 KB Output is correct
91 Correct 73 ms 11944 KB Output is correct
92 Correct 75 ms 11716 KB Output is correct
93 Correct 71 ms 12184 KB Output is correct
94 Correct 80 ms 12980 KB Output is correct
95 Correct 121 ms 13240 KB Output is correct
96 Correct 70 ms 11804 KB Output is correct
97 Correct 64 ms 11192 KB Output is correct
98 Correct 70 ms 12988 KB Output is correct
99 Correct 68 ms 11692 KB Output is correct
100 Correct 88 ms 12108 KB Output is correct
101 Correct 65 ms 12080 KB Output is correct
102 Correct 68 ms 12072 KB Output is correct