oj.uz

Submission #894459

# Submission time Handle Problem Language Result Execution time Memory
894459 2023-12-28T10:06:06 Z vjudge1 The short shank; Redemption (BOI21_prison) C++17
100 / 100
 1511 ms 134976 KB 
#include<bits/stdc++.h>
 
using namespace std;

struct segTree{
    vector<int> v;
    int sz;
    void init(int n){
        sz = 1;
        while(sz < n) sz *= 2;
        v.assign(2 * sz, -1);
    }
    void set(int i, int val, int x, int lx, int rx){
        if(rx - lx == 1){
            v[x] = val;
            return;
        }
        int m = (lx + rx) / 2;
        if(i < m) set(i, val, 2 * x + 1, lx, m);
        else set(i, val, 2 * x + 2, m, rx);
        v[x] = max(v[2 * x + 1], v[2 * x + 2]);
    }
    void set(int i, int val){
        set(i, val, 0, 0, sz);
    }
    int calc(int l, int r, int x, int lx, int rx){
        if(lx >= l && rx <= r){
            return v[x];
        }else if(lx >= r || rx <= l) return -1;
        int m = (lx + rx) / 2;
        int c1 = calc(l, r, 2 * x + 1, lx, m);
        int c2 = calc(l, r, 2 * x + 2, m, rx);
        return max(c1, c2);
    }
    int calc(int l, int r){
        return calc(l, r, 0, 0, sz);
    }
};

struct segTree2{
    vector<pair<int, int>> v;
    int sz;
    void build(int x, int lx, int rx){
        if(rx - lx == 1){
            v[x] = {0, lx};
            return;
        }
        int m = (lx + rx) / 2;
        build(2 * x + 1, lx, m);
        build(2 * x + 2, m, rx);
        v[x] = max(v[2 * x + 1], v[2 * x + 2]);
    }
    void init(int n){
        sz = 1;
        while(sz < n) sz *= 2;
        v.resize(2 * sz);
        build(0, 0, sz);
    }
    void set(int i, int val, int x, int lx, int rx){
        if(rx - lx == 1){
            v[x] = {val, lx};
            return;
        }
        int m = (lx + rx) / 2;
        if(i < m) set(i, val, 2 * x + 1, lx, m);
        else set(i, val, 2 * x + 2, m, rx);
        v[x] = max(v[2 * x + 1], v[2 * x + 2]);
    }
    void set(int i, int val){
        set(i, val, 0, 0, sz);
    }
    pair<int, int> calc(int l, int r, int x, int lx, int rx){
        if(lx >= l && rx <= r){
            return v[x];
        }else if(lx >= r || rx <= l) return {-1, -1};
        int m = (lx + rx) / 2;
        pair<int, int> c1 = calc(l, r, 2 * x + 1, lx, m);
        pair<int, int> c2 = calc(l, r, 2 * x + 2, m, rx);
        return max(c1, c2);
    }
    pair<int, int> calc(int l, int r){
        return calc(l, r, 0, 0, sz);
    }
};

bool cmp(pair<int, int> a, pair<int, int> b){
    return a.second - a.first < b.second - b.first;
}

int fast(int n, int D, int T, vector<int> t){
    vector<pair<int, int>> all;
    vector<int> val(n);
    for(int i = 0; i < n; i++){
        if(t[i] > T) all.push_back({T - i, i});
        else all.push_back({t[i] - i, i});
    }
    sort(all.begin(), all.end());
    int cntId = 0;
    for(int i = 0; i < n; i++){
        if(i > 0 && all[i].first != all[i-1].first) cntId++;
        val[all[i].second] = cntId;
    }
    cntId++;
    segTree st; st.init(cntId);
    vector<pair<int, int>> inv;
    int ans = n;
    for(int i = 0; i < n; i++){
        if(t[i] > T){
            int mx = st.calc(0, val[i] + 1);
            if(mx != -1){
                inv.push_back({mx, i});
            }else ans--;
        }else st.set(val[i], i);
    }
    sort(inv.begin(), inv.end(), cmp);
    segTree2 seg; seg.init(n);
    for(pair<int, int> p : inv){
        pair<int, int> mx = seg.calc(p.first, p.second + 1);
        seg.set(mx.second, 0);
        seg.set(p.second, mx.first + 1);
    }
    vector<int> cc;
    for(int i = 0; i < n; i++){
        cc.push_back(seg.calc(i, i + 1).first);
    }
    sort(cc.begin(), cc.end());
    for(int i = (int)cc.size() - 1; i >= 0 && D > 0; i--){
        D--;
        ans -= cc[i];
    }
    return ans;
}

int slow(int n, int D, int T, vector<int> t){
    int realAns = n;
    for(int i = 0; i < n; i++){
        int ans = 0;
        int mn = 2e9;
        for(int j = 0; j <= i; j++){
            mn++;
            mn = min(mn, t[j]);
            if(mn <= T) ans++;
            // cout << "j " << j << " mn " << mn << " ans " << ans << "\n";
        }
        mn = 2e9;
        for(int j = i+1; j < n; j++){
            mn++;
            mn = min(mn, t[j]);
            if(mn <= T) ans++;
            // cout << "j " << j << " mn " << mn << " ans " << ans << "\n";
        }
        // cout << "i " << i << " ans " << ans << "\n";
        realAns = min(realAns, ans);
    }
    return realAns;
}

mt19937 gen(time(0));

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string s; 
    // cin >> s; 
    s = "RUN";
    if(s == "RUN"){
        int n, D, T; cin >> n >> D >> T;
        vector<int> t(n);
        for(auto &i : t) cin >> i;
        cout << fast(n, D, T, t) << "\n";
        // cout << "Fast" << endl << fast(n, D, T, t) << "\n";
        // cout << "Slow" << endl << slow(n, D, T, t) << "\n";
        return 0;
    }

    for(int tt = 0; tt < 1000; tt++){
        int n = gen() % 100 + 1;
        int D = 1;
        int T = gen() % 10000 + 1;
        vector<int> t(n);
        for(int i = 0; i < n; i++) t[i] = gen() % 1100000 + 1;
        int ans1 = fast(n, D, T, t);
        int ans2 = slow(n, D, T, t);
        if(ans1 != ans2){
            cout << n << " " << D << " " << T << "\n";
            for(int x : t) cout << x << " "; 
            cout << "\n";
            cout << "Ans1: " << ans1 << "\n";
            cout << "Ans2: " << ans2 << "\n";
            return 0;
        }
    }
    cout << "Nothing\n";
}

Subtask #1
15.0 / 15.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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 322 ms 28528 KB Output is correct
3 Correct 288 ms 27748 KB Output is correct
4 Correct 292 ms 29500 KB Output is correct
5 Correct 345 ms 29148 KB Output is correct
6 Correct 255 ms 28636 KB Output is correct
7 Correct 379 ms 34384 KB Output is correct
8 Correct 280 ms 32284 KB Output is correct

Subtask #3
20.0 / 20.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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 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 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 540 KB Output is correct
25 Correct 3 ms 600 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 2 ms 472 KB Output is correct
31 Correct 2 ms 500 KB Output is correct
32 Correct 2 ms 648 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 2 ms 672 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 48 ms 6096 KB Output is correct
3 Correct 45 ms 6088 KB Output is correct
4 Correct 45 ms 5588 KB Output is correct
5 Correct 52 ms 5584 KB Output is correct
6 Correct 51 ms 5580 KB Output is correct
7 Correct 38 ms 5840 KB Output is correct
8 Correct 35 ms 6548 KB Output is correct
9 Correct 52 ms 6740 KB Output is correct
10 Correct 34 ms 6104 KB Output is correct

Subtask #5
25.0 / 25.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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 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 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 540 KB Output is correct
25 Correct 3 ms 600 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 2 ms 472 KB Output is correct
31 Correct 2 ms 500 KB Output is correct
32 Correct 2 ms 648 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 2 ms 672 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 48 ms 6096 KB Output is correct
38 Correct 45 ms 6088 KB Output is correct
39 Correct 45 ms 5588 KB Output is correct
40 Correct 52 ms 5584 KB Output is correct
41 Correct 51 ms 5580 KB Output is correct
42 Correct 38 ms 5840 KB Output is correct
43 Correct 35 ms 6548 KB Output is correct
44 Correct 52 ms 6740 KB Output is correct
45 Correct 34 ms 6104 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 460 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 504 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 360 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 2 ms 604 KB Output is correct
59 Correct 2 ms 604 KB Output is correct
60 Correct 2 ms 604 KB Output is correct
61 Correct 3 ms 604 KB Output is correct
62 Correct 3 ms 728 KB Output is correct
63 Correct 3 ms 604 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 472 KB Output is correct
67 Correct 2 ms 600 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 2 ms 712 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 50 ms 6884 KB Output is correct
72 Correct 46 ms 6660 KB Output is correct
73 Correct 45 ms 6096 KB Output is correct
74 Correct 53 ms 6416 KB Output is correct
75 Correct 48 ms 6372 KB Output is correct
76 Correct 36 ms 6352 KB Output is correct
77 Correct 35 ms 6348 KB Output is correct
78 Correct 53 ms 6736 KB Output is correct
79 Correct 34 ms 6052 KB Output is correct
80 Correct 45 ms 6604 KB Output is correct
81 Correct 48 ms 6864 KB Output is correct
82 Correct 48 ms 6728 KB Output is correct
83 Correct 48 ms 6124 KB Output is correct
84 Correct 48 ms 5872 KB Output is correct
85 Correct 50 ms 6352 KB Output is correct
86 Correct 42 ms 6148 KB Output is correct
87 Correct 35 ms 6012 KB Output is correct
88 Correct 54 ms 7036 KB Output is correct
89 Correct 50 ms 6756 KB Output is correct
90 Correct 45 ms 6260 KB Output is correct

Subtask #6
20.0 / 20.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 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 322 ms 28528 KB Output is correct
14 Correct 288 ms 27748 KB Output is correct
15 Correct 292 ms 29500 KB Output is correct
16 Correct 345 ms 29148 KB Output is correct
17 Correct 255 ms 28636 KB Output is correct
18 Correct 379 ms 34384 KB Output is correct
19 Correct 280 ms 32284 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 540 KB Output is correct
33 Correct 3 ms 600 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 3 ms 604 KB Output is correct
38 Correct 2 ms 472 KB Output is correct
39 Correct 2 ms 500 KB Output is correct
40 Correct 2 ms 648 KB Output is correct
41 Correct 2 ms 600 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 2 ms 672 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 48 ms 6096 KB Output is correct
46 Correct 45 ms 6088 KB Output is correct
47 Correct 45 ms 5588 KB Output is correct
48 Correct 52 ms 5584 KB Output is correct
49 Correct 51 ms 5580 KB Output is correct
50 Correct 38 ms 5840 KB Output is correct
51 Correct 35 ms 6548 KB Output is correct
52 Correct 52 ms 6740 KB Output is correct
53 Correct 34 ms 6104 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 460 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 504 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 360 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 604 KB Output is correct
67 Correct 2 ms 604 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 3 ms 604 KB Output is correct
70 Correct 3 ms 728 KB Output is correct
71 Correct 3 ms 604 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 472 KB Output is correct
75 Correct 2 ms 600 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 2 ms 712 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 50 ms 6884 KB Output is correct
80 Correct 46 ms 6660 KB Output is correct
81 Correct 45 ms 6096 KB Output is correct
82 Correct 53 ms 6416 KB Output is correct
83 Correct 48 ms 6372 KB Output is correct
84 Correct 36 ms 6352 KB Output is correct
85 Correct 35 ms 6348 KB Output is correct
86 Correct 53 ms 6736 KB Output is correct
87 Correct 34 ms 6052 KB Output is correct
88 Correct 45 ms 6604 KB Output is correct
89 Correct 48 ms 6864 KB Output is correct
90 Correct 48 ms 6728 KB Output is correct
91 Correct 48 ms 6124 KB Output is correct
92 Correct 48 ms 5872 KB Output is correct
93 Correct 50 ms 6352 KB Output is correct
94 Correct 42 ms 6148 KB Output is correct
95 Correct 35 ms 6012 KB Output is correct
96 Correct 54 ms 7036 KB Output is correct
97 Correct 50 ms 6756 KB Output is correct
98 Correct 45 ms 6260 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 456 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 321 ms 33232 KB Output is correct
112 Correct 281 ms 32444 KB Output is correct
113 Correct 292 ms 32772 KB Output is correct
114 Correct 354 ms 32064 KB Output is correct
115 Correct 265 ms 31936 KB Output is correct
116 Correct 412 ms 34108 KB Output is correct
117 Correct 280 ms 32600 KB Output is correct
118 Correct 2 ms 600 KB Output is correct
119 Correct 2 ms 600 KB Output is correct
120 Correct 2 ms 732 KB Output is correct
121 Correct 2 ms 812 KB Output is correct
122 Correct 3 ms 604 KB Output is correct
123 Correct 3 ms 720 KB Output is correct
124 Correct 2 ms 604 KB Output is correct
125 Correct 2 ms 604 KB Output is correct
126 Correct 2 ms 500 KB Output is correct
127 Correct 2 ms 604 KB Output is correct
128 Correct 2 ms 604 KB Output is correct
129 Correct 2 ms 600 KB Output is correct
130 Correct 2 ms 600 KB Output is correct
131 Correct 0 ms 344 KB Output is correct
132 Correct 50 ms 6860 KB Output is correct
133 Correct 46 ms 6864 KB Output is correct
134 Correct 45 ms 6088 KB Output is correct
135 Correct 55 ms 6352 KB Output is correct
136 Correct 47 ms 6348 KB Output is correct
137 Correct 36 ms 6560 KB Output is correct
138 Correct 35 ms 6444 KB Output is correct
139 Correct 52 ms 6736 KB Output is correct
140 Correct 34 ms 6064 KB Output is correct
141 Correct 45 ms 6648 KB Output is correct
142 Correct 48 ms 6868 KB Output is correct
143 Correct 45 ms 6836 KB Output is correct
144 Correct 48 ms 6092 KB Output is correct
145 Correct 47 ms 5836 KB Output is correct
146 Correct 49 ms 6348 KB Output is correct
147 Correct 41 ms 6092 KB Output is correct
148 Correct 35 ms 6032 KB Output is correct
149 Correct 61 ms 6608 KB Output is correct
150 Correct 52 ms 6744 KB Output is correct
151 Correct 45 ms 6260 KB Output is correct
152 Correct 1420 ms 130556 KB Output is correct
153 Correct 1450 ms 133460 KB Output is correct
154 Correct 1450 ms 129844 KB Output is correct
155 Correct 1401 ms 128536 KB Output is correct
156 Correct 1511 ms 124744 KB Output is correct
157 Correct 964 ms 125988 KB Output is correct
158 Correct 1115 ms 126968 KB Output is correct
159 Correct 1495 ms 134976 KB Output is correct
160 Correct 1355 ms 134320 KB Output is correct
161 Correct 1002 ms 127388 KB Output is correct
162 Correct 946 ms 127084 KB Output is correct