hdu 5937 Equation dfs
来源:互联网 发布:隔音耳罩 知乎 编辑:程序博客网 时间:2024/06/06 02:53
传送门
题意:输入c[1]~c[9]分别表示1~9这些数字的个数,现在用这些数字构成等式x+y=z(x,y,z都是个位的数字),等式不能相同(1+2=3与2+1=3不同),求最多能都成多少个等式?
做法:感觉x+y=z在1-9里面构成不会很多,事实也是如此,那么dfs是最好的选择了,不过有一个地方得剪枝。
if(num+36-xx<=ans) return ; 如果剩下的都不够更新答案了,那么就没必要再搜了
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-./// __.' ~. .~ `.__/// .'// \./ \\`./// .'// | \\`./// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`./// .'//.-" `-. | .-' "-.\\`./// .'//______.============-.. \ | / ..-============.______\\`./// .'______________________________\|/______________________________`.#pragma comment(linker, "/STACK:1024000000,1024000000")#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)#define S_1(x) scan_d(x)#define S_2(x,y) scan_d(x),scan_d(y)#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef long long LL;typedef pair <int, int> ii;const int INF=0x3f3f3f3f;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=1e5+10;const int maxx=4e5+10;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;struct node{ int x,y,z;}Q[50];int tot=0;void init(){ FOR(1,8,i) for(int j=1;i+j<=9;j++) Q[tot++]=(node){i,j,i+j};}int a[10],ans;void dfs(int xx,int num){ if(xx>=36) { ans=max(ans,num); return ; } if(num+36-xx<=ans) return ; int x=Q[xx].x,y=Q[xx].y,z=Q[xx].z; if(a[x]>0&&a[y]>0&&a[z]>0) { a[x]--;a[y]--;a[z]--; if(a[x]>=0&&a[y]>=0&&a[z]>=0) dfs(xx+1,num+1); a[x]++;a[y]++;a[z]++; } dfs(xx+1,num);}void solve(){ ans=0; FOR(1,9,i) { int x; S_1(x); a[i]=x; } dfs(0,0); print(ans);}int main(){ //freopen( "in.txt" , "r" , stdin ); //freopen( "data.txt" , "w" , stdout ); int t=1; init(); s_1(t); for(int cas=1;cas<=t;cas++) { printf("Case #%d: ",cas); solve(); }}
阅读全文
0 0
- hdu 5937 Equation dfs
- HDU-5937 Equation(暴力DFS+剪枝)
- HDU 5937 && 2016CCPC杭州 E: Equation(DFS)
- HDU 5937 Equation 【DFS+剪枝】 (2016年中国大学生程序设计竞赛(杭州))
- HDU5937 Equation 【DFS+剪枝】
- HDU 5185 Equation (DP)
- HDU-2675 Equation Again
- HDU 2675 Equation Again
- [数学+dfs] ZOJ 3753 Simple Equation
- UESTC - 1039 Fabricate equation (DFS&模拟)
- hdu 3270 The Diophantine Equation
- The Diophantine Equation hdu 3270
- HDU 3270 The Diophantine Equation
- 16杭州ccpc Equation HDU
- hdu 2675 Equation Again (二分)
- Equation
- Equation
- HDU DFS
- 几种磁盘阵列技术
- 2017.10.12 内存管理
- 把 Nginx 创建为 Windows 的一个服务
- Excel Sheet Column Number:有字母组成的26进制转换成10进制
- Caused by: java.lang.IllegalArgumentException: Parameter with that position [1] did not exist
- hdu 5937 Equation dfs
- 如何在win10(64位系统)上安装apache服务器
- SQLServer 语句
- 为什么要用到redis?
- android develop refer
- rsync实现站点更新
- 《重构网络:SDN架构与实现》第一章总结
- 破解练习
- 回归算法-最小二乘法及梯度下降