【ACM】Uva 1152 （4 Values whose Sum is 0）二分查找lower_bound() 和upper_bound()的使用

原创于 2018-12-08 18:35:22 发布 · 206 阅读

0 ·

CC 4.0 BY-SA版权

OJ 专栏收录该内容

116 篇文章

订阅专栏

本文探讨了如何解决四列表零和问题，即从四个列表中各选一个数，使得这些数的总和等于零。介绍了通过组合两个列表并排序，使用upper_bound和lower_bound函数来高效查找匹配的方法。

【问题描述】

The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d) ∈ A × B × C × D are such that a + b + c + d = 0. In the following, we assume that all lists have the same size n.

【输入描述】

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs. The first line of the input file contains the size of the lists n (this value can be as large as 4000). We then have n lines containing four integer values (with absolute value as large as 228) that belong respectively to A, B, C and D.

【输出描述】

For each test case, your program has to write the number quadruplets whose sum is zero. The outputs of two consecutive cases will be separated by a blank line.

【样例输入】

-45 22 42 -16

-41 -27 56 30

-36 53 -37 77

-36 30 -75 -46

26 -38 -10 62

-32 -54 -6 45

【样例输出】

Sample Explanation: Indeed, the sum of the five following quadruplets is zero: (-45, -27, 42, 30), (26, 30, -10, -46), (-32, 22, 56, -46), (-32, 30, -75, 77), (-32, -54, 56, 30).

题目大意就是从四列中分别选出一个数，然后这四个数相加的和为0，暴力的话肯定会超时。

把c[n]和d[n]求和存放到cd[n*n]中并排序，再看 -(a[i]+b[j]) 是否存在于cd[n*n]中。

也可以将a[i]+b[j]放入一个数组ab[n*n]中。

可以使用upper_bound()和lower_bound()函数查找。

参考链接：关于lower_bound( )和upper_bound( )的常见用法

时间：2020ms

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 4010;
int a[maxn],b[maxn],c[maxn],d[maxn],cd[maxn*maxn],ab[maxn*maxn];

int main()
{
	int  i,j,T,n,cnt,t,k;
	scanf("%d",&T);
	while(T--)
	{
		k=0;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
		}
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				cd[k]=c[i]+d[j];
				ab[k++]=a[i]+b[j];
			}
		}
		sort(cd,cd+k);
		sort(ab,ab+k);
		cnt=0;
		for(i=0;i<k;i++)
		{
			cnt+=(upper_bound(cd,cd+k,-ab[i])-lower_bound(cd,cd+k,-ab[i]));
		}
		printf("%d\n",cnt);
		if(T)
			printf("\n");
	}
	return 0;
}

时间：2530ms

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 4010;
int a[maxn],b[maxn],c[maxn],d[maxn],cd[maxn*maxn];

int main()
{
	int  i,j,T,n,cnt,t,k;
	scanf("%d",&T);
	while(T--)
	{
		k=0;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
		}
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				cd[k++]=c[i]+d[j];
			}
		}
		sort(cd,cd+k);
		cnt=0;
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				t=-(a[i]+b[j]);
				cnt+=(upper_bound(cd,cd+k,t)-lower_bound(cd,cd+k,t));
			}
		}
		printf("%d\n",cnt);
		if(T)
			printf("\n");
	}
	return 0;
}