제출 #621429

#제출 시각아이디문제언어결과실행 시간메모리
621429pakapuAddk (eJOI21_addk)C++14
36 / 100
2094 ms1604 KiB
#pragma GCC optimize ("O3") #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<long long> sg(n); for(int i = 0; i < n; i++) { cin >> sg[i]; } int q; cin >> q; while(q--) { int x; cin >> x; if(x == 1) { vector<int> a(k); vector<long long> tmp(k); for(int i = 0; i < k; i++) { cin >> a[i]; a[i]--; tmp[i] = sg[a[i]]; } for(int i = 0; i < k; i++) { sg[a[((i - 1) % k + k) % k]] = tmp[i]; } } else if(x == 2) { int l, r, m; cin >> l >> r >> m; l--; r--; long long s = 0; long long mul = 1; long long mm = min(r - l + 1 - m + 1, m); for(int i = l; i < (r + l) / 2; i++) { s += sg[i] * min(mul, mm); mul++; } mul = 1; for(int i = r; i >= (r + l) / 2; i--) { s += sg[i] * min(mul, mm); mul++; } cout << s << '\n'; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...