【BZOJ3944】Sum

【题目链接】

• 点击打开链接

【思路要点】

• 杜教筛模板题。
• 时间复杂度为\(O(TN^{\frac{2}{3}})\)。

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN	4000005
#define MAXM	10005
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
int tot, prime[MAXN], f[MAXN];
long long miu[MAXN], phi[MAXN];
long long Miu[MAXM], Phi[MAXM];
void init() {
	miu[1] = phi[1] = 1;
	for (int i = 2; i < MAXN; i++) {
		if (f[i] == 0) {
			f[i] = prime[++tot] = i;
			miu[i] = -1;
			phi[i] = i - 1;
		}
		for (int j = 1; j <= tot && prime[j] <= f[i]; j++) {
			int tmp = prime[j] * i;
			if (tmp >= MAXN) break;
			f[tmp] = prime[j];
			if (f[i] == prime[j]) miu[tmp] = 0, phi[tmp] = phi[i] * prime[j];
			else miu[tmp] = -miu[i], phi[tmp] = phi[i] * (prime[j] - 1);
		}
	}
	for (int i = 2; i < MAXN; i++) {
		miu[i] += miu[i - 1];
		phi[i] += phi[i - 1];
	}
}
int n;
long long AccessMiu(int x) {
	if (x < MAXN) return miu[x];
	else return Miu[n / x];
}
long long AccessPhi(int x) {
	if (x < MAXN) return phi[x];
	else return Phi[n / x];
}
void ModifyMiu(int x, long long value) {
	if (x < MAXN) miu[x] = value;
	else Miu[n / x] = value;
}
void ModifyPhi(int x, long long value) {
	if (x < MAXN) phi[x] = value;
	else Phi[n / x] = value;
}
void work(int x) {
	if (AccessPhi(x) != -1) return;
	long long AnsPhi = x * (x + 1ll) / 2, AnsMiu = 1;
	int nxt = 0;
	for (int i = 2; i <= x; i = nxt + 1) {
		nxt = x / (x / i);
		work(x / i);
		AnsPhi -= (nxt - i + 1) * AccessPhi(x / i);
		AnsMiu -= (nxt - i + 1) * AccessMiu(x / i);
		if (nxt == x) break;
	}
	ModifyPhi(x, AnsPhi);
	ModifyMiu(x, AnsMiu);
}
int main() {
	init();
	int T; read(T);
	while (T--) {
		read(n);
		memset(Miu, -1, sizeof(Miu));
		memset(Phi, -1, sizeof(Phi));
		work(n);
		printf("%lld %lld\n", AccessPhi(n), AccessMiu(n));
	}
	return 0;
}