Submission #924533

#	Time	Username	Problem	Language	Result	Execution time	Memory
924533		12345678	Bubble Sort 2 (JOI18_bubblesort2)	C++17	38 / 100	9095 ms	2392 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=5e5+5;
int dp[nx];

std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
	int Q=X.size(), N=A.size();
	for (int i=0; i<N; i++) dp[i]=0;
	vector<int> answer(Q);
	for (int i=0; i<N; i++) for (int j=0; j<i; j++) if (A[j]>A[i]) dp[i]++;
	for (int i=0; i<Q; i++) {
		int idx=X[i], vl=V[i], ans=0;
		for (int j=idx+1; j<N; j++) if (A[idx]>A[j]) dp[j]--;
		dp[idx]=0;
		A[idx]=vl;
		for (int j=0; j<idx; j++) if (A[j]>A[idx]) dp[idx]++;
		for (int j=idx+1; j<N; j++) if (A[idx]>A[j]) dp[j]++;
		for (int j=0; j<N; j++) ans=max(ans, dp[j]);
		answer[i]=ans;
	}
	return answer;
}

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