题意及思路:https://www.cnblogs.com/Als123/p/11061147.html

代码:

#include <bits/stdc++.h>
#define LL long long
#define INF 0x3f3f3f3f
#define db double
#define pii pair<int, int>
using namespace std;
const LL mod = 1e9 + 7;
LL mul(LL x, LL y) {
return ((LL)x * y) % mod;
}
LL add(LL x, LL y) {
return ((LL)x + y) % mod;
}
LL dp[55][55][55][3], sum[55][55][55], ssum[3];
LL f[3][55][2505], jc[55], f1[55][55][2505];
vector<int> a[3];
int n, m;
LL ans = 0;
void init(int x) {
jc[0] = 1;
for (int i = 1; i <= x; i++) {
jc[i] = mul(jc[i - 1], i);
}
dp[1][0][0][0] = dp[0][1][0][1] = dp[0][0][1][2] = 1;
for (int i = 0; i <= x; i++)
for (int j = 0; j <= x; j++)
for (int k = 0; k <= x; k++) {
for (int t = 0; t < 3; t++) {
if(t != 0) dp[i + 1][j][k][0] += dp[i][j][k][t];
if(t != 1) dp[i][j + 1][k][1] += dp[i][j][k][t];
if(t != 2) dp[i][j][k + 1][2] += dp[i][j][k][t];
}
sum[i][j][k] = mul(mul(jc[i], mul(jc[j], jc[k])), add(add(dp[i][j][k][0], dp[i][j][k][1]), dp[i][j][k][2]));
}
}
void init1() {
for (int flag = 0; flag < 3; flag++) {
f[flag][0][0] = 1;
for (int i = 0; i < a[flag].size(); i++)
for (int j = i + 1; j >= 1; j--)
for (int k = ssum[flag]; k >= a[flag][i]; k--)
f[flag][j][k] = add(f[flag][j][k], f[flag][j - 1][k - a[flag][i]]);
}
for (int i = 0; i <= a[0].size(); i++)
for (int j = 0; j <= a[1].size(); j++)
for (int k = 0; k <= ssum[0]; k++) {
for (int t = 0; t <= ssum[1]; t++) {
f1[i][j][k + t] = add(f1[i][j][k + t], mul(f[0][i][k], f[1][j][t]));
}
}
}
void solve() {
for (int i = 0; i <= a[2].size(); i++)
for (int j = 0; j <= a[0].size(); j++)
for (int k = 0; k <= a[1].size(); k++) {
for (int t = 0; t <= ssum[2]; t++) {
int tmp1 = m - t;
ans = add(ans, mul(sum[j][k][i], mul(f1[j][k][tmp1], f[2][i][t])));
}
}
printf("%lld\n", ans);
}
int main() {
int t, x;
init(50);
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &t, &x);
a[x - 1].push_back(t);
ssum[x - 1] += t;
}
if(a[0].size() > a[2].size()) {
swap(a[0], a[2]);
swap(ssum[0], ssum[2]);
}
if(a[1].size() > a[2].size()) {
swap(a[1], a[2]);
swap(ssum[1], ssum[2]);
}
init1();
solve();
}

  

Codeforces 1185G2 Playlist for Polycarp (hard version) 背包,暴力的更多相关文章

  1. Codeforces Round #568 (Div. 2) G1. Playlist for Polycarp (easy version) (状压dp)

    题目:http://codeforces.com/contest/1185/problem/G1 题意:给你n给选项,每个选项有个类型和价值,让你选择一个序列,价值和为m,要求连续的不能有两个相同的类 ...

  2. Codeforces Round #568 (Div. 2) G2. Playlist for Polycarp (hard version)

    因为不会打公式,随意就先将就一下? #include<cstdio> #include<algorithm> #include<iostream> #include ...

  3. Codeforces 1108E2 Array and Segments (Hard version) 差分, 暴力

    Codeforces 1108E2 E2. Array and Segments (Hard version) Description: The only difference between eas ...

  4. CodeForces - 632E Thief in a Shop 完全背包

    632E:http://codeforces.com/problemset/problem/632/E 参考:https://blog.csdn.net/qq_21057881/article/det ...

  5. Codeforces A. Playlist(暴力剪枝)

    题目描述: Playlist time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu ...

  6. Codeforces 1442D - Sum(找性质+分治+背包)

    Codeforces 题面传送门 & 洛谷题面传送门 智商掉线/ll 本来以为是个奇怪的反悔贪心,然后便一直往反悔贪心的方向想就没想出来,看了题解才发现是个 nb 结论题. Conclusio ...

  7. Codeforces Round #383 (Div. 2) D 分组背包

    给出一群女孩的重量和颜值 和她们的朋友关系 现在有一个舞台 ab是朋友 bc是朋友 ac就是朋友 给出最大承重 可以邀请这些女孩来玩 对于每一个朋友团体 全邀请or邀请一个or不邀请 问能邀请的女孩的 ...

  8. Codeforces 1108E2 Array and Segments (Hard version)(差分+思维)

    题目链接:Array and Segments (Hard version) 题意:给定一个长度为n的序列,m个区间,从m个区间内选择一些区间内的数都减一,使得整个序列的最大值减最小值最大. 题解:利 ...

  9. Codeforces 1077F2 Pictures with Kittens (hard version)(DP+单调队列优化)

    题目链接:Pictures with Kittens (hard version) 题意:给定n长度的数字序列ai,求从中选出x个满足任意k长度区间都至少有一个被选到的最大和. 题解:数据量5000, ...

随机推荐

  1. Center os6.5设置静态ip

    DEVICE="eth0"BOOTPROTO=staticHWADDR="00:0C:29:95:89:35"IPV6INIT="yes"N ...

  2. spark的知识的链接

    IDEA 创建scala spark的Mvn项目:https://blog.csdn.net/u014646662/article/details/84618032 Spark详解03Job 物理执行 ...

  3. Debian取消从光盘安装软件的方式(please insert the disc labeled)

    与Ubuntu不同,使用apt-get install packages时Debian可能会提示: Media change: please insert the disc labeled 'Debi ...

  4. python的main函数

    代码示例:test.py import sys if __name__ == '__main__' size = len(sys.argv) p1 = sys.argv[] p2 = sys.argv ...

  5. 使用DMA方式发送串口数据

    一.初始化部分代码 //串口接收DMA缓存 uint8_t Uart_Rx[UART_RX_LEN] = {}; uint32_t Uart_Send_Buffer[] = {}; void USAR ...

  6. paper 157:文章解读--How far are we from solving the 2D & 3D Face Alignment problem?-(and a dataset of 230,000 3D facial landmarks)

    文章:How far are we from solving the 2D & 3D Face Alignment problem?-(and a dataset of 230,000 3D ...

  7. [CSP-S模拟测试]:壕游戏(费用流)

    题目传送门(内部题18) 输入格式 第一行包括四个数$n,m,k,s$表示有$n$个剧情点,$m$个关卡,要玩$k$次游戏,$s$个完结点接下来一行包含$s$个数,代表$s$个完结点的编号.接下来$m ...

  8. Navicat for Mysql 连接报错1251[已解决]

    因为mysql是8.0.11的版本,比较新的mysql采用新的保密方式所以旧的修改密码的方式似乎不能用, 新版本改密码方式: use mysql; ALTER USER 'root'@'localho ...

  9. (60)c# com com+ dcom

    一.创建COM组件 1.创建项目 2.设置使程序集可见 AssemblyInfo.cs中flase改为ture 或者 项目属性 设置可见 3.Guid生成器 在开始程序下能够找到Guid生成器 每次都 ...

  10. 3天教你掌握Python必备常用英语词汇

    第一天 path [ pɑ:θ ] 路径 unexpected [ˌʌnɪkˈspektɪd] 不期望的 class [klɑ:s] 类 usage [ˈju:sɪdʒ] 使用 public ['p ...