# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
826175 |
2023-08-15T10:55:10 Z |
Knight |
Addk (eJOI21_addk) |
C++14 |
|
1172 ms |
2704 KB |
#include <iostream>
using namespace std;
int main() {
int N, K, l, r, m, S;
int *A;
cin >> N >> K;
A = new int[N];
int Temp;
for(int i = N;i>0;i--){
cin >> Temp;
A[N-i] = Temp;
}
int Q;
cin >> Q;
int *permList;
permList = new int[K];
int extraTemp;
for(int t = Q;t>0;t--){
int type;
cin >> type;
switch (type){
case 1:
if(K!=1){
for(int i=0;i<K;i++){
cin >> Temp;
permList[i] = Temp-1;
}
Temp = A[permList[0]];
for(int i=K-1;i>=0;i--){
extraTemp = Temp;
Temp = A[permList[i]];
A[permList[i]] = extraTemp;
}
}else{
cin >> Temp;
}
/*for(int i = 0;i<N;i++){
cout << A[i] << ' ';
}
cout << '\n';*/
break;
case 2:
cin >> l >> r >> m;
//cout << l << ' ' << r << '\n';
S = 0;
for(int i=l-1;i<r;i++){
int a=i-l+2;
int c=r-i;
if (a <= m && a <= c)
S+=A[i]*a;
else if (m <= a && m <= c)
S+=A[i]*m;
else
S+=A[i]*c;
//cout << S << '\n';
}
cout << S;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
304 ms |
1136 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1172 ms |
2704 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |