제출 #775650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775650		vjudge1	Addk (eJOI21_addk)	C++17	0 / 100	663 ms	3132 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef vector<int> vi;
typedef vector<vi> vvi;
int n,k;
template<typename IteratorType> void print(IteratorType first,IteratorType last){
	while(first != last){
		cout<<*first<<' ';
		first++;
	}
}
vector<ll> st,arr;
void build(int id,int l,int r){
	if(l==r){
		st[id] = arr[l];
		return;
	}
	int mid = (l+r)>>1;
	build(2*id,l,mid);
	build(2*id+1,mid+1,r);
	st[id] = st[2*id] + st[2*id+1];
}
void update(int id,int l,int r,int i,ll val){
	if(l>i || i>r) return;
	if(l==r){
		st[id] = val;
		return;
	}
	int mid = (l+r)/2;
	update(2*id,l,mid,i,val);
	update(2*id+1,mid+1,r,i,val);
	st[id] = (st[2*id] + st[2*id+1]);
}
ll query(int id,int l,int r,int u,int v){
	if(l>v || r<u || l>r) return 0;
	if(l>=u && r<=v){
		return st[id];
	}
	int mid = (l+r)/2;
	ll a = query(2*id,l,mid,u,v);
	ll b = query(2*id+1,mid+1,r,u,v);
	return a+b;
}
signed main(){
	cin>>n>>k;
	arr.resize(n+1); st.resize(4*(n+1));
	for(int i=1;i<=n;++i){
		cin>>arr[i];
	}
	build(1,1,n);
	vector<int> change(k+1);
	int q,l,r,m; cin>>q;
	while(q-->0){
		int cmd; cin>>cmd;
		if(cmd==1){
			for(int i=0;i<k;++i){
				cin>>change[i];
			}
			ll temp = arr[change[0]];
			for(int i=0;i<k-1;++i){
				arr[change[i]] = arr[change[i+1]];
				update(1,1,n,change[i],arr[change[i]]);
			}
			arr[change[k-1]] = temp;
			update(1,1,n,change[k-1],arr[change[k-1]]);
		}
		else{
			cin>>l>>r>>m;
			ll res = 0, h = query(1,1,n,l,r);
			int p1 = l, p2 = r;
			while(p1<=p2 && p2 - l +1 >= m){
				res += h;
				h -= arr[p1] + arr[p2];
				p1++, p2--;
			}
			cout<<res<<'\n';
		}
	}
}

• Subtask 1: 0 / 36
• Subtask 2: 0 / 56
• Subtask 3: 0 / 8