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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include <iostream>
#include <vector>

#define SMOL -2147483648;

using namespace std;

int numOfTask(const string &s, const char task) {
    int numOfMeetings= 0;

    for (int i = 0;i < s.size();i++) {
        if (s[i] == task) {
            numOfMeetings++;
        }
    }

    return numOfMeetings;
}

pair<int,int> shortestTimeBetweenOfficeMeetings(int n, int& k, int t, string& s, const int officeMeetings) {

    if (officeMeetings < k) {
        k-= officeMeetings;
        return make_pair(0,0);
    }

    vector <int> officeMeetingsInd;

    for (int i = 0;i<n;i++) {
        if (s[i] == '1') {
            officeMeetingsInd.push_back(i);
        }
    }

    int firstElement;
    int firstRemoteMeeting;

    while (k>0) {
        firstElement = officeMeetingsInd.front() - t - 1 > 0 ? officeMeetingsInd.front() - t - 1: -1;
        if (firstElement < 0) {
            break;
        }
        firstRemoteMeeting = s.find('2',firstElement);
        if (firstRemoteMeeting > officeMeetingsInd.front()) {
            break;
        }
        if (officeMeetingsInd.front() - firstRemoteMeeting <= t) {
            k--;
            s[officeMeetingsInd.front()] = '3';
            officeMeetingsInd.erase(officeMeetingsInd.begin());

        }
        else {
            break;
        }
    }

    int nextRemoteMeeting;

    while (k>0) {
        nextRemoteMeeting = s.find('2',officeMeetingsInd.back());
        if (nextRemoteMeeting-officeMeetingsInd.back() <= t) {
            k--;
            s[officeMeetingsInd.back()] = '3';
            officeMeetingsInd.pop_back();
        }
        else {
            break;
        }
    }

    while (k > 0) {
        int firstMeetingGap = officeMeetingsInd[1] - officeMeetingsInd[0];
        int lastMeetingGap = officeMeetingsInd[officeMeetingsInd.size()-1] - officeMeetingsInd[officeMeetingsInd.size()-2];

        if (firstMeetingGap >= lastMeetingGap) {
            s[officeMeetingsInd[0]] = '3';
            officeMeetingsInd.erase(officeMeetingsInd.begin());
            k--;
        }
        else {
            s[officeMeetingsInd.back()] = '3';
            officeMeetingsInd.pop_back();
            k--;
        }
    }

    nextRemoteMeeting = s.find('2',officeMeetingsInd.back());

    if (nextRemoteMeeting - officeMeetingsInd[officeMeetingsInd.size()-1] <= t) {
        officeMeetingsInd.push_back(nextRemoteMeeting);
        s[nextRemoteMeeting] = '1';
        nextRemoteMeeting = s.find('2',nextRemoteMeeting) > 0 ? s.find('2',nextRemoteMeeting):n;
        if (n - nextRemoteMeeting <=t) {
            return make_pair(-1,-1);
        }
    }

    if (officeMeetingsInd[0] - t < 0) {
        return make_pair(-1,-1);
    }
    if (officeMeetingsInd[officeMeetingsInd.size()-1] + t >= n) {
        return make_pair(-1,-1);
    }

    int toWork = officeMeetingsInd[0] - t;
    int fromWork = officeMeetingsInd[officeMeetingsInd.size()-1] + t;

    for (int i = toWork;i <= fromWork;i++) {
        if (s[i] == '2') {
            if (k>0) {
                k--;
            }
            else {
                return make_pair(-1,-1);
            }
        }
        s[i] = '1';
    }

    return make_pair(officeMeetingsInd[0],officeMeetingsInd[officeMeetingsInd.size()-1]);
}

int computeMaxStudyTime(int n, int k, int t, string& s) {
    int officeMeetings = numOfTask(s, '1');
    int remoteMeetings = numOfTask(s, '2');

    if (officeMeetings + remoteMeetings <= k) {
        return n;
    }

    pair <int,int> shortestTimeInOffice = shortestTimeBetweenOfficeMeetings(n,  k,  t, s,officeMeetings);

    //cout << s +'\n';

    if (shortestTimeInOffice.first == -1) {
        return -1;
    }


    int skippedRemote = min(k,remoteMeetings);

    int maxStudyTime =numOfTask(s,'3') + skippedRemote;

    return maxStudyTime;
}

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

    /*
     *  1 - spotkanie w biurze
     *  2 - zdalne spotkanie
     *  3 - brak obowiązków
     */

    int n, k, t;
    string s;

    cin >> n >> k >> t >> s;

    cout << computeMaxStudyTime(n,k,t,s);
}