Coprimes Gym - 101492C(bitset)

#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<bitset>

#define inf 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define ll long long
#define sd(x) scanf("%d",&(x))
#define sl(x) scanf("%lld",&(x))
#define slf(x) scanf("%lf",&(x))
#define scs(s) scanf("%s",s)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define lowbit(x) x&(-x)
#define ls now<<1
#define rs now<<1|1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define All L,R
using namespace std;

const int maxn=5e4+10;

int is_prime[maxn*10],prime[maxn],ans[maxn],a[maxn],tot=0,has[maxn*10];

bitset<maxn> dp[maxn],mark,ok;


void make()
{
    is_prime[1]=is_prime[0]=true;
    for(int i=2;i<=5e5;i++)
    {
        if(!is_prime[i])
        {
            prime[++tot]=i;
        }
        for(int j=1;j<=tot&&i*prime[j]<=5e5;j++)
        {
            is_prime[i*prime[j]]=true;
            if(i%prime[j]==0)
            {
                break;
            }
        }
    }
}

int main()
{
    int n,m;
    make();
    for(int i=0;i<tot;i++)
        has[prime[i+1]]=i;
    cin>>n>>m;
    rep(i,1,n) cin>>a[i];
    ans[n+1]=maxn;
    for(int i=n;i>=1;i--)
    {
        mark.reset();
        mark[i]=1;
        ok[i]=1;
        for(int j=1;prime[j]*prime[j]<=a[i];j++)
        {
            if(a[i]%prime[j]==0&&a[i])
            {
                dp[has[prime[j]]][i]=1;
                mark|=dp[has[prime[j]]];
            }
            while(a[i]%prime[j]==0&&a[i])
            {
                a[i]/=prime[j];
            }
        }
        if(a[i]) dp[has[a[i]]][i]=1,mark|=dp[has[a[i]]];
        ans[i]=(mark^ok)._Find_first();
        ans[i]=min(ans[i],ans[i+1]);
    }
    while(m--)
    {
        int l,r;
        cin>>l>>r;
        if(ans[l]<=r) cout<<"S\n";
        else cout<<"N\n";
    }


    return 0;
}