This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |