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<bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
int Q=X.size();
int n=A.size();
std::vector<int> answer(Q);
for (int j=0;j<Q;j++) {
A[X[j]]=V[j];
for(int i=0;i<n;++i){
int kek=0;
for(int k=0;k<i;++k)if(A[k]>A[i])++kek;
answer[j]=max(answer[j],kek);
}
}
return answer;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |