# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1041179 | Jer | Addk (eJOI21_addk) | C++17 | 1257 ms | 3520 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100'000;
int n, k, q;
long long A[MAXN];
int main(){
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &A[i]);
long t, l, r, m;
long long res;
scanf("%d", &q);
vector<long long> out;
for (int i = 0; i < q; i++){
scanf("%ld", &t);
if (t == (long)2){
scanf("%ld %ld %ld", &l, &r, &m);
res = 0, r--, l--;
for (int i = l; i <= r; i++)
res += (min({m - 1, i - l, r - i + 1}) + ((r - i + 1) >= m)) * A[i];
out.push_back(res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |