oj.uz

답안 #632467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632467 2022-08-20T06:07:44 Z pragmatist Addk (eJOI21_addk) C++17
36 / 100
 2000 ms 1788 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];

ll p[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];
		p[i] = p[i - 1] + 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;
			for(int i = 1; i <= n; ++i) {
				p[i] = p[i - 1] + a[i];
			}
		} else {
			int l, r, m;
			cin >> l >> r >> m;
			ll ans = 0;
			for(int i = l + m - 1; i <= r; ++i) ans += p[i];
			for(int i = l - 1; i <= r - m; ++i) ans -= p[i];
			cout << ans << nl;	
		}
	}
	return 0;
}

Subtask #1
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 9 ms 416 KB Output is correct
6 Correct 14 ms 412 KB Output is correct
7 Correct 19 ms 464 KB Output is correct
8 Correct 26 ms 464 KB Output is correct
9 Correct 50 ms 468 KB Output is correct

Subtask #2
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 780 KB Output is correct
2 Correct 427 ms 1076 KB Output is correct
3 Correct 786 ms 1236 KB Output is correct
4 Execution timed out 2099 ms 1788 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2070 ms 1240 KB Time limit exceeded
2 Halted 0 ms 0 KB -