Submission #1141073

#TimeUsernameProblemLanguageResultExecution timeMemory
1141073Noproblem29Bubble Sort 2 (JOI18_bubblesort2)C++20
0 / 100
120 ms1124 KiB
#include "bubblesort2.h" #include <bits/stdc++.h> using namespace std; #define ll long long vector<int> countScans(vector<int> a,vector<int> x,vector<int> v){ int q=x.size(); int n=a.size(); vector<int> ans(q); for(int j=0;j<q;j++){ a[x[j]]=v[j]; int mn=a.back(); for(int i=n-1;i>=0;i--){ if(mn<a[i]){ ans[j]++; } mn=min(mn,a[i]); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...