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 "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
int Q=X.size();
vector<int> answer;
int n = (int)A.size();
for(int i = 0; i < Q; i++){
A[X[i]] = V[i];
auto b = A;
for(int it = 0; it <= n; it++){
bool f = false;
for(int j = 0; j + 1 < n; j++){
if(b[j] > b[j + 1]){
swap(b[j], b[j + 1]);
f = true;
}
}
if(!f){
answer.push_back(it);
break;
}
}
}
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... |