Language: C++

// template version 1.13
using namespace std;
#include <bits/stdc++.h>

// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF=1e18;
const int MOD=1e9+7; //}}}

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define ceil(a,b) ((a)+(b)-1)/(b)
#define is_in(x, a, b) ((a)<=(x) && (x)<(b))
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}

struct SegmentTree {/*{{{*/
  private:
    int n;
    vector<pair<int, string>> node;

  public:
    SegmentTree(vector<pair<int, string>> a) {
      int sz = a.size();
      n = 1; while(n < sz) n *= 2;
      node.resize(2*n-1, mp(INF, ""));
      for(int i=0; i<sz; i++) node[i+n-1] = a[i];
      for(int i=n-2; i>=0; i--) node[i] = min(node[2*i+1], node[2*i+2]);
    }
    SegmentTree(int V) : SegmentTree(vector<pair<int, string>>(V, mp(INF, ""))) {}

    void update(int x, pair<int, int> val) {
      x += (n - 1);
      node[x] = val;
      while(x > 0) {
        x = (x - 1) / 2;
        node[x] = min(node[2*x+1], node[2*x+2]);
      }
    }

    // get min of [l, r)
    pair<int,int> getmin(int a, int b, int k=0, int l=0, int r=-1) {
      if(r < 0) r = n;
      if(r <= a || b <= l) return mp(INF, "");
      if(a <= l && r <= b) return node[k];

      int vl = getmin(a, b, 2*k+1, l, (l+r)/2);
      int vr = getmin(a, b, 2*k+2, (l+r)/2, r);
      return min(vl, vr);
    }
};/*}}}*/

int solve(){
  int n,m;cin>>n>>m;
  string s;cin>>s;
  dump(s);

  vector<pii> dp(n+1, INF);
  SegmentTree  sg(n+1);
  sg.update(0, 0);
  dp[0] = 0;

  rep(i, 1, n+1){
    if (s[i]=='1') continue;
    dump(i);

    dp[i] = sg.getmin(i-m, i)+1;
    sg.update(i, dp[i]);
  }
  dump(dp);

  int k = dp[n];

  vi ans;
  int cur = n;
  while (cur>0){
  }

  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}


Compiler output:
a.cc: In member function 'std::pair<long long int, long long int> SegmentTree::getmin(long long int, long long int, long long int, long long int, long long int)':
a.cc:23:27: error: could not convert 'std::make_pair<const long long int&, const char (&)[1]>(INF, "")' from 'pair<[...],const char*>' to 'pair<[...],long long int>'
   23 | #define mp(a, b) make_pair(a, b)
      |                  ~~~~~~~~~^~~~~~
      |                           |
      |                           pair<[...],const char*>
a.cc:81:35: note: in expansion of macro 'mp'
   81 |       if(r <= a || b <= l) return mp(INF, "");
      |                                   ^~
a.cc:82:41: error: could not convert '((SegmentTree*)this)->SegmentTree::node.std::vector<std::pair<long long int, std::__cxx11::basic_string<char> > >::operator[](((std::vector<std::pair<long long int, std::__cxx11::basic_string<char> > >::size_type)k))' from 'pair<[...],std::__cxx11::basic_string<char>>' to 'pair<[...],long long int>'
   82 |       if(a <= l && r <= b) return node[k];
      |                                         ^
      |                                         |
      |                                         pair<[...],std::__cxx11::basic_string<char>>
a.cc:84:22: error: cannot convert 'std::pair<long long int, long long int>' to 'long long int' in initialization
   84 |       int vl = getmin(a, b, 2*k+1, l, (l+r)/2);
      |                ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
      |                      |
      |                      std::pair<long long int, long long int>
a.cc:85:22: error: cannot convert 'std::pair<long long int, long long int>' to 'long long int' in initialization
   85 |       int vr = getmin(a, b, 2*k+2, (l+r)/2, r);
      |                ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
      |                      |
      |                      std::pair<long long int, long long int>
a.cc:86:17: error: could not convert 'std::min<long long int>(vl, vr)' from 'const long long int' to 'std::pair<long long int, long long int>'
   86 |       return min(vl, vr);
      |              ~~~^~~~~~~~
      |                 |
      |                 const long long int
a.cc: In function 'long long int solve()':
a.cc:95:26: error: no matching function for call to 'std::vector<std::pair<long long int, long long int> >::vector(long long int, const long long int&)'
   95 |   vector<pii> dp(n+1, INF);
      |                          ^
In file included from /usr/include/c++/14/vector:66,
                 from /usr/include/c++/14/functional:64,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:53,
                 from a.cc:3:
/usr/include/c++/14/bits/stl_vector.h:707:9: note: candidate: 'template<class _InputIterator, class> std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with <template-parameter-2-2> = _InputIterator; _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
  707 |         vector(_InputIterator __first, _InputIterator __last,
      |         ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:707:9: note:   template argument deduction/substitution failed:
In file included from /usr/include/c++/14/bits/stl_algobase.h:65,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_iterator_base_types.h: In substitution of 'template<class _InIter> using std::_RequireInputIter = std::__enable_if_t<((bool)std::is_convertible<typename std::iterator_traits< <template-parameter-1-1> >::iterator_category, std::input_iterator_tag>::value)> [with _InIter = long long int]':
/usr/include/c++/14/bits/stl_vector.h:705:9:   required from here
  705 |                typename = std::_RequireInputIter<_InputIterator>>
      |                ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator_base_types.h:252:57: error: no type named 'iterator_category' in 'struct std::iterator_traits<long long int>'
  252 |                                    input_iterator_tag>::value>;
      |                                                         ^~~~~
/usr/include/c++/14/bits/stl_vector.h:678:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::initializer_list<_Tp>, const allocator_type&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; allocator_type = std::allocator<std::pair<long long int, long long int> >]'
  678 |       vector(initializer_list<value_type> __l,
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:678:43: note:   no known conversion for argument 1 from 'long long int' to 'std::initializer_list<std::pair<long long int, long long int> >'
  678 |       vector(initializer_list<value_type> __l,
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:659:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, std::__type_identity_t<_Alloc>&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::__type_identity_t<_Alloc> = std::allocator<std::pair<long long int, long long int> >]'
  659 |       vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:659:23: note:   no known conversion for argument 1 from 'long long int' to 'std::vector<std::pair<long long int, long long int> >&&'
  659 |       vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
      |              ~~~~~~~~~^~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::false_type) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; allocator_type = std::allocator<std::pair<long long int, long long int> >; std::false_type = std::false_type]'
  640 |       vector(vector&& __rv, const allocator_type& __m, false_type)
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note:   candidate expects 3 arguments, 2 provided
/usr/include/c++/14/bits/stl_vector.h:635:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::true_type) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; allocator_type = std::allocator<std::pair<long long int, long long int> >; std::true_type = std::true_type]'
  635 |       vector(vector&& __rv, const allocator_type& __m, true_type) noexcept
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:635:7: note:   candidate expects 3 arguments, 2 provided
/usr/include/c++/14/bits/stl_vector.h:624:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&, std::__type_identity_t<_Alloc>&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::__type_identity_t<_Alloc> = std::allocator<std::pair<long long int, long long int> >]'
  624 |       vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:624:28: note:   no known conversion for argument 1 from 'long long int' to 'const std::vector<std::pair<long long int, long long int> >&'
  624 |       vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
      |              ~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:620:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
  620 |       vector(vector&&) noexcept = default;
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:620:7: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:601:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
  601 |       vector(const vector& __x)
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:601:7: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:569:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(size_type, const value_type&, const allocator_type&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; size_type = long unsigned int; value_type = std::pair<long long int, long long int>; allocator_type = std::allocator<std::pair<long long int, long long int> >]'
  569 |       vector(size_type __n, const value_type& __value,
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:569:47: note:   no known conversion for argument 2 from 'const long long int' to 'const std::vector<std::pair<long long int, long long int> >::value_type&' {aka 'const std::pair<long long int, long long int>&'}
  569 |       vector(size_type __n, const value_type& __value,
      |                             ~~~~~~~~~~~~~~~~~~^~~~~~~
/usr/include/c++/14/bits/stl_vector.h:556:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(size_type, const allocator_type&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; size_type = long unsigned int; allocator_type = std::allocator<std::pair<long long int, long long int> >]'
  556 |       vector(size_type __n, const allocator_type& __a = allocator_type())
      |       ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:556:51: note:   no known conversion for argument 2 from 'const long long int' to 'const std::vector<std::pair<long long int, long long int> >::allocator_type&' {aka 'const std::allocator<std::pair<long long int, long long int> >&'}
  556 |       vector(size_type __n, const allocator_type& __a = allocator_type())
      |                             ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:542:7: n