Submission #364432

#TimeUsernameProblemLanguageResultExecution timeMemory
364432Jarif_RahmanBubble Sort 2 (JOI18_bubblesort2)C++17
0 / 100
9094 ms620 KiB
#include "bubblesort2.h" #include <bits/stdc++.h> #define pb push_back #define f first #define sc second using namespace std; typedef long long int ll; typedef string str; vector<int> countScans(vector<int> a, vector<int> in, vector<int> v){ int n = a.size(), q = v.size(); vector<int> ans(q); for(int i = 0; i < q; i++){ a[in[i]] = v[i]; ans[i] = 0; for(int j = 0; j < n; j++) for(int k = 0; k < j; k++) if(a[k] > a[j]) ans[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...