zoukankan      html  css  js  c++  java
  • 完全背包 cf302div2 C

    C. Writing Code
    time limit per test3 seconds
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.

    Let’s call a sequence of non-negative integers v1, v2, …, vn a plan, if v1 + v2 + … + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let’s call a plan good, if all the written lines of the task contain at most b bugs in total.

    Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.

    Input
    The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.

    The next line contains n space-separated integers a1, a2, …, an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.

    Output
    Print a single integer — the answer to the problem modulo mod.

    Examples
    input
    3 3 3 100
    1 1 1
    output
    10
    input
    3 6 5 1000000007
    1 2 3
    output
    0
    input
    3 5 6 11
    1 2 1
    output
    0

    题意:有n个程序员需要完成m行代码,第i个程序员每行有v[i]个bug,要求最多有b个bug,输出有多少种计划。
    dp[i][j]表示第i行有j个bug的数目
    状态转移方程 dp[i][j]=dp[i][j]+dp[i-1][j-v[k]]

    /* ***********************************************
    Author        :letter-song
    Created Time  :2018/2/6 18:14:13
    File Name     :cf302.cpp
    ************************************************ */
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <stack>
    #include <cmath>
    #include <cstdlib>
    #include <vector>
    #include <queue>
    #include <set>
    #include <map>
    using namespace std;
    
    #define lson o<<1,l,m
    #define rson o<<1|1,m+1,r
    #define pii pair<int,int>
    #define mp make_pair
    #define ll long long
    #define INF 0x3f3f3f3f
    int v[505],dp[505][505];
    int main()
    {
        std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        //freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
        int n,m,b,mod;
        cin>>n>>m>>b>>mod;
        for(int i=0;i<n;i++)
          cin>>v[i];
        dp[0][0]=1;
        for(int i=0;i<n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                for(int k=v[i];k<=b;k++)
                {
                    dp[j][k]=(dp[j][k]+dp[j-1][k-v[i]])%mod;
                }
            }
        }
        ll ans=0;
        for(int i=0;i<=b;i++)
            ans=(ans+dp[m][i])%mod;
        cout<<ans<<endl;
        return 0;
    }
  • 相关阅读:
    Bayan 2015 Contest Warm Up D. CGCDSSQ 暴力
    Codeforces Round #361 (Div. 2) D. Friends and Subsequences RMQ+二分
    Educational Codeforces Round 21 D. Array Division 前缀和
    Educational Codeforces Round 23 E. Choosing The Commander Trie
    Educational Codeforces Round 23 D. Imbalanced Array 单调栈
    Codeforces Round #421 (Div. 1) B. Mister B and PR Shifts 模拟
    Educational Codeforces Round 24 E. Card Game Again 二分+线段树
    Educational Codeforces Round 25 E. Minimal Labels 优先队列
    Codeforces Round #426 (Div. 1) B. The Bakery DP+线段树
    Codeforces Round #407 (Div. 1) C. The Great Mixing 背包DP+Bitset
  • 原文地址:https://www.cnblogs.com/acagain/p/9180718.html
Copyright © 2011-2022 走看看