Submission #73371170


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
template<typename T>using vec=vector<T>;
template<typename T>using mat=vec<vec<T>>;
#define rep(n) for(ull _i=0;_i<(ull)(n);++_i)
#define ufor(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i)
#define dfor(i,a,b) for(ll i=(ll)(a);i>=(ll)(b);--i)
#define all(A) A.begin(),A.end()
#define rall(A) A.rbegin(),A.rend()
template<typename T>
istream&operator>>(istream&is,vec<T>&V) {
  for(ll i=0;i<(ll)V.size();++i) is>>V[i];
  return is;}
template<typename T1,typename T2>
ostream&operator<<(ostream&os,pair<T1,T2>p) {
  os<<"("<<p.first<<","<<p.second<<")";
  return os;}
template<typename T>
ostream&operator<<(ostream&os,const vec<T>&V) {
  for(ll i=0;i<(ll)V.size();++i)os<<V[i]<<(i==V.size()-1?"":" ");
  return os;}
template<typename T> 
ostream&operator<<(ostream&os,const mat<T>&M) {
  for(ll i=0;i<(ll)M.size();++i) os<<M[i]<<(i==M.size()-1?"":"\n");
  return os;}
template<typename T>
ostream&operator<<(ostream&os,const set<T>&S) {
  for(auto it=S.begin();it!=S.end();++it) os<<*it<<(it==--S.end()?"":" ");
  return os;}
inline bool in_range(const ll y, const ll x, const ll H, const ll W) {
  return y>=0&&y<H&&x>=0&&x<W;}
inline ull next_combination(ull c) {
  ull x = c & -c, y = c + x;
  return (((c & ~y) / x) >> 1) | y;}
class Timer {
  chrono::system_clock::time_point Time_start;
  public:
  Timer():Time_start(chrono::system_clock::now()){}
  void stop() {
    cout<<std::chrono::duration_cast<std::chrono::milliseconds>(chrono::system_clock::now()-Time_start);
  }
};
constexpr int inf = (1<<30)-1;
constexpr ll infl = 1LL<<60;

void add(vec<ll> &BIT, const ll idx, const ll x) {
  const ll n = BIT.size();
  for (ll i = idx; i < n; i += (i&-i)) {
    BIT[i] += x;
  }
}

ll sum(vec<ll> &BIT, const ll l, const ll r) {
  const ll n = BIT.size();
  ll sum = 0;
  for (ll i = l-1; i > 0; i -= (i&-i)) {
    sum -= BIT[i];
  }
  for (ll i = r; i > 0; i -= (i&-i)) {
    sum += BIT[i];
  }
  return sum;
}

void solve() {
  ll n, q;
  cin >> n >> q;
  vec<ll> A(n), BIT(n+1);
  ufor(i,0,n) {
    cin >> A[i];
    add(BIT, i+1, A[i]);
  }
  rep(q) {
    ll cmd;
    cin >> cmd;
    switch(cmd) {
      case 1: 
      ll l, r;
      cin >> l >> r;
      cout << sum(BIT, l, r) << endl;
      break;
      case 2:
      ll idx, x;
      cin >> idx >> x;
      add(BIT, idx, x - A[idx-1]);
      A[idx-1] = x;
      break;
    }
  }
  return;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(15);
  //Timer time;
  solve();
  //time.stop();
  return 0;
}

Submission Info

Submission Time
Task E - Store Sales Management
User omoU
Language C++23 (GCC 15.2.0)
Score 433
Code Size 2713 Byte
Status AC
Exec Time 109 ms
Memory 6828 KiB

Compile Error

./Main.cpp: In function 'll sum(vec<long long int>&, ll, ll)':
./Main.cpp:57:12: warning: unused variable 'n' [-Wunused-variable]
   57 |   const ll n = BIT.size();
      |            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 433 / 433
Status
AC × 3
AC × 84
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt, in77.txt, in78.txt, in79.txt, in80.txt, in81.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3708 KiB
in02.txt AC 1 ms 3676 KiB
in03.txt AC 1 ms 3576 KiB
in04.txt AC 1 ms 3652 KiB
in05.txt AC 1 ms 3660 KiB
in06.txt AC 11 ms 6628 KiB
in07.txt AC 57 ms 3628 KiB
in08.txt AC 73 ms 6628 KiB
in09.txt AC 2 ms 3800 KiB
in10.txt AC 1 ms 3640 KiB
in11.txt AC 67 ms 6460 KiB
in12.txt AC 73 ms 6532 KiB
in13.txt AC 11 ms 6504 KiB
in14.txt AC 11 ms 6532 KiB
in15.txt AC 65 ms 6588 KiB
in16.txt AC 98 ms 6828 KiB
in17.txt AC 1 ms 3676 KiB
in18.txt AC 47 ms 6592 KiB
in19.txt AC 97 ms 6820 KiB
in20.txt AC 67 ms 6504 KiB
in21.txt AC 83 ms 6536 KiB
in22.txt AC 107 ms 6568 KiB
in23.txt AC 108 ms 6568 KiB
in24.txt AC 91 ms 6592 KiB
in25.txt AC 98 ms 6824 KiB
in26.txt AC 65 ms 6456 KiB
in27.txt AC 78 ms 6528 KiB
in28.txt AC 11 ms 6632 KiB
in29.txt AC 8 ms 5748 KiB
in30.txt AC 1 ms 3512 KiB
in31.txt AC 1 ms 3792 KiB
in32.txt AC 1 ms 3628 KiB
in33.txt AC 1 ms 3804 KiB
in34.txt AC 1 ms 3512 KiB
in35.txt AC 1 ms 3556 KiB
in36.txt AC 1 ms 3628 KiB
in37.txt AC 1 ms 3764 KiB
in38.txt AC 1 ms 3636 KiB
in39.txt AC 1 ms 3652 KiB
in40.txt AC 101 ms 6440 KiB
in41.txt AC 1 ms 3512 KiB
in42.txt AC 1 ms 3756 KiB
in43.txt AC 1 ms 3708 KiB
in44.txt AC 1 ms 3636 KiB
in45.txt AC 1 ms 3636 KiB
in46.txt AC 1 ms 3532 KiB
in47.txt AC 100 ms 6576 KiB
in48.txt AC 72 ms 6456 KiB
in49.txt AC 69 ms 5672 KiB
in50.txt AC 50 ms 6452 KiB
in51.txt AC 91 ms 6472 KiB
in52.txt AC 67 ms 6532 KiB
in53.txt AC 88 ms 6440 KiB
in54.txt AC 70 ms 5736 KiB
in55.txt AC 106 ms 6580 KiB
in56.txt AC 104 ms 6632 KiB
in57.txt AC 109 ms 6580 KiB
in58.txt AC 103 ms 5004 KiB
in59.txt AC 72 ms 6472 KiB
in60.txt AC 92 ms 6560 KiB
in61.txt AC 87 ms 6380 KiB
in62.txt AC 65 ms 6472 KiB
in63.txt AC 42 ms 6632 KiB
in64.txt AC 43 ms 5764 KiB
in65.txt AC 1 ms 3704 KiB
in66.txt AC 1 ms 3564 KiB
in67.txt AC 1 ms 3628 KiB
in68.txt AC 1 ms 3708 KiB
in69.txt AC 1 ms 3576 KiB
in70.txt AC 1 ms 3652 KiB
in71.txt AC 1 ms 3636 KiB
in72.txt AC 1 ms 3676 KiB
in73.txt AC 1 ms 3580 KiB
in74.txt AC 1 ms 3636 KiB
in75.txt AC 1 ms 3580 KiB
in76.txt AC 1 ms 3660 KiB
in77.txt AC 1 ms 3704 KiB
in78.txt AC 1 ms 3576 KiB
in79.txt AC 1 ms 3616 KiB
in80.txt AC 103 ms 6820 KiB
in81.txt AC 67 ms 6456 KiB
sample01.txt AC 1 ms 3660 KiB
sample02.txt AC 1 ms 3652 KiB
sample03.txt AC 1 ms 3708 KiB