oj.uz

Submission #761458

# Submission time Handle Problem Language Result Execution time Memory
761458 2023-06-19T17:19:22 Z happypotato Bubble Sort 2 (JOI18_bubblesort2) C++17
0 / 100
 9000 ms 596 KB 
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> countScans(vector<int> a, vector<int> X, vector<int> V) {
	int n = a.size();
	int Q = X.size();
	vector<int> finans;
	for (int i = 0; i < Q; i++) {
		a[X[i]] = V[i];
		int ans = 0;
		for (int j = 0; j < n; j++) {
			for (int k = j + 1; k < n; k++) {
				if (a[j] > a[k]) ans = max(ans, k - j);
			}
		}
		finans.push_back(ans);
	}
	return finans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 137 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 137 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9100 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 137 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -