oj.uz

Submission #976528

# Submission time Handle Problem Language Result Execution time Memory
976528 2024-05-06T16:20:23 Z GrindMachine Wiring (IOI17_wiring) C++17
100 / 100
 63 ms 15896 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

/*

refs;
https://cubelover.tistory.com/8

*/

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"

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));
    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;
    }

    return dp[siz]; 
}

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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 28 ms 11388 KB Output is correct
4 Correct 26 ms 12660 KB Output is correct
5 Correct 26 ms 11460 KB Output is correct
6 Correct 40 ms 14672 KB Output is correct
7 Correct 37 ms 14524 KB Output is correct
8 Correct 34 ms 14536 KB Output is correct
9 Correct 34 ms 14396 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 0 ms 348 KB Output is correct
3 Correct 55 ms 14780 KB Output is correct
4 Correct 57 ms 15728 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 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 1 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 55 ms 15632 KB Output is correct
19 Correct 54 ms 15124 KB Output is correct
20 Correct 56 ms 14272 KB Output is correct
21 Correct 53 ms 14264 KB Output is correct
22 Correct 54 ms 14348 KB Output is correct
23 Correct 56 ms 15288 KB Output is correct
24 Correct 63 ms 15648 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 47 ms 15676 KB Output is correct
3 Correct 51 ms 15048 KB Output is correct
4 Correct 47 ms 15288 KB Output is correct
5 Correct 51 ms 15032 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 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 600 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 0 ms 348 KB Output is correct
18 Correct 43 ms 15036 KB Output is correct
19 Correct 58 ms 15472 KB Output is correct
20 Correct 43 ms 14632 KB Output is correct
21 Correct 40 ms 15240 KB Output is correct
22 Correct 45 ms 14896 KB Output is correct
23 Correct 43 ms 15296 KB Output is correct
24 Correct 40 ms 15896 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 28 ms 11388 KB Output is correct
20 Correct 26 ms 12660 KB Output is correct
21 Correct 26 ms 11460 KB Output is correct
22 Correct 40 ms 14672 KB Output is correct
23 Correct 37 ms 14524 KB Output is correct
24 Correct 34 ms 14536 KB Output is correct
25 Correct 34 ms 14396 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 55 ms 14780 KB Output is correct
29 Correct 57 ms 15728 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 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 1 ms 348 KB Output is correct
40 Correct 0 ms 600 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 55 ms 15632 KB Output is correct
44 Correct 54 ms 15124 KB Output is correct
45 Correct 56 ms 14272 KB Output is correct
46 Correct 53 ms 14264 KB Output is correct
47 Correct 54 ms 14348 KB Output is correct
48 Correct 56 ms 15288 KB Output is correct
49 Correct 63 ms 15648 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 47 ms 15676 KB Output is correct
52 Correct 51 ms 15048 KB Output is correct
53 Correct 47 ms 15288 KB Output is correct
54 Correct 51 ms 15032 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 0 ms 600 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 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 43 ms 15036 KB Output is correct
68 Correct 58 ms 15472 KB Output is correct
69 Correct 43 ms 14632 KB Output is correct
70 Correct 40 ms 15240 KB Output is correct
71 Correct 45 ms 14896 KB Output is correct
72 Correct 43 ms 15296 KB Output is correct
73 Correct 40 ms 15896 KB Output is correct
74 Correct 35 ms 15548 KB Output is correct
75 Correct 45 ms 14520 KB Output is correct
76 Correct 43 ms 14792 KB Output is correct
77 Correct 43 ms 15804 KB Output is correct
78 Correct 40 ms 15248 KB Output is correct
79 Correct 43 ms 15552 KB Output is correct
80 Correct 36 ms 14524 KB Output is correct
81 Correct 40 ms 14920 KB Output is correct
82 Correct 41 ms 15408 KB Output is correct
83 Correct 35 ms 14524 KB Output is correct
84 Correct 34 ms 14924 KB Output is correct
85 Correct 48 ms 15404 KB Output is correct
86 Correct 37 ms 15300 KB Output is correct
87 Correct 39 ms 15868 KB Output is correct
88 Correct 54 ms 14524 KB Output is correct
89 Correct 39 ms 14268 KB Output is correct
90 Correct 47 ms 14780 KB Output is correct
91 Correct 37 ms 15040 KB Output is correct
92 Correct 49 ms 15340 KB Output is correct
93 Correct 38 ms 15296 KB Output is correct
94 Correct 41 ms 15808 KB Output is correct
95 Correct 43 ms 14524 KB Output is correct
96 Correct 44 ms 15380 KB Output is correct
97 Correct 36 ms 14692 KB Output is correct
98 Correct 40 ms 14388 KB Output is correct
99 Correct 39 ms 14272 KB Output is correct
100 Correct 44 ms 14784 KB Output is correct
101 Correct 46 ms 14660 KB Output is correct
102 Correct 50 ms 14784 KB Output is correct