# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777651 | ihceker | Addk (eJOI21_addk) | C++14 | 257 ms | 8640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int n,k,f[100005],f2[100005],f3[100005];
void update(int x,int y){
for(int i=x;i<=n;i+=(i&-i)){
f[i]+=y;
}
return;
}
void update2(int x,int y){
for(int i=x;i<=n;i+=(i&-i)){
f2[i]+=y;
}
return;
}
void update3(int x,int y){
for(int i=x;i>=1;i-=((n-i+1)&(i-n-1))){
f3[i]+=y;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |