結果

問題 No.2758 RDQ
ユーザー mikammikam
提出日時 2024-05-18 19:07:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 108 ms / 2,000 ms
コード長 5,157 bytes
コンパイル時間 6,379 ms
コンパイル使用メモリ 410,020 KB
実行使用メモリ 29,092 KB
最終ジャッジ日時 2024-05-18 19:07:28
合計ジャッジ時間 9,293 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
13,296 KB
testcase_01 AC 4 ms
6,940 KB
testcase_02 AC 4 ms
6,940 KB
testcase_03 AC 4 ms
6,940 KB
testcase_04 AC 3 ms
6,944 KB
testcase_05 AC 3 ms
6,940 KB
testcase_06 AC 104 ms
28,420 KB
testcase_07 AC 104 ms
28,528 KB
testcase_08 AC 106 ms
29,092 KB
testcase_09 AC 108 ms
28,652 KB
testcase_10 AC 108 ms
28,724 KB
testcase_11 AC 65 ms
13,788 KB
testcase_12 AC 67 ms
13,624 KB
testcase_13 AC 67 ms
13,856 KB
testcase_14 AC 64 ms
13,848 KB
testcase_15 AC 63 ms
13,676 KB
testcase_16 AC 90 ms
13,648 KB
testcase_17 AC 62 ms
13,856 KB
testcase_18 AC 65 ms
13,968 KB
testcase_19 AC 62 ms
13,684 KB
testcase_20 AC 63 ms
13,756 KB
testcase_21 AC 3 ms
6,940 KB
testcase_22 AC 4 ms
6,944 KB
testcase_23 AC 4 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <atcoder/internal_math>
using namespace internal;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
#define pb push_back
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using ull = unsigned long long;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int takao(bool takahashi){return yesno(takahashi,"Takahashi","Aoki");}
struct __m___m__ {__m___m__(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} _m_m_;
int di[]={0,1,0,-1,-1,-1,1,1};
int dj[]={1,0,-1,0,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
struct osa_k{
    vector<int> v;
    osa_k(int n){
        assert(n >= 1);
        v.resize(n+1,-1);
        for(int i=0;i<=n;i++)v[i]=i;
        v[0]=v[1]=-1;
        for(int i=2;i*i<=n;i++){
            if(v[i]==i)for(int j=i;j<=n;j+=i) v[j]=i;
        }
    }
    map<int,int> prime_factorization(int n,int k=1){
        map<int,int> res;
        while(v[n]!=-1) res[v[n]]+=k,n/=v[n];
        return res;
    }
    vector<int> divisor(int n,int k=1){
        map<int,int> res=prime_factorization(n,k);
        vector<pair<int,int>> divs;
        for(auto [p,e]:res) divs.emplace_back(p,e);
        vector<int> ret;
        auto dfs = [&](auto f,int cu=0,int val=1){
            if(cu==divs.size()){ret.push_back(val);return;}
            int mul = 1;
            for(int i=0;i<=divs[cu].second;i++){
                f(f,cu+1,val*mul);
                mul*=divs[cu].first;
            }
        };dfs(dfs);
        return ret;
    }
};
signed main() {

    INT(n,q);
    vi a(n);cin>>a;
    vector<vi> id(100010);
    osa_k os(100010);
    rep(i,n){
        auto divs = os.divisor(a[i]);
        for(auto e:divs)id[e].push_back(i);
    }
    while(q--){
        INT(l,r,k);
        --l;
        print(lower_bound(all(id[k]),r)-lower_bound(all(id[k]),l));
    }
    return 0;
}
0