oj.uz

답안 #978694

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978694 2024-05-09T14:04:48 Z GrindMachine 전선 연결 (IOI17_wiring) C++17
100 / 100
 117 ms 11188 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);
        }
    }

    ll ans = med.first_val;
    return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 0 ms 348 KB Output is correct
14 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 40 ms 9076 KB Output is correct
4 Correct 39 ms 9160 KB Output is correct
5 Correct 48 ms 9928 KB Output is correct
6 Correct 58 ms 10424 KB Output is correct
7 Correct 58 ms 9664 KB Output is correct
8 Correct 60 ms 9932 KB Output is correct
9 Correct 58 ms 9928 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 94 ms 10940 KB Output is correct
4 Correct 100 ms 10524 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 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 0 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 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 93 ms 9576 KB Output is correct
19 Correct 92 ms 10276 KB Output is correct
20 Correct 97 ms 10048 KB Output is correct
21 Correct 92 ms 9772 KB Output is correct
22 Correct 96 ms 9792 KB Output is correct
23 Correct 93 ms 9672 KB Output is correct
24 Correct 117 ms 10756 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 82 ms 10632 KB Output is correct
3 Correct 87 ms 10476 KB Output is correct
4 Correct 79 ms 9404 KB Output is correct
5 Correct 88 ms 9676 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 0 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 0 ms 348 KB Output is correct
18 Correct 71 ms 11104 KB Output is correct
19 Correct 77 ms 9668 KB Output is correct
20 Correct 74 ms 9912 KB Output is correct
21 Correct 69 ms 10180 KB Output is correct
22 Correct 68 ms 10176 KB Output is correct
23 Correct 63 ms 9652 KB Output is correct
24 Correct 61 ms 10440 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 0 ms 348 KB Output is correct
14 Correct 0 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 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 40 ms 9076 KB Output is correct
20 Correct 39 ms 9160 KB Output is correct
21 Correct 48 ms 9928 KB Output is correct
22 Correct 58 ms 10424 KB Output is correct
23 Correct 58 ms 9664 KB Output is correct
24 Correct 60 ms 9932 KB Output is correct
25 Correct 58 ms 9928 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 94 ms 10940 KB Output is correct
29 Correct 100 ms 10524 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 93 ms 9576 KB Output is correct
44 Correct 92 ms 10276 KB Output is correct
45 Correct 97 ms 10048 KB Output is correct
46 Correct 92 ms 9772 KB Output is correct
47 Correct 96 ms 9792 KB Output is correct
48 Correct 93 ms 9672 KB Output is correct
49 Correct 117 ms 10756 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 82 ms 10632 KB Output is correct
52 Correct 87 ms 10476 KB Output is correct
53 Correct 79 ms 9404 KB Output is correct
54 Correct 88 ms 9676 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 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 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 71 ms 11104 KB Output is correct
68 Correct 77 ms 9668 KB Output is correct
69 Correct 74 ms 9912 KB Output is correct
70 Correct 69 ms 10180 KB Output is correct
71 Correct 68 ms 10176 KB Output is correct
72 Correct 63 ms 9652 KB Output is correct
73 Correct 61 ms 10440 KB Output is correct
74 Correct 68 ms 10048 KB Output is correct
75 Correct 80 ms 9928 KB Output is correct
76 Correct 67 ms 9912 KB Output is correct
77 Correct 80 ms 11148 KB Output is correct
78 Correct 65 ms 9924 KB Output is correct
79 Correct 71 ms 10424 KB Output is correct
80 Correct 60 ms 10384 KB Output is correct
81 Correct 61 ms 9552 KB Output is correct
82 Correct 60 ms 9548 KB Output is correct
83 Correct 59 ms 10284 KB Output is correct
84 Correct 56 ms 9412 KB Output is correct
85 Correct 84 ms 10164 KB Output is correct
86 Correct 62 ms 9804 KB Output is correct
87 Correct 71 ms 9932 KB Output is correct
88 Correct 67 ms 11188 KB Output is correct
89 Correct 64 ms 10868 KB Output is correct
90 Correct 82 ms 10932 KB Output is correct
91 Correct 60 ms 9420 KB Output is correct
92 Correct 68 ms 9660 KB Output is correct
93 Correct 67 ms 9668 KB Output is correct
94 Correct 67 ms 9912 KB Output is correct
95 Correct 83 ms 9912 KB Output is correct
96 Correct 59 ms 9676 KB Output is correct
97 Correct 63 ms 9960 KB Output is correct
98 Correct 69 ms 9660 KB Output is correct
99 Correct 64 ms 10188 KB Output is correct
100 Correct 74 ms 10176 KB Output is correct
101 Correct 61 ms 9768 KB Output is correct
102 Correct 82 ms 10296 KB Output is correct