Submission #633526

#	Time	Username	Problem	Language	Result	Execution time	Memory
633526		Arinoor	Bubble Sort 2 (JOI18_bubblesort2)	C++17	0 / 100	9095 ms	2396 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;

#define all(x)			x.begin(), x.end()
#define pb				push_back
#define mp				make_pair
#define fi				first
#define se				second
#define bug(x)			cerr << #x << " : " << x << '\n'

typedef pair<int, int> pii;
const int maxn = 2e5 + 10;

int n, q;
int a[maxn], b[maxn];

int solve(){
	vector<pii> V;
	for(int i = 0; i < n; i ++){
		V.pb(mp(a[i], i));
	}
	sort(all(V));
	for(int i = 1; i <= n; i ++){
		b[V[i - 1].se] = i;
	}
	set<int> S;
	S.insert(n + 1);
	int ans = 0;
	for(int i = n - 1; ~i; i --){
		auto it = S.lower_bound(b[i]);
		ans = max(ans, (*it) - b[i]);
		S.insert(b[i]);
	}
	return ans - 1;
}

vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
	n = A.size();
	q = X.size();
	for(int i = 0; i < n; i ++)
		a[i] = A[i];
	vector<int> ans;
	for(int i = 0; i < q; i ++){
		a[X[i]] = V[i];
		ans.pb(solve());
	}
	return ans;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40