Submission #72216878

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
//#define MSOD
//#define READ_IN_FILE
#define endl '\n'
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N = 3e5 + 10, P = 998244353, MOD = 1e9 + 7, inf = 0x3f3f3f3f;
bool cmpbig(int i, int j)
{
	return i > j;
}
double mylog(int x, int y)
{
	return log(x) / log(y);
}
long long qpow(long long a, long long b, long long mod = LLONG_MAX)
{
	long long num = 1;
	while (b)
	{
		if (b & 1)num = num * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return num;
}
int n, ans,a[N];
map<int, vector<int>> mp;
void solve()
{
	cin >> n;
	for (int i = 1; i <= n; i++)cin >> a[i],mp[a[i]].push_back(i);
	for (auto e : mp)
	{
		if (e.first % 5 != 0) continue;
		int t = e.first / 5, x = 7 * t, z = 3 * t;
		if (!mp.count(x) || !mp.count(z)) continue;
		for (int p : e.second)
		{
			int rx = mp[x].end() - upper_bound(mp[x].begin(), mp[x].end(), p), rz = mp[z].end() - upper_bound(mp[z].begin(), mp[z].end(), p);
			int lx = lower_bound(mp[x].begin(), mp[x].end(), p) - mp[x].begin(), lz = lower_bound(mp[z].begin(), mp[z].end(), p) - mp[z].begin();
			ans += rx * rz + lx * lz;
		}
	}
	cout << ans;
	return;
}
signed main()
{
	FAST
#ifdef READ_IN_FILE
	freopen(".in",  "r", stdin);
	freopen(".out",  "w", stdout);
#endif
	int _T_ = 1;
#ifdef MSOD
	cin >> _T_;
#endif
	while (_T_--)solve();
	return 0;
}

Submission Info

Judge Result