# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363189 | r57shell | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 9097 ms | 620 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"
using namespace std;
static int stupid(vector<int> A)
{
int res = 0;
int n = A.size();
while (true)
{
bool was = false;
for (int i = 1; i < n; ++i)
{
if (A[i-1] > A[i])
{
swap(A[i-1], A[i]);
was = true;
}
}
if (was)
++res;
else
break;
}
return res;
}
static int stupid1(vector<int> A)
{
int n = A.size();
int res = 0;
for (int i = 1; i < n; ++i)
{
int c = 0;
for (int j = 0; j < i; ++j)
if (A[i] < A[j])
++c;
res = max(res, c);
}
return res;
}
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V)
{
int Q = X.size();
vector<int> answer(Q);
for (int j = 0; j < Q; j++)
{
A[X[j]] = V[j];
answer[j] = stupid1(A);
}
return answer;
}
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... |