CodeForces 550B Preparing Olympiad(dfs暴搜）

最新推荐文章于 2016-10-30 17:32:40 发布

lengshien

最新推荐文章于 2016-10-30 17:32:40 发布

阅读量404

点赞数 1

分类专栏： ACM 文章标签： codeforces dfs 暴搜

本文链接：https://blog.csdn.net/lengshien/article/details/47812889

版权

ACM 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

本文介绍了一个关于选择合适难度的问题集参加比赛的算法问题。给定一系列不同难度的问题，需要从中挑选至少两个问题组成问题集，使得总难度介于特定范围，并且最简单和最难问题之间的难度差达到一定标准。通过深度优先搜索的方法来实现这一目标。

摘要由CSDN通过智能技术生成

B. Preparing Olympiad
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You have n problems. You have estimated the difficulty of the i-th one as integer ci. Now you want to prepare a problemset for a contest, using some of the problems you’ve made.

A problemset for the contest must consist of at least two problems. You think that the total difficulty of the problems of the contest must be at least l and at most r. Also, you think that the difference between difficulties of the easiest and the hardest of the chosen problems must be at least x.

Find the number of ways to choose a problemset for the contest.
Input

The first line contains four integers n, l, r, x (1 ≤ n ≤ 15, 1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ 106) — the number of problems you have, the minimum and maximum value of total difficulty of the problemset and the minimum difference in difficulty between the hardest problem in the pack and the easiest one, respectively.

The second line contains n integers c1, c2, …, cn (1 ≤ ci ≤ 106) — the difficulty of each problem.
Output

Print the number of ways to choose a suitable problemset for the contest.
Sample test(s)
Input

3 5 6 1
1 2 3

Output

Input

4 40 50 10
10 20 30 25

Output

Input

5 25 35 10
10 10 20 10 20

Output

Note

In the first example two sets are suitable, one consisting of the second and third problem, another one consisting of all three problems.

In the second example, two sets of problems are suitable — the set of problems with difficulties 10 and 30 as well as the set of problems with difficulties 20 and 30.

In the third example any set consisting of one problem of difficulty 10 and one problem of difficulty 20 is suitable.
分析：dfs（暴搜）

#include"cstdio"
#include"iostream"
#include"cstring"
#include"cmath"
#include"algorithm"
using namespace std;
int a[20];
int n,l,r,x;
int ans;
int cmp(int a,int b){
return a<b;
}
void dfs(int s,int e,int sum,int mark){
if(sum>r) return ;
if(sum>=l&&e-s>=x) ans++;
for(int i=mark;i<=n;i++){
    dfs(s,a[i],sum+a[i],i+1);
}
}
int main(){
ans=0;
cin>>n>>l>>r>>x;
for(int i=1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<n;i++){
        for(int j=i+1;j<=n;j++){
            dfs(a[i],a[j],a[i]+a[j],j+1);
        }
}
cout<<ans<<endl;
}