Can you find it?
来源:互联网 发布:蜜丝佛陀知乎 编辑:程序博客网 时间:2024/05/01 05:14
Can you find it?
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 10424 Accepted Submission(s): 2742
Problem Description
Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.
Input
There are many cases. Every data case is described as followed: In the first line there are three integers L, N, M, in the second line there are L integers represent the sequence A, in the third line there are N integers represent the sequences B, in the forth line there are M integers represent the sequence C. In the fifth line there is an integer S represents there are S integers X to be calculated. 1<=L, N, M<=500, 1<=S<=1000. all the integers are 32-integers.
Output
For each case, firstly you have to print the case number as the form "Case d:", then for the S queries, you calculate if the formula can be satisfied or not. If satisfied, you print "YES", otherwise print "NO".
Sample Input
3 3 31 2 31 2 31 2 331410
Sample Output
Case 1:NOYESNO
第一次二分,,尼玛刚开始写的很挫啊,,不过现在还好。。
#include<cstdio>#include<algorithm>using namespace std;int a[505],b[505],c[505],f[250010];int binary(int x,int M,int k){ for(int i=0; i<M; i++) { int l = 0, r = k; while(l <= r) { int mid = (l+r)/2; if(x > c[i]+f[mid]) l = mid+1; else if(x < c[i]+f[mid]) r = mid-1; else return 1; } } return 0;}int main(){ int L,N,M,i,j,s,t=1; while(~scanf("%d%d%d", &L,&N,&M)) { for(i=0; i<L; i++) scanf("%d", a+i); for(i=0; i<N; i++) scanf("%d", b+i); for(i=0; i<M; i++) scanf("%d", c+i); int k = 0; for(i=0; i<L; i++) for(j=0; j<N; j++) f[k++] = a[i]+b[j]; sort(f,f+k); scanf("%d", &s); printf("Case %d:\n", t++); while(s--) { int x; scanf("%d", &x); printf(binary(x,M,k-1) ? "YES\n" : "NO\n"); } } return 0;}
0 0
- can you find it?
- Can you find it?
- Can you find it?
- Can you find it?
- can you find it?
- Can you find it?
- can you find it?
- Can you find it?
- Can you find it?
- Can you find it?
- Can you find it?
- can you find it?
- Can you find it?
- Can you find it?
- Can you find it?
- HDU Can you find it?
- HDU2141 Can you find it?
- Can you find it?---二分
- Hsql 查询
- vc2008构建和使用libcurl静态库
- 归并排序 and 逆序对数(分治)
- Windows线程同步API
- Windows系统中的sshd服务器配置及ssh跳转实现
- Can you find it?
- VC版八皇后
- Windows线程同步之Slim读写锁(SRWLock)
- error LNK2019: 无法解析的外部符号 "char * __stdcall _com_util::ConvertBSTRToString(转)
- android自定义View实现图片的绘制、旋转、缩放
- TASK_INTERRUPTIBLE
- MFC 屏幕截图
- hdu 1198 并查集
- Ubuntu Sun JDK 安装