Submission #230188

#TimeUsernameProblemLanguageResultExecution timeMemory
230188mohamedsobhi777Bubble Sort 2 (JOI18_bubblesort2)C++14
38 / 100
9077 ms2496 KiB
#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 , aux[j].second - j ) ; } ret.push_back(ans); } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...