oj.uz

Submission #633137

# Submission time Handle Problem Language Result Execution time Memory
633137 2022-08-21T16:45:00 Z giorgikob Addk (eJOI21_addk) C++14
0 / 100
 98 ms 1452 KB 
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define count1(x) __builtin_popcount(x)
#define endl '\n'
using namespace std;

const int N = 1e6+1, mod = 1e6, K = 31;

int n, k, q;
int tree[N][2], A[N];

void upd(ll val, int pos, int k){
    while(pos < N){
        tree[pos][k] += val;
        pos += (pos & -pos);
    }
}

ll get(int pos, int k){
    ll res = 0;
    while(pos){
        res += tree[pos][k];
        pos -= (pos & -pos);
    }

    return res;
}

ll range_query(int l, int r, int k){
    return get(r, k) - get(l-1, k);
}

inline void test_case(){

    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> A[i];
        upd(A[i], i, 0);
        upd(A[i]*i, i, 1);
    }

    cin >> q;
    while(q--){
        int type;
        cin >> type;
        if(type == 1){
            int ind[k];
            for(int i = 0; i < k; i++){
                cin >> ind[i];
            }
            for(int i = 0; i < k; i++){
                int a = ind[i], b = ind[(i+1)%k];
                upd(A[b] - A[a], a, 0);
                upd((A[b] - A[a])*a, a, 1);
            }
        } else {
            int l, r, m;
            cin >> l >> r >> m;
            int mid = (l+r)/2;
            int l1 = min(l+m-1, mid+1);
            int r1 = max(r-m+1, mid);
            if((r-l+1) >= m*2-1){
                l1 = l+m-1;
                r1 = r-m+1;
            } else {
                m = (r-l+1) - m + 1;
                l1 = l + m;
                r1 = r - m;
            }
            ll res1 = range_query(l, l1-1, 1) - (l-1)*range_query(l, l1-1, 0);
            //cout << res1 << endl;
            ll res2 = range_query(l1, r1, 0) * m;
            ll res3 = range_query(r1+1, r, 1) - (r1)*range_query(r1+1, r, 0);
            res3 = (r-r1+1)*range_query(r1+1, r, 0) - res3;
            //cout << res3 << endl;

            cout << res1 + res2 + res3 << endl;

            /*ll answer = 0;
            for(int i = l; i <= r-m+1; i++){
                for(int j = i; j <= i+m-1; j++){
                    answer += A[j];
                }
            }
            cout << answer << endl;*/
        }
    }
}

int main(){
    ios::sync_with_stdio(0);
    //cin.tie(0); cout.tie(0);

    int T = 1;
    //cin >> T;
    while(T--){
        test_case();
    }
}

Subtask #1
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Incorrect 4 ms 468 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 872 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 1452 KB Output isn't correct
2 Halted 0 ms 0 KB -