四平方和【二分】

原题链接

题面

思路

因为如果要用三重循环，看数据范围肯定会超时 (其实不会)
那么就考虑到用双重循环，把两个数的平方先存下来，存在结构体里，然后再枚举两重循环，两个数，看能否和另外两个数凑成n，那就二分出第一个那个数，看是否存在，找左端点，所以是r = mid.

代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e7 + 10;
struct name{
	int s;
	int c;
	int d;
}num[N];
bool cmp(name a, name b)
{
	if (a.s != b.s) return a.s < b.s;
	if (a.c != b.c) return a.c < b.c;
	return a.d < b.d;
}
signed main()
{
	int n;
	cin >> n;
	int cnt = 0;
	for (int c = 0; c * c <= n; c ++ )
	{
		for (int d = c; d * d + c * c <= n; d ++ )
		{
			num[cnt ++ ] = {c * c + d * d, c, d};
		}
	}
	sort(num, num + cnt, cmp);
	
	for (int a = 0; a * a <= n; a ++ )
	{
		for (int b = a; b * b + a * a <= n; b ++ )
		{
			int t = n - a * a - b * b;
			int l = 0, r = cnt - 1;
			while (l < r)
			{
				int mid = l + r >> 1;
				if (num[mid].s >= t) r = mid;
				else l = mid + 1;
			}
			if (num[l].s == t)
			{
				printf("%d %d %d %d", a, b, num[l].c, num[l].d);
				return 0;
			}
		}
	}
	return 0;
}

总结

二分二分！~~~~