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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
#include <iostream>
#include <string>

#define MEETING_TOO_LATE (n-1-i < t)
#define MEETING_TOO_EARLY (i < t)



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

    int n, k, t;
    std::cin >> n >> k >> t;
    
    char* duties = new char[n];
    std::string workBlockDuties = "";

    int workBlockMeetings = 0;
    int workBlockLength = 0;
    //it's possible to attend first office meeting (drive there on time) and return to home from last meeting
    int workBlockStart = -1, workBlockEnd = -1;

    int remoteMeetingsHome = 0;
    int remoteMeetingsAfterLastOffcie = 0;

    int unattendedMeetings = 0;

    for(int i = 0; i < n; i++){
        char duty;
        std::cin >> duty;
        duties[i] = duty;

        if(duty == '1') {
            if(MEETING_TOO_EARLY || MEETING_TOO_LATE){
                unattendedMeetings++;
                //it's possible to attend first office meeting (drive ther on time) and return to home from last meeting
                //work block's start and set are not modified
                continue;
            }
            if(workBlockStart == -1) {
                workBlockStart = i;
                workBlockEnd = i;
                workBlockMeetings++;
            }
            else {
                workBlockEnd = i;
                workBlockMeetings++;
                remoteMeetingsAfterLastOffcie = 0;
            }
        }
        if(duty == '2'){
            if(workBlockStart == -1){
                remoteMeetingsHome++;
            }
            else{
                remoteMeetingsAfterLastOffcie++;
                workBlockMeetings++;
            }
        }
        if(workBlockStart != -1){
            workBlockDuties += duty;
        }
    }
    //Check if office meetings (on the edges) make it impossible to attend required amount of meetings
    if(unattendedMeetings > k) {
        std::cout << -1;
        delete[] duties;
        return 0;
    }

    int hoursToCut = k-unattendedMeetings;
    remoteMeetingsHome += remoteMeetingsAfterLastOffcie;
    workBlockMeetings -= remoteMeetingsAfterLastOffcie;

    workBlockLength = workBlockEnd - workBlockStart + 1;
    workBlockDuties = workBlockDuties.substr(0, workBlockLength);
    if(hoursToCut>workBlockMeetings){
        int resHours1 = n;
        resHours1-= (remoteMeetingsHome-hoursToCut-workBlockMeetings < 0 ? 0 : remoteMeetingsHome-hoursToCut-workBlockMeetings);
        std::cout << resHours1;
        delete[] duties;
        return 0;
    }

    int remoteMeetingsBurnedLeft = 0;
    int remoteMeetingsBurnedRight = 0;    

    for(int i = 0; i < t; i++){
        if(duties[workBlockStart - i-1] == '2'){
            remoteMeetingsBurnedLeft++;
        }
        if(duties[workBlockEnd + i+1] == '2'){
            remoteMeetingsBurnedRight++;
        }
    }

    int originalRemoteMeetingsBurnedLeft = remoteMeetingsBurnedLeft;
    int originalRemoteMeetingsBurnedRight = remoteMeetingsBurnedRight;   

    int* savedHours = new int[workBlockMeetings*2];

    int totalJumpsLeft = 0;
    int totalJumpsRight = 0;
    for(int i = 0; i < workBlockMeetings; i++){
        int jumpsIfCutThisHourLeft = 1;
        int jumpsIfCutThisHourRight = 1;

        while(i+totalJumpsLeft + 1 < workBlockLength &&  workBlockDuties[i+totalJumpsLeft+1] == '3'){
            jumpsIfCutThisHourLeft++;
            totalJumpsLeft++;
        }
        while(workBlockLength- i - 1 >= 0 &&  workBlockDuties[workBlockLength-i-totalJumpsRight-2] == '3'){\
            int index = workBlockLength-i-totalJumpsRight-1;
            jumpsIfCutThisHourRight++;
            totalJumpsRight++;
        }
        savedHours[workBlockMeetings-1-i] = jumpsIfCutThisHourLeft;
        savedHours[workBlockMeetings+i] = jumpsIfCutThisHourRight;
    }

    /*
    std::cout<<"WorkBlockSaves:\n";
    for(int i =0; i < workBlockMeetings*2; i++){
        std::cout<< savedHours[i] << " ";
    }
    std::cout << "\n";
    std::cout<<"Cut Range:\n";
    for(int i = workBlockMeetings - hoursToCut; i < workBlockMeetings + hoursToCut; i++){
        std::cout << savedHours[i] <<" ";
    }
    std::cout << "\n";
    */
    
    int sum = 0, maxCut = -1;
    int sumLeft = 0, sumRight = 0;
    for(int i = workBlockMeetings - hoursToCut; i < workBlockMeetings; i++){
        sum+= savedHours[i];
        //std::cout << savedHours[i] << " ";
    }

    sumLeft = sum;

    int reducedBurnedTransitLeft = (remoteMeetingsBurnedLeft-sumLeft < 0 ? 0 : remoteMeetingsBurnedLeft-sumLeft);
    int reducedBurnedTransitRight = (remoteMeetingsBurnedRight-sumRight < 0 ? 0 : remoteMeetingsBurnedRight-sumRight);
    int reducedBurnedTransit = reducedBurnedTransitLeft + reducedBurnedTransitRight;

    if(sum > maxCut && reducedBurnedTransit == 0){
        maxCut=sum;
    }

    for(int i = workBlockMeetings; i < workBlockMeetings + hoursToCut; i++) {//for each subarray

        sum += savedHours[i];
        sum -= savedHours[i-hoursToCut];
        
        sumLeft -= savedHours[i-hoursToCut];
        sumRight += savedHours[i];
        //std::cout << savedHours[i] << " ";

        reducedBurnedTransitLeft = (remoteMeetingsBurnedLeft-sumLeft < 0 ? 0 : remoteMeetingsBurnedLeft-sumLeft);
        reducedBurnedTransitRight = (remoteMeetingsBurnedRight-sumRight < 0 ? 0 : remoteMeetingsBurnedRight-sumRight);
        reducedBurnedTransit = reducedBurnedTransitLeft + reducedBurnedTransitRight;

        if(sum > maxCut && reducedBurnedTransit == 0){
            maxCut=sum;
        }

    }

    //std::cout << "\n";
    //std::cout<< "sum saved: " << maxCut << "\n";

#pragma region burn_right
    int maxProfit = 0;
    bool maxProfitSet = false;
    int profitableJoinedHomeMeetingsRight = 0;
    //workblock extension (stay for burned remote meetings so we can cut more hours from the other side)
    if(remoteMeetingsBurnedRight > 0 /*&& remoteMeetingsBurnedLeft==0*/){
        int totalCutFromLeft = 0;
        int cutsFromLeft =0;
        int currentProfit =0;

        int joinedHomeMeetings = 0;

        int minRemoteMeetingsBurnedRight = remoteMeetingsBurnedRight;

        int i =0; // i is added to right
        while(true){
            i++;
            if(workBlockEnd+i >= n-t || remoteMeetingsBurnedRight==0){
                break;
            }
            if(duties[workBlockEnd+i]=='2'){
                joinedHomeMeetings++;
            }
            //std::cout<< "\nadded to right: " << i <<"\n";
            if(duties[workBlockEnd+i]=='2' && duties[workBlockEnd+i+t] =='3'){

                bool needToExtendWorkBlock = (remoteMeetingsBurnedRight > hoursToCut);
                remoteMeetingsBurnedRight--;

                if(remoteMeetingsBurnedRight < minRemoteMeetingsBurnedRight){

                    if(!needToExtendWorkBlock){
                        totalCutFromLeft += savedHours[workBlockMeetings-1-cutsFromLeft];
                        cutsFromLeft++;
                    }
                    else{
                        needToExtendWorkBlock = (remoteMeetingsBurnedRight > hoursToCut);
                    }

                    minRemoteMeetingsBurnedRight = remoteMeetingsBurnedRight;
                    currentProfit = totalCutFromLeft - i;
                    if( ((currentProfit>maxProfit || !maxProfitSet) && !needToExtendWorkBlock) ){
                        maxProfit=currentProfit;
                        maxProfitSet = true;
                        profitableJoinedHomeMeetingsRight = joinedHomeMeetings;
                    }
                    //std::cout<< "current profit: " << currentProfit<<"\n";
                    //std::cout<< "max profit: " << maxProfit<<"\n";
                }
                continue;
            }
            if(duties[workBlockEnd+i]=='3' && duties[workBlockEnd+i+t] =='2'){
                remoteMeetingsBurnedRight++;
            }
        }
    
    }

#pragma endregion
#pragma region burn_left
int profitableJoinedHomeMeetingsLeft = 0;
//workblock extension (stay for burned remote meetings so we can cut more hours from the other side)
if(remoteMeetingsBurnedLeft > 0 /*&& remoteMeetingsBurnedRight==0*/){
    int totalCutFromRight = 0;
    int cutsFromRight =0;
    int currentProfit =0;

    int joinedHomeMeetings = 0;

    int minRemoteMeetingsBurnedLeft = remoteMeetingsBurnedLeft;

    int i =0; // i is added to left
    while(true){
        i++;
        if(workBlockStart-i <t || remoteMeetingsBurnedLeft==0){
            break;
        }
        if(duties[workBlockStart-i]=='2'){
            joinedHomeMeetings++;
        }

        //std::cout<< "\nadded to left: " << i <<"\n";
        if(duties[workBlockStart-i]=='2' && duties[workBlockStart-i-t] =='3'){

            bool needToExtendWorkBlock = (remoteMeetingsBurnedLeft > hoursToCut);
            remoteMeetingsBurnedLeft--;

            if(remoteMeetingsBurnedLeft < minRemoteMeetingsBurnedLeft){

                if(!needToExtendWorkBlock){
                    totalCutFromRight += savedHours[workBlockMeetings+cutsFromRight];
                    cutsFromRight++;
                }
                else{
                    needToExtendWorkBlock = (remoteMeetingsBurnedLeft > hoursToCut);
                }

                minRemoteMeetingsBurnedLeft = remoteMeetingsBurnedLeft;
                currentProfit = totalCutFromRight - i;
                if( ((currentProfit>maxProfit || !maxProfitSet) && !needToExtendWorkBlock) ){
                    maxProfit=currentProfit;
                    maxProfitSet = true;
                    profitableJoinedHomeMeetingsLeft = joinedHomeMeetings;
                }
                //std::cout<< "current profit: " << currentProfit<<"\n";
                //std::cout<< "max profit: " << maxProfit<<"\n";
            }
            continue;
        }
        if(duties[workBlockStart-i]=='3' && duties[workBlockStart-i-t] =='2'){
            remoteMeetingsBurnedLeft++;
        }
    }

}
#pragma endregion




    if(maxProfit>maxCut || (maxCut == -1 && maxProfitSet)){
        remoteMeetingsHome-=profitableJoinedHomeMeetingsLeft;
        remoteMeetingsHome-=profitableJoinedHomeMeetingsRight;
    }





    int resHours = n;
    if(hoursToCut>workBlockMeetings){
        resHours-= (remoteMeetingsHome-hoursToCut-workBlockMeetings < 0 ? 0 : remoteMeetingsHome-hoursToCut-workBlockMeetings);
    }
    else{
        if(maxCut==-1){
            if(!maxProfitSet)
                resHours = -1;
            else{
                resHours -= (workBlockLength - maxProfit); //maxprofit will be negative
                resHours -= 2*t;
                resHours -= remoteMeetingsHome;
            }
        }
        else{
            if(maxProfitSet){
                resHours -= (workBlockLength - maxCut < workBlockLength - maxProfit ? workBlockLength - maxCut : workBlockLength - maxProfit);
            }
            else{
                resHours -= workBlockLength - maxCut; 
            }
            resHours -= 2*t;
            resHours -= remoteMeetingsHome;
        }
    }

    std::cout << resHours;

    delete[] savedHours;
    delete[] duties;
    return 0;



}