oj.uz

Submission #498582

# Submission time Handle Problem Language Result Execution time Memory
498582 2021-12-25T14:58:49 Z shmad Addk (eJOI21_addk) C++17
36 / 100
 2000 ms 3376 KB 
#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;

const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 60);

void solve () {
    int n, k;
    cin >> n >> k;
    vt<int> a(n + 1), p(n + 1, 0);
    for (int i = 1; i <= n; i++) cin >> a[i], p[i] = p[i - 1] + a[i];
	partial_sum(all(p), p.begin());
	int q;
	cin >> q;
	while (q--) {
		int tp;
		cin >> tp;
		if (tp == 1) {
			vt<int> pos(k + 1), v;
			for (int i = 1; i <= k; i++) cin >> pos[i], v.pb(a[pos[i]]);
	        int x = v[0];
	        for (int i = 0; i < k - 1; i++) a[pos[i + 1]] = v[i + 1];
			a[pos[k]] = x;
			for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i];
			partial_sum(all(p), p.begin());
		}
		if (tp == 2) {
			int l, r, m;
			cin >> l >> r >> m;
			int ans = p[r] - (p[r - m] + p[l + m - 2]) + (l - 2 >= 1 ? p[l - 2] : 0);
			cout << ans << '\n';
		}
	}
	cout << '\n';
}

bool testcases = 0;
                  
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int test = 1;
    if (testcases) cin >> test;
    for (int cs = 1; cs <= test; cs++) {
        solve();
    }
}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Correct 7 ms 448 KB Output is correct
7 Correct 9 ms 460 KB Output is correct
8 Correct 12 ms 508 KB Output is correct
9 Correct 22 ms 588 KB Output is correct

Subtask #2
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 900 KB Output is correct
2 Correct 169 ms 1112 KB Output is correct
3 Correct 290 ms 1612 KB Output is correct
4 Correct 882 ms 2448 KB Output is correct
5 Correct 1722 ms 3376 KB Output is correct
6 Execution timed out 2076 ms 2608 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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