oj.uz

Submission #502573

# Submission time Handle Problem Language Result Execution time Memory
502573 2022-01-06T09:18:17 Z uncripted Addk (eJOI21_addk) C++11
92 / 100
 250 ms 4140 KB 
#include<bits/stdc++.h>
using namespace std;
long long pre[100005];
	long long n,k;
long long b1[100005],b2[100005];
void update(long long bit[], long long v, long long x){
	while(v<=n){
		bit[v]+=x;
		v+=v&(-v);
	}
	
	
}
void up(long long l, long long r, long long x){
	update(b1, l, x);
	update(b1, r+1, -x);
	update(b2, l, (l-1)*x);
	update(b2, r+1, -r*x);
}
long long presum(long long bit[], long long v){
	long long s=0;
	while(v>0){
		
	s+=bit[v];
	v-=v&(-v);
	}
	return s;
	
}
long long sum(long long l,long long  r){
	return presum(b1, r)*r-presum(b2, r)-(presum(b1, l-1)*(l-1)-presum(b2, l-1));
}

int main(){

	cin>>n>>k;
	long long a[n+1];

	long long prefix=0;
	for(long long i=1; i<=n; i++){
		cin>>a[i];
		prefix+=a[i];
		up(i,i,prefix);
		
	
	}
	long long q;
	cin>>q;
	while(q--){
		long long x;
		cin>>x;
		if(x==1){
			long long b[k+1];
		for(long long i=1; i<=k; i++){
			
			cin>>b[i];
		}
		up(b[k],n,a[b[1]]-a[b[k]]);
		for(long long i=1; i<k; i++){
		up(b[i],n, a[b[i+1]]-a[b[i]] );
		}
		continue;	
		}
		long long l,r,m;
		cin>>l>>r>>m;
		
		long long s=0;
		s+=sum(l+m-1, r);
		s-=sum(l-1, r-m);
			
		cout<<s<<endl;
	}
	
	
}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 10 ms 436 KB Output is correct
6 Correct 12 ms 460 KB Output is correct
7 Correct 14 ms 528 KB Output is correct
8 Correct 18 ms 532 KB Output is correct
9 Correct 23 ms 588 KB Output is correct

Subtask #2
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1056 KB Output is correct
2 Correct 73 ms 1384 KB Output is correct
3 Correct 102 ms 1808 KB Output is correct
4 Correct 182 ms 2936 KB Output is correct
5 Correct 246 ms 4140 KB Output is correct
6 Correct 250 ms 3976 KB Output is correct
7 Correct 243 ms 3880 KB Output is correct

Subtask #3
0 / 8.0

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