oj.uz

Submission #632438

# Submission time Handle Problem Language Result Execution time Memory
632438 2022-08-20T04:22:45 Z pragmatist Addk (eJOI21_addk) C++17
0 / 100
 2000 ms 1228 KB 
    #include<bits/stdc++.h>
     
    #define ll long long
    #define nl "\n"
     
    using namespace std;
     
    const int N = (int)1e5 + 7;
     
    int n, k, q, a[N];
     
    int main() {
    	ios_base::sync_with_stdio(NULL);
    	cin.tie(0);
    	cout.tie(0);
    	cin >> n >> k;
    	for(int i = 1; i <= n; ++i) cin >> a[i];
    	cin >> q;
    	while(q--) {
    		char tp;
    		cin >> tp;
    		if(tp == '1') {
    			if(k == 1) continue;
    			vector<int> v(k);
    			for(auto &x : v) cin >> x;
    			int o = a[v[0]];
    			for(int i = 0; i < k - 1; ++i) a[v[i]] = a[v[i + 1]];
    			a[v.back()] = o;
    		} else {
    			int l, r, m;
    			cin >> l >> r >> m;
    			ll sum = 0, ans = 0;
    			for(int i = l; i <= l + m - 1; ++i) sum += a[i];
    			ans += sum;
    			for(int i = l + m; i <= r; ++i) {
    				sum += a[i];
    				sum -= a[i - m];
    				ans += sum;
    			}    
    			cout << ans << nl;
    		}
    	}
    	return 0;
    }

Subtask #1
0 / 36.0

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

Subtask #2
0 / 56.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 989 ms 952 KB Output is correct
2 Execution timed out 2059 ms 1228 KB Time limit exceeded
3 Halted 0 ms 0 KB -