Submission #1170509

#TimeUsernameProblemLanguageResultExecution timeMemory
1170509Math4Life2020Bubble Sort 2 (JOI18_bubblesort2)C++20
17 / 100
9093 ms612 KiB
#include <bits/stdc++.h> using namespace std; using ll = int; using pii = pair<ll,ll>; const ll Nm = 8000; ll A[Nm]; vector<int> countScans(vector<int> A1, vector<int> X, vector<int> V) { ll N = A1.size(); ll Q = X.size(); vector<int> ansV; for (ll i=0;i<N;i++) { A[i]=A1[i]; } for (ll q=0;q<Q;q++) { A[X[q]]=V[q]; ll ansc = 0; for (ll i=0;i<N;i++) { ll anst = 0; for (ll j=0;j<i;j++) { if (A[j]>A[i]) { anst++; } } ansc = max(anst,ansc); } ansV.push_back(ansc); } return ansV; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...