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 ;
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
int Q=A.size();
int B = X.size() ;
vector<int> ret ;
for(int i = 0 ;i < B ;i++){
A[X[i]] = V[i] ;
vector<pair<int,int> > aux ;
for(int j = 0;j < Q ;j ++){
aux.push_back({A[j] , j}) ;
}
sort(aux.begin() , aux.end()) ;
int ans = 0 ;
for(int j = 0 ;j < Q ; j++){
ans = max(ans , abs(aux[j].second - j)) ;
}
ret.push_back(ans);
}
return ret;
}
# | 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... |