# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826175 | Knight | Addk (eJOI21_addk) | C++14 | 1172 ms | 2704 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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--){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |