# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164161 | PikachudoraEHE | Addk (eJOI21_addk) | C++20 | 92 ms | 1348 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int cur[N],n,k;
struct fenwick{
int f[N];
void update(int idx,int val){
for(int i=idx;i<=n;i+=i&-i){
f[i]+=val;
}
return;
}
int query(int idx){
int s= 0;
for(int i=idx;i>0;i-=i&-i){
s+=f[i];
}
return s;
}
}f1,f2,f3;
int main(){
//ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>cur[i];
f1.update(i,cur[i]);
f2.update(i,cur[i]*i);
f3.update(n-i+1,cur[i]*(n-i+1));
}
int q;cin>>q;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |