oj.uz

답안 #711332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711332 2023-03-16T15:24:30 Z sysia The short shank; Redemption (BOI21_prison) C++17
100 / 100
 1999 ms 98576 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef pair<int, int> T;
const int oo = 1e9+7;

struct TreeMin{
    vector<T>tab;
    int size = 1;

    TreeMin(int n, vector<int>&a){
        while (size < n) size*=2;
        tab.assign(2*size, {oo, oo});
        for (int i = 1; i<(int)a.size(); i++) tab[i+size] = {a[i], i};
        for (int i = size-1; i>=1; i--) tab[i] = min(tab[2*i], tab[2*i+1]);
    }

    T query(int l, int r){
        T ans = {oo, oo};
        for (l += size-1, r += size+1; r-l>1; l/=2, r/=2){
            if (!(l&1)) ans = min(ans, tab[l+1]);
            if (r&1) ans = min(ans, tab[r-1]);
        }
        return ans;
    }

    void update(int x) {
        x += size;
        tab[x] = {oo, oo};
        while (x){
            x/=2;
            tab[x] = min(tab[2*x], tab[2*x+1]);
        }
    }
};

struct Tree{
    vector<int>tab, lazy;
    int size = 1;

    Tree(int n){
        while (size < n) size*=2;
        tab.assign(2*size, 0);
        lazy.assign(2*size, 0);
    }

    void update(int x, int lx, int rx, int l, int r, int v){
        if (lx != rx) push(x);
        if (lx > r || rx < l) return;
        if (lx >= l && rx <= r) {
            tab[x] += v;
            lazy[x] += v;
            return;
        }
        int m = (lx+rx)/2;
        update(2*x, lx, m, l, r, v);
        update(2*x+1, m+1, rx, l, r, v);
        tab[x] = max(tab[2*x], tab[2*x+1]);
    }

    void push(int x){
        if (!lazy[x]) return;
        tab[2*x] += lazy[x];
        tab[2*x+1] += lazy[x];
        lazy[2*x] += lazy[x];
        lazy[2*x+1] += lazy[x];
        lazy[x] = 0;
    }

    int find(int x, int lx, int rx){
        if (lx == rx) return lx;
        push(x);
        int m = (lx+rx)/2;
        if (tab[2*x] < tab[2*x+1]) return find(2*x+1, m+1, rx);
        return find(2*x, lx, m);
    }
};

void read(int &x){
    register int c;
    x = 0;
    c = getchar();
    for (; (c>47 && c<58); c=getchar()) x = x*10 + c - 48;
}

void solve(){
    int n, d, tt;read(n); read(d); read(tt);
    vector<int>prev(n+1, oo);
    stack<int>s;
    vector<int>t(n+1);
    for (int i = 1; i<=n; i++) read(t[i]);
    for (int i = 1; i<=n; i++){
        s.push(i);
        while ((int)s.size() && s.top() - t[s.top()] < i - tt) s.pop();
        if ((int)s.size()) prev[i] = s.top();   
    }
    debug(prev);
    TreeMin tmin(n+2, prev);
    Tree tans(n+1);
    for (int i = 1; i<=n; i++){
        if (prev[i] <= i){
            debug(prev[i], i);
            tans.update(1, 0, tans.size-1, prev[i], i, 1);
        }
    }
    while (d--){
        int x = tans.find(1, 0, tans.size-1);
        debug(x);
        bool any = 0;
        while (1){
            T now = tmin.query(x+1, n+1);
            if (now.first > x) break;
            debug(now);
            tans.update(1, 0, tans.size-1, now.first, now.second, -1);
            tmin.update(now.second);
            prev[now.second] = oo;
            any = 1;
        }
        if (!any) break;
    }
    int ans = 0;
    debug(prev);
    for (int i = 1; i<=n; i++) if (prev[i] != oo) ans++;
    cout << ans << "\n";
}

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

    solve();

    return 0;
}

Compilation message

prison.cpp: In function 'void read(int&)':
prison.cpp:103:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  103 |     register int c;
      |                  ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 324 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 119 ms 21760 KB Output is correct
3 Correct 126 ms 21992 KB Output is correct
4 Correct 156 ms 21620 KB Output is correct
5 Correct 123 ms 20704 KB Output is correct
6 Correct 124 ms 20736 KB Output is correct
7 Correct 541 ms 20736 KB Output is correct
8 Correct 145 ms 20740 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 3 ms 492 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 496 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 408 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 3 ms 468 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 20 ms 5232 KB Output is correct
3 Correct 18 ms 5160 KB Output is correct
4 Correct 40 ms 5076 KB Output is correct
5 Correct 50 ms 5204 KB Output is correct
6 Correct 49 ms 5204 KB Output is correct
7 Correct 18 ms 5076 KB Output is correct
8 Correct 17 ms 5076 KB Output is correct
9 Correct 73 ms 5096 KB Output is correct
10 Correct 18 ms 5220 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 3 ms 492 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 496 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 408 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 20 ms 5232 KB Output is correct
38 Correct 18 ms 5160 KB Output is correct
39 Correct 40 ms 5076 KB Output is correct
40 Correct 50 ms 5204 KB Output is correct
41 Correct 49 ms 5204 KB Output is correct
42 Correct 18 ms 5076 KB Output is correct
43 Correct 17 ms 5076 KB Output is correct
44 Correct 73 ms 5096 KB Output is correct
45 Correct 18 ms 5220 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 324 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 2 ms 468 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 2 ms 468 KB Output is correct
68 Correct 2 ms 468 KB Output is correct
69 Correct 3 ms 468 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 21 ms 5236 KB Output is correct
72 Correct 19 ms 5224 KB Output is correct
73 Correct 40 ms 5076 KB Output is correct
74 Correct 53 ms 5168 KB Output is correct
75 Correct 49 ms 5096 KB Output is correct
76 Correct 17 ms 5116 KB Output is correct
77 Correct 16 ms 5076 KB Output is correct
78 Correct 67 ms 5076 KB Output is correct
79 Correct 16 ms 5032 KB Output is correct
80 Correct 27 ms 5188 KB Output is correct
81 Correct 42 ms 5160 KB Output is correct
82 Correct 31 ms 5224 KB Output is correct
83 Correct 42 ms 5136 KB Output is correct
84 Correct 34 ms 4948 KB Output is correct
85 Correct 54 ms 5168 KB Output is correct
86 Correct 38 ms 5104 KB Output is correct
87 Correct 38 ms 5100 KB Output is correct
88 Correct 63 ms 5068 KB Output is correct
89 Correct 80 ms 5204 KB Output is correct
90 Correct 58 ms 5104 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 119 ms 21760 KB Output is correct
14 Correct 126 ms 21992 KB Output is correct
15 Correct 156 ms 21620 KB Output is correct
16 Correct 123 ms 20704 KB Output is correct
17 Correct 124 ms 20736 KB Output is correct
18 Correct 541 ms 20736 KB Output is correct
19 Correct 145 ms 20740 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 496 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 464 KB Output is correct
37 Correct 2 ms 468 KB Output is correct
38 Correct 2 ms 408 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 20 ms 5232 KB Output is correct
46 Correct 18 ms 5160 KB Output is correct
47 Correct 40 ms 5076 KB Output is correct
48 Correct 50 ms 5204 KB Output is correct
49 Correct 49 ms 5204 KB Output is correct
50 Correct 18 ms 5076 KB Output is correct
51 Correct 17 ms 5076 KB Output is correct
52 Correct 73 ms 5096 KB Output is correct
53 Correct 18 ms 5220 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 324 KB Output is correct
65 Correct 1 ms 468 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 2 ms 468 KB Output is correct
68 Correct 2 ms 468 KB Output is correct
69 Correct 2 ms 468 KB Output is correct
70 Correct 2 ms 468 KB Output is correct
71 Correct 1 ms 468 KB Output is correct
72 Correct 1 ms 468 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 2 ms 468 KB Output is correct
75 Correct 2 ms 468 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 3 ms 468 KB Output is correct
78 Correct 1 ms 328 KB Output is correct
79 Correct 21 ms 5236 KB Output is correct
80 Correct 19 ms 5224 KB Output is correct
81 Correct 40 ms 5076 KB Output is correct
82 Correct 53 ms 5168 KB Output is correct
83 Correct 49 ms 5096 KB Output is correct
84 Correct 17 ms 5116 KB Output is correct
85 Correct 16 ms 5076 KB Output is correct
86 Correct 67 ms 5076 KB Output is correct
87 Correct 16 ms 5032 KB Output is correct
88 Correct 27 ms 5188 KB Output is correct
89 Correct 42 ms 5160 KB Output is correct
90 Correct 31 ms 5224 KB Output is correct
91 Correct 42 ms 5136 KB Output is correct
92 Correct 34 ms 4948 KB Output is correct
93 Correct 54 ms 5168 KB Output is correct
94 Correct 38 ms 5104 KB Output is correct
95 Correct 38 ms 5100 KB Output is correct
96 Correct 63 ms 5068 KB Output is correct
97 Correct 80 ms 5204 KB Output is correct
98 Correct 58 ms 5104 KB Output is correct
99 Correct 0 ms 212 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 340 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 120 ms 21668 KB Output is correct
112 Correct 118 ms 22100 KB Output is correct
113 Correct 141 ms 21664 KB Output is correct
114 Correct 121 ms 20660 KB Output is correct
115 Correct 122 ms 20684 KB Output is correct
116 Correct 506 ms 20736 KB Output is correct
117 Correct 142 ms 20740 KB Output is correct
118 Correct 2 ms 468 KB Output is correct
119 Correct 2 ms 468 KB Output is correct
120 Correct 2 ms 452 KB Output is correct
121 Correct 2 ms 468 KB Output is correct
122 Correct 2 ms 468 KB Output is correct
123 Correct 1 ms 468 KB Output is correct
124 Correct 1 ms 468 KB Output is correct
125 Correct 2 ms 468 KB Output is correct
126 Correct 2 ms 468 KB Output is correct
127 Correct 1 ms 468 KB Output is correct
128 Correct 1 ms 468 KB Output is correct
129 Correct 2 ms 468 KB Output is correct
130 Correct 2 ms 484 KB Output is correct
131 Correct 1 ms 332 KB Output is correct
132 Correct 22 ms 5204 KB Output is correct
133 Correct 25 ms 5204 KB Output is correct
134 Correct 41 ms 5196 KB Output is correct
135 Correct 49 ms 5072 KB Output is correct
136 Correct 50 ms 5076 KB Output is correct
137 Correct 17 ms 5076 KB Output is correct
138 Correct 16 ms 5076 KB Output is correct
139 Correct 64 ms 5076 KB Output is correct
140 Correct 16 ms 5080 KB Output is correct
141 Correct 25 ms 5204 KB Output is correct
142 Correct 31 ms 5232 KB Output is correct
143 Correct 29 ms 5204 KB Output is correct
144 Correct 42 ms 5076 KB Output is correct
145 Correct 32 ms 5076 KB Output is correct
146 Correct 54 ms 5076 KB Output is correct
147 Correct 36 ms 5076 KB Output is correct
148 Correct 25 ms 4948 KB Output is correct
149 Correct 58 ms 5096 KB Output is correct
150 Correct 75 ms 5104 KB Output is correct
151 Correct 57 ms 5032 KB Output is correct
152 Correct 513 ms 85788 KB Output is correct
153 Correct 561 ms 85412 KB Output is correct
154 Correct 517 ms 86128 KB Output is correct
155 Correct 999 ms 83364 KB Output is correct
156 Correct 871 ms 81732 KB Output is correct
157 Correct 373 ms 81684 KB Output is correct
158 Correct 603 ms 81688 KB Output is correct
159 Correct 1984 ms 81696 KB Output is correct
160 Correct 1999 ms 98576 KB Output is correct
161 Correct 671 ms 98256 KB Output is correct
162 Correct 548 ms 98380 KB Output is correct