Submission #97798

#TimeUsernameProblemLanguageResultExecution timeMemory
97798scanhexBubble Sort 2 (JOI18_bubblesort2)C++17
0 / 100
9044 ms512 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...