HDU4815

Little Tiger vs. Deep Monkey

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 1587    Accepted Submission(s): 566

Problem Description

A crowd of little animals is visiting a mysterious laboratory – The Deep Lab of SYSU.

“Are you surprised by the STS (speech to speech) technology of Microsoft Research and the cat face recognition project of Google and academia? Are you curious about what technology is behind those fantastic demos?” asks the director of the Deep Lab. “Deep learning, deep learning!” Little Tiger raises his hand briskly. “Yes, clever boy, that’s deep learning (深度学习/深度神经网络)”, says the director. “However, they are only ‘a piece of cake’. I won’t tell you a top secret that our lab has invented a Deep Monkey (深猴) with more advanced technology. And that guy is as smart as human!”

“Nani ?!” Little Tiger doubts about that as he is the smartest kid in his kindergarten; even so, he is not as smart as human, “how can a monkey be smarter than me? I will challenge him.”

To verify their research achievement, the researchers of the Deep Lab are going to host an intelligence test for Little Tiger and Deep Monkey.

The test is composed of N binary choice questions. And different questions may have different scores according to their difficulties. One can get the corresponding score for a question if he chooses the correct answer; otherwise, he gets nothing. The overall score is counted as the sum of scores one gets from each question. The one with a larger overall score wins; tie happens when they get the same score.

Little Tiger assumes that Deep Monkey will choose the answer randomly as he doesn’t believe the monkey is smart. Now, Little Tiger is wondering “what score should I get at least so that I will not lose in the contest with probability of at least P? ”. As little tiger is a really smart guy, he can evaluate the answer quickly.

You, Deep Monkey, can you work it out? Show your power!

 

Input

The first line of input contains a single integer T (1 ≤ T ≤ 10) indicating the number of test cases. Then T test cases follow.

Each test case is composed of two lines. The first line has two numbers N and P separated by a blank. N is an integer, satisfying 1 ≤ N ≤ 40. P is a floating number with at most 3 digits after the decimal point, and is in the range of [0, 1]. The second line has N numbers separated by blanks, which are the scores of each question. The score of each questions is an integer and in the range of [1, 1000]

 

Output

For each test case, output only a single line with the answer.

 

Sample Input

1
3 0.5
1 2 3

 

Sample Output

3

 

Source

2013 Asia Regional Changchun

 

Recommend

liuyiding

 

说白了就是个01背包，但是我场上竟然没推出来，大受打击，又把01背包整理了一遍，幸好队友给力。

#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define ll long long
#define _cle(m, a) memset(m, a, sizeof(m))
#define repu(i, a, b) for(int i = a; i < b; i++)
#define repd(i, a, b) for(int i = b; i >= a; i--)
#define sfi(n) scanf("%d", &n)
#define pfi(n) printf("%d\n", n)
#define pfl(n) printf("%I64d\n", n)
#define MAXN 600000

ll d[MAXN];
ll sum;
int s[];
int n;
double p;
double mm[];
void get_m()
{
    mm[] = 1.0;
    repu(i, , ) mm[i] = 2.0 * mm[i - ];
    return ;
}

void dp()
{
    memset(d, , sizeof(d));
    d[] = ;
    for(int i = ; i <= n; i++)
        for(int j = sum; j >= s[i]; j--)
               d[j] = d[j]+d[j-s[i]];
    return ;
}

int main()
{
    int T;
    sfi(T);
    get_m();
    while(T--)
    {
       sfi(n);
       scanf("%lf", &p);
       sum = ;
       repu(i, , n + ) { sfi(s[i]); sum += s[i];}
       dp();

       double num = 0.0;
       double monkey = (p * mm[n]);
       for(ll i = ; i <= sum; i++)
       {
           num += d[i];
           if(num >= monkey)
           {
               printf("%I64d\n", i);
               break;
           }
       }
    }
    return ;
}