Submission #1141075

#TimeUsernameProblemLanguageResultExecution timeMemory
1141075Noproblem29Bubble Sort 2 (JOI18_bubblesort2)C++20
38 / 100
9081 ms1620 KiB
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> countScans(vector<int> a,vector<int> x,vector<int> v){
	int q=x.size();
	int n=a.size();
	vector<int> ans(q);
	for(int j=0;j<q;j++){
		a[x[j]]=v[j];
		vector<int>ord;
		for(int i=0;i<n;i++){
			ord.push_back(i);
		}
		sort(ord.begin(),ord.end(),[&a](int x,int y){
			if(a[x]==a[y]){
				return x<y;
			}
			return a[x]<a[y];
		});
		for(int i=0;i<n;i++){
			ans[j]=max(ans[j],ord[i]-i);
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...