Submission #1357157

#TimeUsernameProblemLanguageResultExecution timeMemory
1357157nathlol2Bubble Sort 2 (JOI18_bubblesort2)C++20
0 / 100
9089 ms580 KiB
#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(), q = X.size();
	vector<int> ans(q);
	for(int i = 0;i<q;i++){
		A[X[i]] = V[i];
		int mx = 0;
		for(int i = 0;i<n;i++){
			for(int j = i + 1;j<n;j++){
				if(A[i] > A[j]){
					mx = max(mx, j - i);
				}
			}
		}
		ans[i] = mx;
	}
	return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...