codeforce B. Preparing Olympiad (DFS+回溯)/(暴力状压)
2015-12-16 14:21
218 查看
http://codeforces.com/contest/550/problem/B
B. Preparing Olympiad
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
output
input
output
input
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.
给出n个数,从这n个数中选出至少两个数,是他们的和再l和r之间,并且这些数中的最大值与最小值的差值不小于x
DFS
状态压缩
B. Preparing Olympiad
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.
给出n个数,从这n个数中选出至少两个数,是他们的和再l和r之间,并且这些数中的最大值与最小值的差值不小于x
DFS
#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> #include <cmath> #include <cstdlib> #include <limits> #include <queue> #include <stack> #include <vector> #include <map> using namespace std; typedef long long LL; #define N 810 #define INF 0x3f3f3f3f #define PI acos (-1.0) #define EPS 1e-5 #define MOD 10007 #define met(a, b) memset (a, b, sizeof (a)) int n, l, r, x, ans, data ; void DFS (int sa, int en, int cnt, int sum) { if (sum >= l && sum <= r && (data[en]-data[sa]) >= x) ans++; for (int i=en+1; i<n; i++) DFS (sa, i, cnt+1, sum+data[i]); return; } int main () { while (scanf ("%d %d %d %d", &n, &l, &r, &x) != EOF) { ans = 0; met (data, 0); for (int i=0; i<n; i++) scanf ("%d", &data[i]); sort (data, data+n); for (int i=0; i<n; i++) DFS (i, i, 0, data[i]); printf ("%d\n", ans); } return 0; }
状态压缩
#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> #include <cmath> #include <cstdlib> #include <limits> #include <queue> #include <stack> #include <vector> #include <map> using namespace std; typedef long long LL; #define N 810 #define INF 0x3f3f3f3f #define PI acos (-1.0) #define EPS 1e-5 #define MOD 10007 #define met(a, b) memset (a, b, sizeof (a)) int n, l, r, x, ans, data ; int main () { while (scanf ("%d %d %d %d", &n, &l, &r, &x) != EOF) { met (data, 0); for (int i=0; i<n; i++) scanf ("%d", &data[i]); int Lim = (1<<n)-1, ans = 0; for (int i=1; i<=Lim; i++) { int minx = INF, maxn = -INF, sum = 0; for (int j=0; j<n; j++) { if (i & (1<<j)) { sum += data[j]; minx = min (minx, data[j]); maxn = max (maxn, data[j]); } } if (sum >= l && sum <= r && (maxn-minx) >= x) ans++; } printf ("%d\n", ans); } return 0; }
相关文章推荐
- oracle的主要进程
- 关于对ProgressBar定义模板的一些总结
- HQL语句详解
- mysql同时删除多张开头相同的表
- ramdisk.img和system.img解压
- android调用系统相机,获取照片的适配性问题
- Eclipse 常用快捷键 (动画讲解)(转载)
- ASN.1编码
- UI11-源代码管理工具概述
- JS内部对象(window,navigator)
- Maven_POM配置结构
- 数据库设计规范
- 内建模块:sys os
- cocos2d 中文显示问题解决
- Android与服务器端通信时 部分中文出现乱码
- Git简介
- 使用异步Servlet改进应用性能
- 实现输出h264直播流的rtmp服务器
- [leetcode] 221. Maximal Square 解题报告
- 创建quickstart报错