# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363185 | buyolitsez | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
vector <int> countScans(vector<int> a, vector<int> x, vector<int> v) {
int n = a.size(), q = x.size();
vector <int> s(q);
for(int f = 0; f < q; ++f) {
a[x[f]] = v[f];
int cnt = 0;
vector<int> b = a;
for(int i = 0; i < n; ++i) {
bool flag = 0;
for (int j = 0; j + 1 < n; ++j) {
if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
flag = 1;
}
}
cnt += (flag);
}
swap(a, b);
s[f] = cnt;
}
return s;
}
signed main() {
vector <int> ans = countScans({1, 2, 3, 4}, {0, 2}, {3, 1});
for (auto u : ans) {
cout << u << '\n';
}
}