Language: C++

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <unordered_map>

using namespace std;

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define PB push_back
#define MP make_pair
#define ll long long
#define MOD 1000000007
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}

int main(){
    std::ios::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    int cur = 0;
    int nxt = 1;

    unordered_map<pair<int,pair<int, int>>, ll> states[2];
    
    // First is blue
    states[cur][MP(1,MP(1, 1))] = 1;

    if (n > k)
    {
        states[cur][MP(0,MP(0, 0))] = 1;
    }
    else
    {
        states[cur][MP(0, MP(0,0))] = 0;
    }
    for(int i=0;i<n-1;++i)
    {
        for( const auto &state : states[cur]) {
            // add Blue at the end
            int blue_cnt = state.first.first;
            int last_color = state.first.second.first;
            int current_ops = state.first.second.second;
            int value = state.second;

            if(blue_cnt == k) {
                // no more blue, add red
                states[nxt][MP(blue_cnt, MP(0, current_ops))] += value % MOD;
                states[nxt][MP(blue_cnt, MP(0, current_ops))] %= MOD;
            }
            else if((i + 1 - blue_cnt) >= (n - k)) 
            {
                // no more red, add blue
                if(last_color == 1)
                {
                    //continuous blue
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops))] += value % MOD;
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops))] %= MOD;
                }
                else
                {
                    // new blue
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops + 1))] += value % MOD;
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops + 1))] %= MOD;
                }
            }
            else
            {
                // add red
                states[nxt][MP(blue_cnt, MP(0, current_ops))] += value % MOD;
                states[nxt][MP(blue_cnt, MP(0, current_ops))] %= MOD;

                if(last_color == 1)
                {
                    //continuous blue
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops))] += value % MOD;
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops))] %= MOD;
                }
                else
                {
                    // new blue
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops + 1))] += value % MOD;
                    states[nxt][MP(blue_cnt + 1, MP(1, current_ops + 1))] %= MOD;
                }
            }
        }

        states[cur].clear();
        if(cur == 0)
        {
            cur = 1;
            nxt = 0;
        }
        else
        {
            cur = 0;
            nxt = 1;
        }
    }

    ll ret[k+1] = {};
    for(const auto &state : states[cur]) 
    {
        int current_ops = state.first.second.second;
        int value = state.second;

        ret[current_ops] += value % MOD;
        ret[current_ops] %= MOD;
    }

    for(int i=1;i<=k;++i)
    {
        cout << ret[i] << endl;
    }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:42:57: error: use of deleted function 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::pair<int, std::pair<int, int> >; _Tp = long long int; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _Pred = std::equal_to<std::pair<int, std::pair<int, int> > >; _Alloc = std::allocator<std::pair<const std::pair<int, std::pair<int, int> >, long long int> >]'
   42 |     unordered_map<pair<int,pair<int, int>>, ll> states[2];
      |                                                         ^
In file included from /usr/include/c++/14/unordered_map:41,
                 from /usr/include/c++/14/functional:63,
                 from a.cc:10:
/usr/include/c++/14/bits/unordered_map.h:148:7: note: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::pair<int, std::pair<int, int> >; _Tp = long long int; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _Pred = std::equal_to<std::pair<int, std::pair<int, int> > >; _Alloc = std::allocator<std::pair<const std::pair<int, std::pair<int, int> >, long long int> >]' is implicitly deleted because the default definition would be ill-formed:
  148 |       unordered_map() = default;
      |       ^~~~~~~~~~~~~
/usr/include/c++/14/bits/unordered_map.h: At global scope:
/usr/include/c++/14/bits/unordered_map.h:148:7: error: use of deleted function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::pair<int, std::pair<int, int> >; _Value = std::pair<const std::pair<int, std::pair<int, int> >, long long int>; _Alloc = std::allocator<std::pair<const std::pair<int, std::pair<int, int> >, long long int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::pair<int, std::pair<int, int> > >; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/14/bits/unordered_map.h:33:
/usr/include/c++/14/bits/hashtable.h:539:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::pair<int, std::pair<int, int> >; _Value = std::pair<const std::pair<int, std::pair<int, int> >, long long int>; _Alloc = std::allocator<std::pair<const std::pair<int, std::pair<int, int> >, long long int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::pair<int, std::pair<int, int> > >; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
  539 |       _Hashtable() = default;
      |       ^~~~~~~~~~
/usr/include/c++/14/bits/hashtable.h:539:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::pair<int, std::pair<int, int> >; _Value = std::pair<const std::pair<int, std::pair<int, int> >, long long int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::pair<int, std::pair<int, int> > >; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/14/bits/hashtable.h:35:
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::pair<int, std::pair<int, int> >; _Value = std::pair<const std::pair<int, std::pair<int, int> >, long long int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::pair<int, std::pair<int, int> > >; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
 1731 |       _Hashtable_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: error: use of deleted function 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::pair<int, std::pair<int, int> >; _Value = std::pair<const std::pair<int, std::pair<int, int> >, long long int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]'
/usr/include/c++/14/bits/hashtable_policy.h: In instantiation of 'std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::pair<int, std::pair<int, int> > >]':
/usr/include/c++/14/bits/hashtable_policy.h:1328:7:   required from here
 1328 |       _Hash_code_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1245:49: error: use of deleted function 'std::hash<std::pair<int, std::pair<int, int> > >::hash()'
 1245 |       _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
      |                                                 ^~~~~
In file included from /usr/include/c++/14/bits/stl_bvector.h:65,
                 from /usr/include/c++/14/vector:67,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:102:12: note: 'std::hash<std::pair<int, std::pair<int, int> > >::hash()' is implicitly deleted because the default definition would be ill-formed:
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/14/bits/functional_hash.h:102:12: error: no matching function for call to 'std::__hash_enum<std::pair<int, std::pair<int, int> >, false>::__hash_enum()'
/usr/include/c++/14/bits/functional_hash.h:83:7: note: candidate: 'std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::pair<int, std::pair<int, int> >; bool <anonymous> = false]'
   83 |       __hash_enum(__hash_enum&&);
      |       ^~~~~~~~~~~
/usr/include/c++/14/bits/functional_hash.h:83:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/14/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::pair<int, std::pair<int, int> >; bool <anonymous> = false]' is private within this context
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/14/bits/functional_hash.h:84:7: note: declared private here
   84 |       ~__hash_enum();
      |       ^
/usr/include/c++/14/bits/hashtable_policy.h:1245:49: note: use '-fdiagnostics-all-candidates' to display considered candidates
 1245 |       _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
      |                                                 ^~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::pair<int, std::pair<int, int> >; _Value = std::pair<const std::pair<int, std::pair<int, int> >, long long int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::pair<int, std::pair<int, int> > >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]' is implicitly deleted because the default definition would be ill-formed:
 1328 |       _Hash_code_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::pair<int, std::pair<int, int> > >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/14/bits/hashtable_policy.h:1242:12: note: 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::pair<int, std::pair<int, int> > >, true>::~_Hashtable_ebo_helper()' is implicitly deleted because the default definition would be ill-formed:
 1242 |     struct _Hashtable_ebo_helper<_Nm, _Tp, true>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1242:12: error: use of deleted function 'std::hash<std::pair<int, std::pair<int, int> > >::~hash()'
/usr/include/c++/14/bits/functional_hash.h:102:12: note: 'std::hash<std::pair<int, std::pair<int, int> > >::~hash()' is implicitly deleted because the default definition would be ill-formed:
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/14/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::pair<int, std::pair<int, int> >; bool <anonymous> = false]' is private within this context
/usr/include/c++/14/bits/functional_hash.h:84:7: note: declared private here
   84 |       ~__hash_enum();
      |       ^
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: note: use '-fdiagnostics-all-candidates' to display considered candidates
 1731 |       _Hashtable_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: error: use of deleted function 'std::__detail::_Hash_code_base<std::pair<int, std::pair<int, int> >, std::pair<const std::pair<int, std::pair<int, int> >, long long int>, std::__detail::_Select1st, std::hash<std::pair<int, std::pair<int, int> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
/usr/include/c++/14/bits/hashtable_policy.h:1306:12: note: 'std::__detail::_Hash_code_base<std::pair<int, std::pair<int, int> >, std::pair<const std::pair<int, std::pair<