#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
// void setup()
// {
// #ifndef ONLINE_JUDGE
// freopen("test.inp", "r", stdin);
// freopen("test.out", "w", stdout);
// #endif
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
// }
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V)
{
vector<int> res;
res.resize(X.size());
int a;
bool found;
for (int i = 0; i < X.size(); ++i)
{
A[X[i]] = V[i];
a = 0;
found = true;
while (found)
{
found = false;
for (int i = 0; i + 1 < A.size(); ++i)
{
if (A[i] > A[i + 1])
{
swap(A[i], A[i + 1]);
found = true;
}
}
a += found;
}
res[i] = a;
}
return res;
}
// int main()
// {
// setup();
// return 0;
// }
# | 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... |