Submission #3305168

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

vi pr[MAX_N], id[MAX_N];
bool is_prime[MAX_N];

void all_fac()
{
    fill(is_prime,is_prime+MAX_N,true);
    for(int i=2;i<MAX_N;i++){
        if(is_prime[i]){
            pr[i].pb(i);
            id[i].pb(1);
            for(int j=2*i;j<MAX_N;j+=i){
                is_prime[j] = false;
                int cnt = 0;
                int nw = j;
                while(nw % i == 0){
                    nw /= i;
                    cnt++;
                }
                pr[j].pb(i);
                id[j].pb(cnt);
            }
        }
    }
}

int inv[20*MAX_N];

void make()
{
	inv[1] = 1;
	for(int i=2;i<20*MAX_N;i++){
		inv[i] = MOD - (ll)inv[MOD%i] * (MOD/i) % MOD;
	}
}

inline int add(int x,int y)
{
    return (x+y)%MOD;
}

inline int sub(int x,int y)
{
    return (x+MOD-y)%MOD;
}

inline int mul(int x,int y)
{
    return (ll)x*y%MOD;
}

int res;
int cnt[MAX_N], a[MAX_N];

class Mo{
private:
    vector<int> left, right;
    int w;
    void add(int id);
    void del(int id);

public:
    vector<int> ans;

    Mo(int n) : w(500){}
    //クエリ[l,r)
    void insert(int l, int r){
        left.push_back(l), right.push_back(r);
    }
    void solve(){
        int sz = (int)left.size();
        int nl = 0, nr = 0;
        vector<int> ord(sz);
        iota(ord.begin(), ord.end(), 0);
        sort(ord.begin(), ord.end(), [&](int a, int b){
            return (left[a] / w == left[b] / w) ? (right[a] < right[b]) : (left[a] < left[b]);
        });
        ans.resize(sz);
        for(int i = 0; i < sz; i++){
            const int index = ord[i];  //order:クエリのsort後のorder→元のorder
            while(nl > left[index]) nl--, add(nl);
            while(nr < right[index]) add(nr), nr++;  //add
            while(nl < left[index]) del(nl), nl++;
            while(nr > right[index]) nr--, del(nr);  //del
            ans[index] = res;
        }
    }
};

//idは元の配列のインデックス
void Mo::add(int index)
{
    int num = a[index];
    rep(i, len(pr[num])){
        int& hoge = cnt[pr[num][i]];
        res = mul(res, inv[hoge]);
        hoge += id[num][i];
        res = mul(res, hoge);
    }
}

void Mo::del(int index)
{
    int num = a[index];
    rep(i, len(pr[num])){
        int& hoge = cnt[pr[num][i]];
        res = mul(res, inv[hoge]);
        hoge -= id[num][i];
        res = mul(res, hoge);
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    rep(i,n){
        cin >> a[i];
    }
    make();
    all_fac();
    Mo mo(n);
    rep(i,q){
        int l, r;
        cin >> l >> r;
        mo.insert(l-1, r);
    }
    rep(i, MAX_N){
        cnt[i] = 1;
    }
    res = 1;
    mo.solve();
    rep(i,q){
        cout << mo.ans[i] << "\n";
    }
    return 0;
}

Submission Info

Judge Result