这个为啥 tle 了呢？

#pragma GCC optimize(2)
#include <cctype>
#include <iostream>
#include <unordered_map>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

int read()
{
	int s = 0;
	char ch = getchar();
	while (!isdigit(ch)) ch = getchar();
	while (isdigit(ch)) s = s * 10 + ch - '0', ch = getchar();
	return s;
}

int main()
{
	auto solve = [&]()
	{
		int n = read();
		const int N = 2e5 + 10;
		static int a[N];
		static unordered_map<int, int> cnt;
		cnt.clear();
		LL ans = 0;
		int L = 0;
		for (int i = 1; i <= n; ++i)
		{
			a[i] = read();
			++ cnt[a[i]];
			L = max(L, a[i]);
		}
		const int MAX = 1e9, MAX1 = 1e3, MAX2 = 1e6;
		for (int i = 1; i <= n; ++i)
		{
			int x = a[i];
			if (x >= MAX2)
				for (int d = 2; (LL)x * d <= L; ++d)
				{
					if (x % d == 0)
						ans += (LL)cnt[x / d] * cnt[x * d];
				}
			else
				for (int d = 1; d <= x / d; ++d)
					if (x % d == 0)
					{
						int t = x / d;
						if (d != x && (LL)x * t <= MAX) ans += (LL)cnt[d] * cnt[x * t];
						if (d != t && t != x && (LL)x * d <= MAX) ans += (LL)cnt[t] * cnt[x * d];
					}
		}

		for (auto [v, tot] : cnt)
			ans += (LL)tot * (tot - 1) * (tot - 2);

		printf("%lld\n", ans);
		
		return 0;
	};

	int T = read();
	while (T --)
		solve();
	return 0;
}