結果

問題 No.2065 Sum of Min
ユーザー au7777
提出日時 2022-09-17 17:08:59
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 362 ms / 2,000 ms
コード長 3,150 bytes
コンパイル時間 5,193 ms
コンパイル使用メモリ 255,068 KB
実行使用メモリ 14,080 KB
最終ジャッジ日時 2024-12-22 00:53:25
合計ジャッジ時間 12,893 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
using namespace atcoder;
typedef pair<ll, ll> P;
#define loop(i,n) for(int i=0;i<n;i++)
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 998244353;
using mint = modint998244353;
// const ll MOD = 1000000007;
// using mint = modint1000000007;
const int MAX = 2000005;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll n, ll hou) {
    ll ret = 0;
    while (n) {
        n /= hou;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
vector<ll> compress(vector<ll> v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}
ll op(ll a, ll b) {
    return a + b;
}
ll e() {
    return 0;
}
int main() {
    ll n, q;
    cin >> n >> q;
    ll a[n + 1];
    vector<P> v;
    segtree<ll, op, e> seg(n + 1);
    segtree<ll, op, e> z(n + 1);
    for (ll i = 1; i <= n; i++) {
        cin >> a[i];
        seg.set(i, a[i]);
        v.push_back({a[i], i});
    }
    sort(v.begin(), v.end(), greater<P>());
    vector<tuple<ll, ll, ll, ll>> query;
    for (int i = 1; i <= q; i++) {
        ll l, r, x;
        cin >> l >> r >> x;
        query.push_back({x, l, r, i});
    }
    sort(query.begin(), query.end(), greater<tuple<ll, ll, ll, ll>>());
    int id = 0;
    ll ans[q + 1];
    for (auto qu : query) {
        ll nx = get<0>(qu);
        ll nl = get<1>(qu);
        ll nr = get<2>(qu);
        ll ni = get<3>(qu);
        while ((id <= n) && (v[id].first >= nx)) {
            seg.set(v[id].second, 0);
            z.set(v[id].second, 1);
            id++;
        }
        ans[ni] =  seg.prod(nl, nr + 1) + z.prod(nl, nr + 1) * nx;
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0