码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 4334 Trouble

时间:2014-07-09 15:20:30      阅读:108      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   http   java   color   

Trouble

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4375    Accepted Submission(s): 1297


Problem Description
Hassan is in trouble. His mathematics teacher has given him a very difficult problem called 5-sum. Please help him.
The 5-sum problem is defined as follows: Given 5 sets S_1,...,S_5 of n integer numbers each, is there a_1 in S_1,...,a_5 in S_5 such that a_1+...+a_5=0?
 

 

Input
First line of input contains a single integer N (1≤N≤50). N test-cases follow. First line of each test-case contains a single integer n (1<=n<=200). 5 lines follow each containing n integer numbers in range [-10^15, 1 0^15]. I-th line denotes set S_i for 1<=i<=5.
 

 

Output
For each test-case output "Yes" (without quotes) if there are a_1 in S_1,...,a_5 in S_5 such that a_1+...+a_5=0, otherwise output "No".
 

 

Sample Input
2
2
1 -1
1 -1
1 -1
1 -1
1 -1
3
1 2 3
-1 -2 -3
4 5 6
-1 3 2
-4 -10 -1
 

 

Sample Output
No
Yes
 
 
bubuko.com,布布扣
 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <algorithm>
 4 #include <string.h>
 5 #include <set>
 6 using namespace std;
 7 #define ll long long
 8 ll a[5][300],s1[90000],s2[90000],s3[90000],sn1,sn2,sn3;
 9 int main()
10 {
11     int n,t,i,j,k;
12     cin>>t;
13     while(t--)
14     {
15         cin>>n;
16         for(i=0; i<5; i++)
17             for(j=0; j<n; j++)
18                 scanf("%I64d",&a[i][j]);
19         sn1=sn2=sn3=0;
20         for(i=0; i<n; i++)
21             for(j=0; j<n; j++)
22                 s1[sn1++]=a[0][i]+a[1][j];
23         for(i=0; i<n; i++)
24             for(j=0; j<n; j++)
25                 s2[sn2++]=a[2][i]+a[3][j];
26         for(i=0; i<n; i++)
27             s3[sn3++]=-a[4][i];
28         sort(s1,s1+sn1);
29         sort(s2,s2+sn2);
30         sort(s3,s3+sn3);
31         int ok=0;
32         for(i=0;!ok&&i<sn3;i++)
33         {
34             j=0,k=sn2-1;
35             while(j<sn1&&k>=0)
36             {
37                 if(s1[j]+s2[k]==s3[i])
38                 {
39                     ok=1;
40                     break;
41                 }
42                 while(j<sn1&&k>=0&&s1[j]+s2[k]>s3[i])k--;
43                 while(j<sn1&&k>=0&&s1[j]+s2[k]<s3[i])j++;
44             }
45         }
46         if(ok)printf("Yes\n");
47         else printf("No\n");
48     }
49 }
View Code

 

 
 

hdu 4334 Trouble,布布扣,bubuko.com

hdu 4334 Trouble

标签:des   style   blog   http   java   color   

原文地址:http://www.cnblogs.com/ERKE/p/3832288.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!