oj.uz

답안 #475042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475042 2021-09-20T19:27:08 Z nickmet2004 Addk (eJOI21_addk) C++11
0 / 100
 189 ms 4808 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;
int n , k , q,a[N] , Y[11];
struct Node{
    int F , S;
    Node operator+(Node b){
        Node ret;
        ret.F = F + b.F;
        ret.S = S + b.S;
        return ret;
    }
};
struct ST{
    Node T[4*N];
    void upd(int id , int d , int l = 1 , int r = n , int pos = 1){
        if(id < l || id > r) return;
        if(l==r){
            T[pos].F = d , T[pos].S = d*id;
            return;
        }
        int mid = (l + r) >> 1;
        upd(id , d , l , mid , pos *2 + 1); upd(id , d , mid + 1 , r , pos * 2 + 2);
        T[pos] = T[pos * 2 + 1] + T[pos * 2 + 2];
    }
    Node get(int L , int R , int l = 1 , int r = n , int pos = 1){
        if(r < L || R < l) return {0 ,0};
        if(L<=l&&r<=R) return T[pos];
        int mid = (l + r) >> 1;
        return get(L , R , l , mid , pos * 2 + 1) + get(L , R ,mid + 1 , r , pos * 2 + 2);
    }
}L , R;
int main (){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n; ++i)cin >> a[i];
    for(int i = 1; i<= n; ++i)
        L.upd(i , a[i]) , R.upd(n - i + 1 , a[i]);
    cin >> q;

    while(q--){
        int tp;
        cin >> tp;
        if(tp==1){
            for(int i = 0; i < k; ++i)cin >> Y[i];
            sort(Y , Y + k);
            for(int i = 1; i < k; ++i) swap(a[Y[i]] , a[Y[i - 1]]);
            for(int i = 0; i < k; ++i) L.upd(Y[i] , a[Y[i]]) , R.upd(n - Y[i] + 1 , a[Y[i]]);
        }else {
            int l , r , m;
            cin >> l >> r >> m;
            m = min(m , r - l - m + 2);
            int ans = 0;
            ///
            Node gR = L.get(0 , l + m - 2);
            Node gL = L.get(0 , l - 1);
            ans += (gR.S - gL.S - (l - 1) * (gR.F - gL.F));
            ///
            ans += (r - l - m -m+2) * m;
            ///
            gR = R.get(0 , n - (r-m));
            gL = R.get(0 , n - r);
            ans += (gR.S - gL.S - (n - r) * (gR.F - gL.F));
            cout << ans << endl;
        }
    }
return 0;
}

Subtask #1
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 58 ms 1924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 189 ms 4808 KB Output isn't correct
2 Halted 0 ms 0 KB -