제출 #1188856

#제출 시각아이디문제언어결과실행 시간메모리
1188856alexddBubble Sort 2 (JOI18_bubblesort2)C++20
38 / 100
9091 ms1732 KiB
#include "bubblesort2.h" #include<bits/stdc++.h> using namespace std; std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V) { vector<pair<int,int>> v; vector<int> sol; for(int i=0;i<X.size();i++) { v.clear(); A[X[i]] = V[i]; for(int j=0;j<A.size();j++) v.push_back({A[j],j}); sort(v.begin(),v.end()); int mxm=0; for(int j=0;j<v.size();j++) mxm = max(mxm, v[j].second - j); sol.push_back(mxm); } return sol; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...