oj.uz

Submission #848119

# Submission time Handle Problem Language Result Execution time Memory
848119 2023-09-11T11:25:03 Z JoksimKaktus Addk (eJOI21_addk) C++17
92 / 100
 2000 ms 3908 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    int n,k;
    cin >> n >> k;
    vector <int> v(n+1);
    vector <long long> pre(n+1);
    pre[0] = 0;
    for(int i = 1;i <= n;i++){
        cin >> v[i];
        pre[i] = pre[i-1] + v[i];
    }
    int q;
    cin >> q;
    for(int i = 0;i < q;i++){
        int qu,l,r,m;
        cin >> qu;
        if(qu == 2){
            cin >> l >> r >> m;
            int rr = r;
            int ll = l-1;
            long long sum = 0;
            for(int j = 0; j < min(m,(r-l)+2-m);j++){
                sum += pre[rr] - pre[ll];
                ll++;
                rr--;
            }
            cout << sum << "\n";
        }else{
            vector <int> ind(k);
            vector <long long> res(n+1);
            for(int i = 0;i < k;i++){
                cin >> ind[i];
            }
            for(int i = 0;i < k-1;i++){
                int diff = v[ind[i+1]] - v[ind[0]];
                res[ind[i]] += diff;
                res[ind[i+1]] -= diff;
            }
            for(int j = ind[0];j <= ind[k-1];j++){
                res[j] = res[j-1] + res[j];
                pre[j] += res[j];
            }
        }
    }
    return 0;
}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 4 ms 532 KB Output is correct
6 Correct 5 ms 600 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 15 ms 604 KB Output is correct

Subtask #2
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 956 KB Output is correct
2 Correct 119 ms 1368 KB Output is correct
3 Correct 214 ms 1816 KB Output is correct
4 Correct 699 ms 3072 KB Output is correct
5 Correct 1099 ms 3908 KB Output is correct
6 Correct 1159 ms 3656 KB Output is correct
7 Correct 961 ms 3620 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2052 ms 1928 KB Time limit exceeded
2 Halted 0 ms 0 KB -