# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483030 | vato_chachanidze | Addk (eJOI21_addk) | C++14 | 366 ms | 8716 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>
using namespace std;
long long n,k,a[100009],pref[100009],pref2[100009],pref3[100009],type,l,r,m,siz,z,cnt,shes[100];
void update(long long ind,long long maxind,long long a,long long b,long long fenvik[])
{
while(ind<=maxind)
{
fenvik[ind]+=a-b;
ind+=(ind & -ind);
}
}
long long findans(long long ind,long long maxind,long long fenvik[])
{
long long sum=0;
while(ind>0)
{
sum+=fenvik[ind];
ind-=(ind & -ind);
}
return sum;
}
int main()
{
cin>>n>>z;
for(k=1;k<=n;k++)
{
cin>>a[k];
}
for(k=1;k<=n;k++)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |