oj.uz

답안 #632436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632436 2022-08-20T04:20:32 Z pragmatist Addk (eJOI21_addk) C++17
36 / 100
 2000 ms 3232 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') {
			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
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 7 ms 392 KB Output is correct
5 Correct 10 ms 468 KB Output is correct
6 Correct 15 ms 468 KB Output is correct
7 Correct 22 ms 468 KB Output is correct
8 Correct 31 ms 588 KB Output is correct
9 Correct 58 ms 624 KB Output is correct

Subtask #2
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 1092 KB Output is correct
2 Correct 490 ms 1528 KB Output is correct
3 Correct 886 ms 1968 KB Output is correct
4 Execution timed out 2057 ms 3132 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 988 ms 3104 KB Output is correct
2 Execution timed out 2086 ms 3232 KB Time limit exceeded
3 Halted 0 ms 0 KB -