#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;
}
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] = stupid(A);
}
return answer;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
276 ms |
364 KB |
Output is correct |
2 |
Correct |
1018 ms |
492 KB |
Output is correct |
3 |
Execution timed out |
9004 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
276 ms |
364 KB |
Output is correct |
2 |
Correct |
1018 ms |
492 KB |
Output is correct |
3 |
Execution timed out |
9004 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
9023 ms |
620 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
276 ms |
364 KB |
Output is correct |
2 |
Correct |
1018 ms |
492 KB |
Output is correct |
3 |
Execution timed out |
9004 ms |
364 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |