CodeForces 550B Preparing Olympiad(dfs暴搜)
来源:互联网 发布:近期网络流行歌曲 编辑:程序博客网 时间:2024/06/15 08:28
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
2
Input
4 40 50 10
10 20 30 25
Output
2
Input
5 25 35 10
10 10 20 10 20
Output
6
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;}
- CodeForces 550B Preparing Olympiad(dfs暴搜)
- codeforces 550B Preparing Olympiad(DFS+回溯)
- CodeForces 550B Preparing Olympiad 简单DFS
- CodeForces 550B Preparing Olympiad 暴搜
- CodeForces 550B Preparing Olympiad
- codeforces-550B-Preparing Olympiad
- codeforces 550B Preparing Olympiad
- Preparing Olympiad CodeForces - 550B
- 【codeforces 550B】Preparing Olympiad
- CodeForces 550B Preparing Olympiad(DFS回溯+暴力枚举)
- Codeforces Round 306 B Preparing Olympiad(简单dfs)
- CodeForces 550B Preparing Olympiad(状态压缩,暴搜)
- codeforces 550B Preparing Olympiad(枚举)
- Codeforces Round #306 (Div. 2) B. Preparing Olympiad dfs
- codeforces #306 550B B. Preparing Olympiad(位压缩枚举)
- codeforces 306 div.2 B. Preparing Olympiad
- dfs Preparing Olympiad
- B. Preparing Olympiad
- 安卓实现两个Tablehost的嵌套
- Light oj 1138 - Trailing Zeroes (III) 【二分查找好题】【 给出N!末尾有连续的Q个0,让你求最小的N】
- 在Parallels Desktop中安装Win7虚拟机
- HDU 5319模拟
- 黑马程序员——多线程
- CodeForces 550B Preparing Olympiad(dfs暴搜)
- 点击空白键盘消失方法
- 一“字”之差,谈GPS与GPRS的区别与联系
- HDOJ 2141 Can you find it? (合并&&二分)
- Asp.net+MVC
- 使用JWPlayer在网页中嵌入视频
- poj 1860 Currency Exchange
- Eclipse使用技巧
- day1: Objective-C概述、面向对象编程、类和对象、实例变量操作