# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650067 | boris_mihov | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9034 ms | 724 KiB |
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 <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
typedef long long llong;
const int MAXN = 500000 + 10;
const int INF = 1e9;
int b[MAXN];
int a[MAXN], n;
int smaller[MAXN];
std::vector <int> ans;
int cnt;
void calc()
{
for (int i = 1 ; i <= n ; ++i) b[i] = a[i];
cnt = 0;
bool sorted = false;
while (!sorted)
{
sorted = true;
for (int i = 1 ; i <= n-1 ; ++i)
{
if (b[i] > b[i + 1])
{
sorted = false;
std::swap(b[i], b[i + 1]);
}
}
cnt += !sorted;
}
}
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V)
{
n = A.size();
for (int i = 1 ; i <= n ; ++i) a[i] = A[i-1];
ans.resize(X.size());
for (int i = 0 ; i < X.size() ; ++i)
{
a[X[i] + 1] = V[i];
calc();
ans[i] = cnt;
}
return ans;
}
Compilation message (stderr)
# | 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... |