oj.uz

Submission #844596

# Submission time Handle Problem Language Result Execution time Memory
844596 2023-09-05T14:28:06 Z XXBabaProBerkay Addk (eJOI21_addk) C++11
0 / 100
 57 ms 2224 KB 
#pragma	GCC optimize("O3")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second

using ll = long long int;
using pi = pair<int,int>;
using str = string;

const int INF = 1e9 + 7;
const int MOD = 998244353;

int gcd(int a, int b) { return (b==0) ? a : gcd(b, a%b); }
int lcm(int a, int b) { return a*b/gcd(a, b); }

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);

	int n,k; cin >> n >> k;
	vector<int> a(n+1),pref(n+1, 0),preff(n+1, 0);
	for(int i=1; i<=n; i++) {
		cin >> a[i];
		pref[i] = pref[i-1] + a[i];
		preff[i] = preff[i-1] + pref[i];
	}
	int Q; cin >> Q;
	while(Q--) {
		int q; cin >> q;
		if(q==1) {
			int x; cin >> x;
		}
		else {
			int l,r,m; cin >> l >> r >> m;
			int ans = 0;
			for(int i=r; i>=l+m-1; --i) ans += pref[i];
			for(int i=l-1; i<=r-m; i++) ans -= pref[i];
			cout << ans << "\n";
		}
	}
}

// 7  2  5  1  9  3  4  6
// 7  9  14  15  24  27  31  17
// 7  16  30  45  69  96  127  144

Subtask #1
0 / 36.0

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

Subtask #2
0 / 56.0

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

Subtask #3
0 / 8.0

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