| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1138488 | SmuggingSpun | Sterilizing Spray (JOI15_sterilizing) | C++20 | 24 ms | 2120 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
const int lim = 1e5 + 5;
int n, q, k, a[lim];
ll bit[lim];
void update(int p, int x){
for(; p <= n; p += p & -p){
bit[p] += x;
}
}
ll get(int p){
ll ans = 0;
for(; p > 0; p -= p & -p){
ans += bit[p];
}
return ans;
}
namespace sub3{
void solve(){
for(int _ = 0; _ < q; _++){
int _t, u, v;
cin >> _t >> u >> v;
if(_t == 1){
update(u, -a[u]);
update(u, a[u] = v);
}
else if(_t == 3){
cout << get(v) - get(u - 1) << "\n";
}
}
}
}
namespace sub124{
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> q >> k;
memset(bit, 0, sizeof(bit));
for(int i = 1; i <= n; i++){
cin >> a[i];
update(i, a[i]);
}
if(k == 1){
sub3::solve();
}
else{
sub124::solve();
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
