arc058 E - Iroha and Haiku

考察第一次出现可行位置，会发现相当于这个位置前有一段后缀和Z,一段后缀和Y + Z, 一段后缀和X + Y + Z,而发现X + Y+ Z非常小，可以用状压dp，状压sta的第i位为1则表示当前存在后缀和为i，每次转移到可行状态就统计答案并不再往后转移，否则继续转移下去。

复杂度n * 2^(17) * 10

#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define sc second
#define pb push_back
#define ll long long
#define trav(v,x) for(auto v:x)
#define all(x) (x).begin(), (x).end()
#define VI vector<int>
#define VLL vector<ll>
#define pll pair<ll, ll>
#define double long double
//#define int long long
using namespace std;
const int N = 1e6 + 100;
const int inf = 1e9;
//const ll inf = 1e18;
const ll mod = 1e9 + 7;

#ifdef LOCAL
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
	cerr << " " << to_string(H);
	debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

void sol()
{
	int n, A, B, C;
	cin >> n >> A >> B >> C;
//	--A, --B, --C;
	int ok = (1 << C - 1) | (1 << B + C - 1) | (1 << A + B + C - 1);
	VLL pw(n + 1);
	pw[0] = 1;
	for(int i = 1; i <= n; i++)
		pw[i] = pw[i - 1] * 10 % mod;
	int lim = (1 << A + B + C);
	VLL nw(lim, 0), nxt(lim, 0);
	nw[0] = 1;
	ll ans = 0;
	for(int i = 1; i <= n; i++)
	{
		fill(all(nxt), 0);
		for(ll sta = 0; sta < lim; sta++)
		{
			if(!nw[sta])
				continue;
			for(int j = 1; j <= 10; j++)
			{
				int nsta;
				nsta = sta << j | (1 << j - 1);
				nsta = nsta & (lim - 1);
				//cerr << sta << ' ' << j << ' ' << nsta << '\n';
				if((nsta & ok) == ok)
					ans = (ans + pw[n - i] * nw[sta]) % mod;
				else
					nxt[nsta] = (nxt[nsta] + nw[sta]) % mod;
			}
		}
		nw = nxt;
	}
	cout << ans << '\n';
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
//	int tt;
//	cin >> tt;
//	while(tt--)
		sol();
}