[nk] 牛客xb月赛43 E 满意的集合

前言

传送门 :

思路

不知道,待补

Mycode

// Problem: 满意的集合
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/11220/E
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//��һ�δ��Ϻ�վ֮�� ��Ϊʹ��#define int long long TLE���¿��˺ܾõ�ʱ�� ���˼���ģ��
//����ʹ�ø��ӵ�ģ��

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);

#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()
#define Fup(i,a,b) for(int i=a;i<=b;i++)
#define Fde(i,a,b) for(int i=a;i>=b;i--)

typedef priority_queue<int,vector<int>,greater<int>>  Pri_m;
typedef pair<int,int> pii;
typedef vector<int> VI;
map<int,int> mp;

const int N  = 10,mod = 1e9+7;

ll dp[10][4];
ll a[N];


void solve()
{
	for(int i=1;i<=9;i++){
		cin>>a[i];
	}
	
	
	dp[0][0] =1 ;
	//前i种数 %3为j的方案数
	
	for(int i=1;i<=9;i++){
		for(int  j = 0;j<3;j++ ){
			for(int k = 0;k<=min(a[i],2*1ll); k ++ ){
				int l = (j+k*i)%3;
				int num = a[i]/3 + (a[i]%3 >=k);
				dp[i][l] = (dp[i][l] + dp[i-1][j]*num)%mod;
			}
			
		}
	}
	
	cout<<dp[9][0]<<endl;
	
}
/**mYHeart is my algorithm**/
/**�㷨��˼ά�ij���**/
/**WA�˾�˵���Լ���˼ά�д�����**/
/**�ٱ�Թ������,�ද��**/
int main()
{
    //int t;cin>>t;while(t -- )
    solve();
    return 0;
}