#include "bubblesort2.h"
#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "/home/ahmetalp/Desktop/Workplace/debug.h"
#else
#define debug(...) void(23)
#endif
std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V){
int N = int(A.size());
int Q = int(X.size());
std::vector<int> ans(Q);
for (int i = 0; i < Q; ++i) {
A[X[i]] = V[i];
int& res = ans[i];
for (int j = 0; j < N; ++j) {
int x = 0;
for (int k = 0; k < j; ++k) {
x += A[k] > A[j];
}
res = std::max(res, x);
}
}
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... |