Submission #3391699

---

Source Code Expand

#include <iostream>
#include <unordered_map>
#include <vector>
#define llint long long
#define mod 1000000007
#define inf 1e18

using namespace std;
typedef unordered_map<llint, llint> UMP;


struct SegTree{
	int size;
	vector<UMP> seg;
	
	SegTree(){}
	SegTree(int size){
		this->size = size;
		seg.resize(1<<(size+1));
	}
	
	void set(int i, UMP ump)
	{
		seg[(1<<size)+i] = ump;
	}
	void build()
	{
		for(int i = (1<<size)-1; i >= 1; i--){
			UMP lval = seg[i*2], rval = seg[i*2+1];
			if(lval.size() < rval.size()) swap(lval, rval);
			for(auto it = rval.begin(); it != rval.end(); it++){
				lval[it->first] += it->second;
			}
			seg[i] = lval;
		}
	}

	UMP query(int a, int b, int k, int l, int r)
	{
		if(b < l || r < a) return UMP();
		if(a <= l && r <= b) return seg[k];
		UMP lval = query(a, b, k*2, l, (l+r)/2);
		UMP rval = query(a, b, k*2+1, (l+r)/2+1, r);
		if(lval.size() < rval.size()) swap(lval, rval);
		for(auto it = rval.begin(); it != rval.end(); it++){
			lval[it->first] += it->second;
		}
		return lval;
	}
	UMP query(int a, int b)
	{
		return query(a, b, 1, 0, (1<<size)-1);
	}
};


llint N, Q;
llint x[100005];
llint prime[100005];
UMP mp[100005];
SegTree seg(17);

int main(void)
{
	for(int i = 2; i < 1005; i++){
		if(prime[i]) continue;
		for(int j = 2*i; j < 100005; j+=i) prime[j] = i;
	}
	for(int i = 2; i < 100005; i++){
		llint x = i;
		while(prime[x]){
			mp[i][prime[x]]++;
			x /= prime[x];
		}
		if(x > 1) mp[i][x]++;
	}
	
	cin >> N >> Q;
	for(int i = 1; i <= N; i++) cin >> x[i];
	
	for(int i = 1; i <= N; i++) seg.set(i, mp[x[i]]);
	seg.build();
	
	llint l, r; UMP res;
	for(int q = 0; q < Q; q++){
		cin >> l >> r;
		res = seg.query(l, r);
		llint ans = 1;
		for(auto it = res.begin(); it != res.end(); it++){
			ans *= it->second + 1;
			ans %= mod;
		}
		cout << ans << endl;
	}
	
	return 0;
}

Submission Info

Judge Result