Submission #619637

#	Time	Username	Problem	Language	Result	Execution time	Memory
619637		bigo	Addk (eJOI21_addk)	C++14	0 / 100	72 ms	4620 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define fori(i,sta,fin) for(ll i=sta;i<fin;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
#define MOD 1000000007

int main() {
	int n, k;
	cin >> n >> k;
	vector<int>vec(n);
	for (int i = 0; i < n; i++)
		cin >> vec[i];
	vector<ll>pre(n);
	pre[0] = vec[0];
	for (int i = 1; i < n; i++)
		pre[i] = pre[i - 1] + vec[i];
	vector<ll>ppre(n);
	ppre[0] = pre[0];
	for (int i = 1; i < n; i++)
		ppre[i] = ppre[i - 1] + pre[i];
	vector<ll>suf(n);
	suf[0] = vec[n-1];
	for (int i = 1; i < n; i++)
		suf[i] = suf[i - 1] + vec[n-i-1];
	vector<ll>ssuf(n);
	ssuf[0] = suf[0];
	for (int i = 1; i < n; i++)
		ssuf[i] = ssuf[i - 1] + suf[i];
	int q;
	cin >> q;
	while (q--) {
		int f;
		cin >> f;
		if (f == 2) {
			int l, r, m;
			cin >> l >> r >> m;
			l--, r--;
			ll ans = 0;
			int n1 = r - l + 1;
			int t = n1 - m + 1;
			t = min(t, m);
			ans += ssuf[n - l - 1] - ssuf[n - (l + t) - 1] - t * suf[n - (l + t) - 1];
			ans += ppre[r] - ppre[r - t] - pre[r - t] * t;
			int r1 = r - t + 1;
			int l1 = l + t - 1;
			int n2 = r1 - l1 - 1;
			if (n2 < 0) {
				ans -= t * vec[r1];
			}
			else if (n2 > 0) {
				if (l1 + t != 0)
					ans += t * (pre[r1 - t - 1] - pre[l1 + t - 1]);
				else
					ans += t * (pre[r1 - t - 1]);
			}
			cout << ans << endl;
		}
		else {
			int a1;
			cin >> a1;
		}
	}
}

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