結果

問題 No.2758 RDQ
ユーザー apricityapricity
提出日時 2024-05-17 23:29:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,476 bytes
コンパイル時間 1,735 ms
コンパイル使用メモリ 139,712 KB
実行使用メモリ 19,328 KB
最終ジャッジ日時 2024-12-20 15:30:07
合計ジャッジ時間 4,701 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 7 ms
6,820 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 6 ms
6,816 KB
testcase_22 AC 8 ms
6,816 KB
testcase_23 AC 7 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>
#ifdef LOCAL
# include "debug_print.hpp"
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
using namespace std;
#define rep1(a) for(int i = 0; i < a; i++)
#define rep2(i, a) for(int i = 0; i < a; i++)
#define rep3(i, a, b) for(int i = a; i < b; i++)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a) for(int i = (a)-1; i >= 0; i--)
#define rrep2(i, a) for(int i = (a)-1; i >= 0; i--)
#define rrep3(i, a, b) for(int i = (b)-1; i >= a; i--)
#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
cout << t;
outr(u...);
}
struct eratosthenes{
vector<bool> isprime;
vector<int> minfactor;
vector<int> mobius;
eratosthenes(int n) : isprime(n+1,true), minfactor(n+1, -1), mobius(n+1,1){
isprime[1] = false;
minfactor[1] = 1;
for(int i = 2; i <= n; i++){
if(!isprime[i]) continue;
minfactor[i] = i;
mobius[i] = -1;
for(int j = i+i; j <= n; j += i){
isprime[j] = false;
if(minfactor[j] == -1) minfactor[j] = i;
if((j/i)%i == 0) mobius[j] = 0;
else mobius[j] *= -1;
}
}
}
vector<pair<int, int>> factorize(int n){
vector<pair<int, int>> res;
while(n > 1){
int p = minfactor[n];
int e = 0;
while(minfactor[n] == p){
n /= p;
e++;
}
res.push_back({p,e});
}
return res;
}
vector<int> divisor(int n){
vector<int> res;
res.pb(1);
auto v = factorize(n);
for(auto x : v){
int s = res.size();
rep(i,s){
int m = 1;
rep(j,x.second){
m *= x.first;
res.push_back(res[i]*m);
}
}
}
return res;
}
template<class T> void fzt(vector<T> &f){
int n = f.size();
for(int p = 2; p < n; p++){
if(!isprime[p]) continue;
for(int q = (n-1)/p; q > 0; q--){
f[q] += f[p*q];
}
}
}
template<class T> void fmt(vector<T> &f){
int n = f.size();
for(int p = 2; p < n; p++){
if(!isprime[p]) continue;
for(int q = 1; q*p < n; q++){
f[q] -= f[p*q];
}
}
}
template<class T> vector<T> conv(const vector<T> &f, const vector<T> &g){
int n = max(f.size(), g.size());
vector<T> nf(n), ng(n), h(n);
rep(i,f.size()) nf[i] = f[i];
rep(i,g.size()) ng[i] = g[i];
fzt(nf); fzt(ng);
rep(i,n) h[i] = nf[i]*ng[i];
fmt(h);
return h;
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n,q; in(n,q);
eratosthenes si(100001);
vector<int> a(n); in(a);
vector<int> ans(q);
vector<int> l(q),r(q),k(q);
rep(i,q) {in(l[i],r[i],k[i]);l[i]--;}
vector<int> v[100001];
rep(i,q){
v[k[i]].pb(i);
}
rep(i,n){
for(auto x : si.divisor(a[i])){
v[x].pb(i);
}
}
rep(i,q){
int left = lower_bound(ALL(v[k[i]]),l[i]) - v[k[i]].begin();
int right = lower_bound(ALL(v[k[i]]),r[i]) - v[k[i]].begin();
out(max(0, right-left-1));
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0