Submission #562788

#TimeUsernameProblemLanguageResultExecution timeMemory
562788SSRSSterilizing Spray (JOI15_sterilizing)C++14
0 / 100
134 ms1228 KiB
#include <bits/stdc++.h> using namespace std; struct binary_indexed_tree{ int N; vector<long long> BIT; binary_indexed_tree(int N): N(N), BIT(N + 1, 0){ } void add(int i, int x){ i++; while (i <= N){ BIT[i] += x; i += i & -i; } } long long sum(int i){ long long ans = 0; while (i > 0){ ans += BIT[i]; i -= i & -i; } return ans; } long long sum(int L, int R){ return sum(R) - sum(L); } }; int main(){ int N, Q, K; cin >> N >> Q >> K; vector<int> C(N); for (int i = 0; i < N; i++){ cin >> C[i]; } binary_indexed_tree BIT(N); for (int i = 0; i < N; i++){ BIT.add(C[i], 0); } for (int i = 0; i < Q; i++){ int S, T, U; cin >> S >> T >> U; if (S == 1){ BIT.add(T, -C[T]); C[T] = U; BIT.add(T, U); } if (S == 3){ T--; cout << BIT.sum(T, U) << endl; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...