結果
| 問題 | No.2758 RDQ |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2024-05-17 22:10:27 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,300 ms / 2,000 ms |
| コード長 | 9,075 bytes |
| コンパイル時間 | 2,674 ms |
| コンパイル使用メモリ | 218,520 KB |
| 最終ジャッジ日時 | 2025-02-21 14:55:50 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) (a).begin(), (a).end()#define Sort(a) (sort((a).begin(), (a).end()))#define RSort(a) (sort((a).rbegin(), (a).rend()))#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr<< (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }template <typename S, typename T>struct RangeTree{struct BinaryIndexedTree{int N;vector<T> BIT;BinaryIndexedTree() {}void init(int size){N = size;BIT.assign(N + 1, 0);}T get(int i){return sum(i + 1) - sum(i);}void add(int i, T x){++i;while(i <= N){BIT[i] += x;i += i & -i;}}T sum(int i) const {T ans = 0;while(i > 0){ans += BIT[i];i -= i & -i;}return ans;}T sum(int L, int R) const {return sum(R) - sum(L);}};using P = pair<S, S>;S N, M;vector<BinaryIndexedTree> bit;vector<vector<S>> ys;vector<P> ps;RangeTree() {}void add_point(S x, S y){ps.push_back(make_pair(x, y));}void build(){sort(ps.begin(), ps.end());ps.erase(unique(ps.begin(), ps.end()), ps.end());N = ps.size();bit.resize(N + 1);ys.resize(N + 1);for(int i = 0; i <= N; ++i){int j = i + 1;while(j <= N){ys[j].push_back(ps[i].second);j += j & -j;}sort(ys[i].begin(), ys[i].end());ys[i].erase(unique(ys[i].begin(), ys[i].end()), ys[i].end());bit[i].init(ys[i].size());}}int id(S x) const {auto f = [](const P &a, const P &b){return a.first < b.first;};return lower_bound(ps.begin(), ps.end(), make_pair(x, S()), f) - ps.begin();}int id(int i, S y) const {return lower_bound(ys[i].begin(), ys[i].end(), y) - ys[i].begin();}void add(S x, S y, T a){int i = lower_bound(ps.begin(), ps.end(), make_pair(x, y)) - ps.begin();assert(ps[i] == make_pair(x, y));++i;while(i <= N){bit[i].add(id(i, y), a);i += i & -i;}}T sum(S x, S y) const {T ret = T();int a = id(x);while(a > 0){ret += bit[a].sum(id(a, y));a -= a & -a;}return ret;}// [(xl, yl), (xr, yr))T sum(S xl, S yl, S xr, S yr) const {T ret = T();int a = id(xl), b = id(xr);while(a != b) {if(a < b){ret += bit[b].sum(id(b, yl), id(b, yr));b -= b & -b;} else{ret -= bit[a].sum(id(a, yl), id(a, yr));a -= a & -a;}}return ret;}};namespace prime{template <typename T>bool isPrime(T n){switch(n) {case 0: // fall-throughcase 1: return false;case 2: return true;}if(n % 2 == 0) return false;for(T i = 3; i * i <= n; i += 2){if(n % i == 0){return false;}}return true;}template <typename T>vector<pair<T, T>> factorize(T n) {vector<pair<T, T>> ret;for(T i = 2; i * i <= n; i++) {if(n % i != 0) continue;T tmp = 0;while(n % i == 0) {tmp++;n /= i;}ret.push_back(make_pair(i, tmp));}if(n != 1) ret.push_back(make_pair(n, 1));return ret;}template <typename T>vector<T> divisor(T n){T rt = sqrt(n);vector<T> res, resB;for(T i = 1; i * i <= n; i++){if(n % i == 0){res.push_back(i);T j = n / i;if(j != rt){resB.push_back(j);}}}for(int i = (int) resB.size() - 1; i >= 0; i--){res.push_back(resB[i]);}return res;}template <typename T>vector<T> sieve(T n){vector<T> c(n + 1);for(int i = 2; i <= n; i++){if(c[i] != 0) continue;for(int j = i; j <= n; j += i){c[j] += 1;}}return c;}}void input(){}ll B = 500;void solve(){ll n, q; in(n, q);vll a; vin(a, n);RangeTree<ll, ll> rt;rep(i, n) rt.add_point(i, a[i]);rt.build();rep(i, n) rt.add(i, a[i], 1);vector<vll> s(B + 1, vll(n + 1));rep(i, 1, B + 1){rep(j, n){s[i][j + 1] = s[i][j] + (a[j] % i == 0);}}while(q--){ll l, r, k; in(l, r, k);l--;if(k <= B){out(s[k][r] - s[k][l]);}else{ll ans = 0;rep(i, k, 100001, k){ans += rt.sum(l, i, r, i + 1);}out(ans);}}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();solve();}