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
// Bartłomiej Sitnik

#include <iostream>
#include <vector>
#include <list>
#include <string>

using namespace std;

struct state {
  int pominiete;
  int porobione;
  bool wpracy;
};

class moving_queue {
  std::vector<list<state>> memory;
  public:
    moving_queue(){
      memory.push_back(list<state>());
      memory[0] = list<state>();
      memory[0].push_back({0, 0, false});
    }
    list<state>& operator[] (int i) {
      return memory[i];
    }

    void move_queue() {
      memory.push_back(std::move(memory[memory.size() - 1]));
      for (int i = memory.size() - 2; i > 0; i--) {
        memory[i] = std::move(memory[i - 1]);
      }
      memory[0] = list<state>();
    }
    void drop_last() {memory.pop_back();}
    unsigned int size() {return memory.size();}
};

int main()
{
  string s;
  int n, k, t;
  cin >> n >> k >> t;
  cin >> s;

  moving_queue queue;
  unsigned int historia_pracy = 0;

  for(int i = 0; i < n; i++) {
    queue.move_queue();
    for (auto sit : queue[1]) {
      state situation = sit;
      switch (s[i])
      {
        case '1':
        {
          if (situation.wpracy == true) {
            queue[0].push_back(situation);
          }
          else if (situation.pominiete < k){
            situation.pominiete++;
            situation.porobione++;
            queue[0].push_back(situation);
          }
          break;
        }
        case '2':
        {
          queue[0].push_back(situation);
          if (situation.wpracy == false and situation.pominiete < k) {
            situation.pominiete++;
            situation.porobione++;
            queue[0].push_back(situation);
          }
          break;
        }
        default:
        case '3':
        {
          if (situation.wpracy == false)
            situation.porobione++;

          queue[0].push_back(situation);
          break;
        }
      }
    }
    // update historii pracy
    switch (s[i])
    {
      case '1':
      {
        historia_pracy++;
        break;
      }
      case '2':
      {
        historia_pracy++;
        break;
      }
      default:
      case '3':
      {
        break;
      }
    }
    if (i-t >= 0) {
      switch (s[i-t])
      {
        case '1':
        {
          historia_pracy--;
          break;
        }
        case '2':
        {
          historia_pracy--;
          break;
        }
        default:
        case '3':
        {
          break;
        }
      }
    }
    if (queue.size() > t) {
      // podróże z i do pracy
      for (auto sit : queue[t]) {
        state situation = sit;
        situation.pominiete += historia_pracy;
        situation.wpracy = !situation.wpracy;
        if (situation.pominiete <= k)
          queue[0].push_back(situation);
      }
      queue.drop_last();
    }
  }
  int ans = -1;
  for (auto sit : queue[0]) {
    if (!sit.wpracy and sit.porobione > ans)
      ans = sit.porobione;
  }
  std::cout << ans;
}