Submit Info #2668

Problem Lang User Status Time Memory
Point Add Range Sum cpp fumiphys AC 592 ms 16.30 MiB

ケース詳細
Name Status Time Memory
example_00 AC 5 ms 0.63 MiB
max_random_00 AC 589 ms 16.27 MiB
max_random_01 AC 591 ms 16.26 MiB
max_random_02 AC 587 ms 16.26 MiB
max_random_03 AC 585 ms 16.30 MiB
max_random_04 AC 592 ms 16.25 MiB
random_00 AC 470 ms 14.77 MiB
random_01 AC 489 ms 15.74 MiB
random_02 AC 368 ms 4.84 MiB
random_03 AC 86 ms 15.25 MiB
random_04 AC 141 ms 12.88 MiB
small_00 AC 6 ms 0.68 MiB
small_01 AC 7 ms 0.68 MiB
small_02 AC 7 ms 0.68 MiB
small_03 AC 7 ms 0.64 MiB
small_04 AC 7 ms 0.58 MiB
small_05 AC 5 ms 0.62 MiB
small_06 AC 7 ms 0.68 MiB
small_07 AC 5 ms 0.61 MiB
small_08 AC 7 ms 0.63 MiB
small_09 AC 7 ms 0.68 MiB

// includes #include <bits/stdc++.h> using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define whole(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define bit(n) (1LL<<(n)) // functions 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(a > b){a = b; return 1;} return 0;} template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;} template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair<int, int>; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);} } fast_io_; template<typename T, typename E> struct SegmentTree_ { function<T(T, T)> f; // aggregate function function<T(T, E)> g; // update function int n; T def; vector<T> vec; SegmentTree_(){} SegmentTree_(int n_, function<T(T, T)> f, function<T(T, E)> g, T def, vector<T> v=vector<T>()): f(f), g(g), def(def){ // initialize vector n = 1; while(n < n_){ n *= 2; } vec = vector<T>(2*n -1, def); // initialize segment tree for(int i = 0; i < v.size(); i++){ vec[i + n - 1] = v[i]; } for(int i = n - 2; i >= 0; i--){ vec[i] = f(vec[2*i+1], vec[2*i+2]); } } void update(int k, const E &val){ k = k + n - 1; vec[k] = g(vec[k], val); while(k > 0){ k = (k - 1) / 2; vec[k] = f(vec[2*k+1], vec[2*k+2]); } } // [l, r) -> [a, b) (at k) T query(int a, int b, int k, int l, int r){ if(r <= a || b <= l)return def; if(a <= l && r <= b)return vec[k]; T ld = query(a, b, 2*k+1, l, (l+r)/2); T rd = query(a, b, 2*k+2, (l+r)/2, r); return f(ld, rd); } T query(int a, int b){ return query(a, b, 0, 0, n); } }; template<typename T, typename E> using SegmentTree = struct SegmentTree_<T, E>; using SegmentTreeI = SegmentTree<int, int>; using SegmentTreeL = SegmentTree<long long, long long>; int main(int argc, char const* argv[]) { int n, q; cin >> n >> q; vector<ll> a(n); cin >> a; SegmentTreeL seg = SegmentTreeL(n, [](ll a, ll b){return a + b;}, [](ll a,ll b){return a + b;}, 0, a); rep(i_, q){ int t; cin >> t; if(t == 0){ int p; cin >> p; ll x; cin >> x; seg.update(p, x); }else{ int l, r; cin >> l >> r; cout << seg.query(l, r) << endl; } } return 0; }