oj.uz

Submission #571786

# Submission time Handle Problem Language Result Execution time Memory
571786 2022-06-02T17:52:20 Z Adnanboi Addk (eJOI21_addk) C++14
36 / 100
 2000 ms 2644 KB 
#include <bits/stdc++.h>

using namespace std;

#define N 100000
#define ll long long

vector<ll> tree(2*N,0);

ll n;

void build(vector<ll> lista){
    for(int i=0;i<n;i++){
        tree[n+i]=lista[i];
    }
    for (int i=n-1;i>0;i--){ 
        tree[i]=tree[i<<1]+tree[i<<1 | 1];
    }
}

void update(int p, ll value){
    p+=n;
    tree[p]=value;
    for(p/=2;p>0;p/=2){
        tree[p]=tree[2*p]+tree[p*2+1];
    }
}

ll sum(ll l, ll r){
    ll res = 0;
    for (l+=n,r+=n;l<r;l>>=1,r>>=1)
    {
        if (l&1)
            res += tree[l++];
     
        if (r&1)
            res += tree[--r];
    }
    return res;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll q,k;
    cin>>n>>k;
    vector<ll> lista(n);
    for(int i=0;i<n;i++){
        cin>>lista[i];
    }
    build(lista);
    cin>>q;
    for(int i=0;i<q;i++){
        int c;
        cin>>c;
        if(c==1){
            int a;
            cin>>a;
            int first=tree[a+n-1];
            int b=a;
            for(int i=0;i<k-1;i++){
                int d=b;
                cin>>b;
                update(d-1,tree[b-1+n]);
            }
            update(b-1,first);
        }
        else if(c==2){
            int a,b,m;
            cin>>a>>b>>m;
            ll f=0;
            for(int j=a;j<=b-m+1;j++){
                f+=sum(j-1,j+m-1);
            }
            cout<<f<<'\n';
        }
    }

}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 14 ms 1876 KB Output is correct
3 Correct 55 ms 1932 KB Output is correct
4 Correct 134 ms 1948 KB Output is correct
5 Correct 220 ms 1956 KB Output is correct
6 Correct 355 ms 2220 KB Output is correct
7 Correct 488 ms 1996 KB Output is correct
8 Correct 693 ms 2016 KB Output is correct
9 Correct 1388 ms 2172 KB Output is correct

Subtask #2
0 / 56.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 2260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2090 ms 2644 KB Time limit exceeded
2 Halted 0 ms 0 KB -