#435933 (C++14) No.1000 Point Add and Array Add

• 問題: No.1000 Point Add and Array Add
• ユーザー: ミドリムシ
• 提出日時: 2020-02-28 21:42:10
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 420 ms / 2,000 ms
• コード長: 4,702 bytes
• コンパイル時間: 2,056 ms
• コンパイル使用メモリ: 175,632 KB
• 実行使用メモリ: 37,524 KB
• 最終ジャッジ日時: 2024-04-21 18:11:33
• 合計ジャッジ時間: 7,184 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	4 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	6 ms; 5,376 KB
testcase_15	AC	4 ms; 5,376 KB
testcase_16	AC	300 ms; 31,304 KB
testcase_17	AC	255 ms; 22,664 KB
testcase_18	AC	419 ms; 37,524 KB
testcase_19	AC	420 ms; 37,524 KB
testcase_20	AC	383 ms; 33,456 KB
testcase_21	AC	346 ms; 34,572 KB
testcase_22	AC	394 ms; 37,132 KB
testcase_23	AC	361 ms; 35,016 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }

template< typename Monoid >
struct SegmentTree
{
    using F = function< Monoid(Monoid, Monoid) >;
    
    int sz;
    vector< Monoid > seg;
    
    const F f;
    const Monoid M1;
    
    SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1)
    {
        sz = 1;
        while(sz < n) sz <<= 1;
        seg.assign(2 * sz, M1);
    }
    
    void set(int k, const Monoid &x)
    {
        seg[k + sz] = x;
    }
    
    void build()
    {
        for(int k = sz - 1; k > 0; k--) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    
    void update(int k, const Monoid &x)
    {
        k += sz;
        seg[k] = x;
        while(k >>= 1) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    
    Monoid query(int a, int b)
    {
        Monoid L = M1, R = M1;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) L = f(L, seg[a++]);
            if(b & 1) R = f(seg[--b], R);
        }
        return f(L, R);
    }
    
    Monoid operator[](const int &k) const
    {
        return seg[k + sz];
    }
};

int main(){
    int N, Q;
    cin >> N >> Q;
    vector<pair<lint, int>> query_A[N];
    for(int i = 0; i < N; i++){
        lint A;
        cin >> A;
        query_A[i].push_back({A, 0});
    }
    vector<int> query_on[N + 1], query_off[N + 1];
    for(int i = 0; i < Q; i++){
        char c;
        cin >> c;
        if(c == 'A'){
            int x;
            lint y;
            cin >> x >> y;
            x--;
            query_A[x].push_back({y, i + 1});
        }else{
            int x, y;
            cin >> x >> y;
            x--;
            query_on[x].push_back(i + 1);
            query_off[y].push_back(i + 1);
        }
    }
    SegmentTree< int > seg(Q + 1, [](int a, int b){ return a + b; }, 0);
    lint ans[N];
    for(int i = 0; i < N; i++){
        for(int j: query_on[i]){
            seg.update(j, 1);
        }
        for(int j: query_off[i]){
            seg.update(j, 0);
        }
        /*array_output(all(query_on[i]));
        array_output(all(query_off[i]));
        cout << endl;*/
        ans[i] = 0;
        for(auto j: query_A[i]){
            ans[i] += j.first * seg.query(j.second, Q + 1);
        }
        //cout << endl;
    }
    array_output(ans, ans + N);
}