#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
std::vector<int> countScans(std::vector<int> a,std::vector<int> x,std::vector<int> v){
int n = a.size(), q = x.size();
vector <int> s(q, n - 1);
vector<int> b = a;
for(int f = 0; f < q; ++f) {
a[x[f]] = v[f];
b[x[f]] = v[f];
for (int i = 1; i < n; ++i) {
bool flag = 0;
for (int j = 1; j < n; ++j) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
}
}
if (!flag) {
s[f] = i - 1;
break;
}
}
a = b;
}
return s;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
322 ms |
492 KB |
Output is correct |
2 |
Correct |
1207 ms |
492 KB |
Output is correct |
3 |
Execution timed out |
9056 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
322 ms |
492 KB |
Output is correct |
2 |
Correct |
1207 ms |
492 KB |
Output is correct |
3 |
Execution timed out |
9056 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
9096 ms |
620 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
322 ms |
492 KB |
Output is correct |
2 |
Correct |
1207 ms |
492 KB |
Output is correct |
3 |
Execution timed out |
9056 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |