传送门
题意
分析
如果一个子树,不能通过其他的边回到父节点,那么他和其他的节点必然是不连通的
最后因为算点对,所以需要*2
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e4 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
int num[60][600][600];
int p[60][N];
int li,n,q;
int main() {
read(n),read(q);
li = sqrt(n) * 4;
for(int i = 0;i < n;i++) read(a[i]);
for(int i = 0;i < n;i++){
for(int j = 1;j <= 600;j++) num[i / li][j][a[i] % j]++;
p[i / li][a[i]]++;
}
while(q--){
int l,r,x,y;
read(l),read(r),read(x),read(y);
int ans = 0;
if(l / li == r / li){
for(int i = l;i <= r;i++) ans += (a[i] % y == x);
di(ans);
continue;
}
int L = l / li + 1,R = r / li - 1;
for(int i = L;i <= R;i++){
if(y > 600)
for(int j = x;j <= 40000;j += y) ans += p[i][j];
else ans += num[i][y][x];
}
for(int i = l;i / li == l / li && i < n;i++) if(a[i] % y == x) ans++;
for(int i = r;~i && i / li == r / li;i--) if(a[i] % y == x) ans++;
di(ans);
}
return 0;
}