hdu 5548 Mahjong ccpc 2015（dp 套 dp）

最新推荐文章于 2023-02-27 11:02:54 发布

原创

最新推荐文章于 2023-02-27 11:02:54 发布 · 695 阅读

1 ·

CC 4.0 BY-SA版权

The problem asks for the number of unique ways to form a winning mahjong hand with k different types of tiles, each having 4 copies, when m tiles are drawn. It's a dynamic programming (dp) problem from CCPC 2015." 134275130,15843461,结构正则化深度聚类在无监督域适应中的应用,"['机器学习', '深度学习', '无监督学习', '聚类算法', '域适应']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意：k类麻将牌，没类4张，抽取m张胡牌的方案有多少种，方案不同指抽取的k张牌不同

http://acm.hdu.edu.cn/showproblem.php?pid=5548

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>

using namespace std;


#define N (300010)
#define M (2000020) 
#define LL long long
#define ULL unsigned long long
#define eps 1e-8
#define pii pair<int, int> 
#define MP make_pair
#define ls (i<<1)
#define rs (i<<1|1)
#define md (ll+rr>>1)
#define lson ll, md, ls
#define rson md+1, rr, rs
#define mod 1000000007
#define DEBUG 0

int g[M][5];
int dp[202][202][200];
int ans[202][202];
int tot;
bool mark[200];
int id[N];
map<LL, int> mp;

int get_id(LL st) {
	if(!mp.count(st)) mp[st] = tot++;
	return mp[st];
}
int code(int a, int b, int c) {