Submission #957095

#	Time	Username	Problem	Language	Result	Execution time	Memory
957095		MuntherCarrot	Bubble Sort 2 (JOI18_bubblesort2)	C++14	60 / 100	3702 ms	12116 KiB

bubblesort2

// by me
#include "bubblesort2.h"
 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(), x.end()
 
std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V){
	int Q = X.size();
	int N = A.size();
	vector<int> ans(Q, 0);
	if(N <= 8000){
		for(int i = 0; i < Q; i++){
			A[X[i]] = V[i];
			vector<int> f(N);
			iota(all(f), 0);
			sort(all(f), [&](int a, int b){
				return A[a] < A[b];
			});
			for(int j = 0; j < N; j++){
				ans[i] = max(ans[i], f[j] - j);
			}
		}
		return ans;
	}
	vector<set<int>> f(101);
	for(int i = 0; i < N; i++){
		f[A[i]].insert(i);
	}
	for(int i = 0; i < Q; i++){
		f[A[X[i]]].erase(X[i]);
		A[X[i]] = V[i];
		f[A[X[i]]].insert(X[i]);
		int x = 0;
		for(auto &st : f){
			if(st.empty()) continue;
			x += st.size();
          	int mx = *prev(st.end());
			ans[i] = max(ans[i], mx - x + 1);
		}
	}
	return ans;
}
 
//
/*
int readInt(){
	int i;
	if(scanf("%d",&i)!=1){
		fprintf(stderr,"Error while reading input\n");
		exit(1);
	}
	return i;
}
 
int main(){
	int N,Q;
	N=readInt();
	Q=readInt();
 
	std::vector<int> A(N);
	for(int i=0;i<N;i++)
		A[i]=readInt();
 
	std::vector<int> X(Q),V(Q);
	for(int j=0;j<Q;j++){
		X[j]=readInt();
		V[j]=readInt();
	}
 
	std::vector<int> res=countScans(A,X,V);
 
	for(int j=0;j<int(res.size());j++)
		printf("%d\n",res[j]);
}
//*/
// by me

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