1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define Q queue
#define PQ priority_queue
#define ST stack
#define UMAP unordered_map
typedef long long LL;
typedef pair<int, int> PII;
typedef V<int> VI;
typedef V<V<int>> VVI;

struct Moment {
    int free_time = 0;
    int remote_meetings = 0;
    int work_meetings = 0;
    inline Moment operator-(Moment& x) {
        Moment res;
        res.free_time = this->free_time - x.free_time;
        res.remote_meetings = this->remote_meetings - x.remote_meetings;
        res.work_meetings = this->work_meetings - x.work_meetings;
        return res;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, ck, t;
    cin >> n >> ck >> t;
    V<Moment> day(n+1);

    string s;
    cin >> s;
    for (int i = 1; i <= n; ++i) {
        day[i] = day[i-1];
        if (s[i-1] == '3') {
            ++day[i].free_time;
        } else if (s[i-1] == '2') {
            ++day[i].remote_meetings;
        } else {
            ++day[i].work_meetings;
        }
    }

    int best = -1;
    for (int r = 0; r < n; ++r) {
        for (int l = 0; l <= r; ++l) {
            int k = ck;
            int len = (r-l)+1;
            if (len < (t<<1))
                continue;
            Moment road_to = day[l+t] - day[l];
            Moment road_from = day[r+1] - day[r-t+1];
            //Moment at_work = day[r-t+1] - day[l+t];
            Moment before_work = day[l] - day[0];
            Moment after_work = day[n]-day[r+1];
            k -= road_to.remote_meetings + road_to.work_meetings;
            k -= road_from.remote_meetings + road_from.work_meetings;
            k -= before_work.work_meetings;
            k -= after_work.work_meetings;
            k = min(k, before_work.remote_meetings + after_work.remote_meetings);
            if (k < 0)
                continue;
            best = max(best, before_work.free_time + after_work.free_time + k + before_work.work_meetings + after_work.work_meetings);
        }
    }

    {
        Moment all = day[n];
        int k = ck - all.work_meetings;
        if (k >= 0) {
            k = min(k, all.remote_meetings);
            best = max(best, all.free_time + k + all.work_meetings);
        }
    }

    cout << best << '\n';
    return 0;
}