Submission #143844

#	Time	Username	Problem	Language	Result	Execution time	Memory
143844		shashwatchandra	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	5705 ms	222140 KiB

bubblesort2

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

using namespace std;

#define all(v) v.begin(),v.end()
#define pb push_back
#define REP(i,n) for(int i = 0;i < n;i++)
#define RE(i,n) for(int i = 1;i <= n;i++)

const int N = 1e6+1;
int seg[4*N];
int f[4*N];
int lazy[4*N];
set<int> best[N];
map<int,int> cool;
vector<int> comp;
int n;

#define mid (l+r)/2
#define child 2*node

void build(int node,int l,int r){
	lazy[node] = 0;
	if(l == r){
		f[node] = 0;
		seg[node] = -*best[l].begin();
		return;
	}
	build(child,l,mid);
	build(child+1,mid+1,r);
	seg[node] = max(seg[child+1],seg[child]);
}

inline void pushdown(int node,int l,int r,bool goat = 1){
	seg[node] -= lazy[node];
	f[node] -= lazy[node];
	if(l != r){
		lazy[child] += lazy[node];
		lazy[child+1] += lazy[node];
		if(goat){
			pushdown(child,l,mid,0);
			pushdown(child+1,mid+1,r,0);
		}
	}
	lazy[node] = 0;
	return;
}

int wow(int node,int l,int r,int ind){
	pushdown(node,l,r);
	if(l == r)return -f[node];
	if(ind <= mid)return wow(child,l,mid,ind);
	return wow(child+1,mid+1,r,ind);
}

void add(int node,int l,int r,int start,int end,int val,bool print = 0){
	if(print)cout << l << " " << r << endl;
	pushdown(node,l,r);
	if(l > end or start > r)return;
	if(start <= l and r <= end){
		if(print)cout << l << " " << r << endl;
		lazy[node] += val;
		pushdown(node,l,r);
		return;
	}
	add(child,l,mid,start,end,val,print);
	add(child+1,mid+1,r,start,end,val,print);
	seg[node] = max(seg[child+1],seg[child]);
}

void update(int node,int l,int r,int ind,bool print = 0){
	if(print)cout << l << " " << r << endl;
	pushdown(node,l,r);
	if(l == r){
		if(print)cout << -f[node] << " " << -*best[l].begin() << endl;
		seg[node] = f[node]-*best[l].begin();
		return;
	}
	if(ind <= mid)update(child,l,mid,ind,print);
	else update(child+1,mid+1,r,ind,print);
	//cout << "TELLL ME WHYY " << endl;
	//cout << node << " " << seg[node] << endl;
	seg[node] = max(seg[child+1],seg[child]);
	//cout << node << " " << seg[node] << endl;
}

int cur = 0;

void compress(){
	sort(all(comp));
	REP(i,comp.size()){
		if(!i or comp[i] != comp[i-1]){
			cur++;
			best[cur].insert(0);
			cool[comp[i]] = cur;
		}
	}
}

vector<int> countScans(vector<int> a,vector<int> x,vector<int> v){
	vector<int> answer;
	n = a.size();
	int q = x.size();
	REP(i,n)comp.pb(a[i]);
	REP(i,q)comp.pb(v[i]);
	compress();
	REP(i,n){
		a[i] = cool[a[i]];
		//cout << a[i] << " ";
		best[a[i]].insert(-(i+1));
	}
	//cout << endl;
	REP(i,q){
	//	cout << v[i] << " ";
		v[i] = cool[v[i]];
	}
	//cout << endl;
	build(1,1,cur);
	REP(i,n){
		add(1,1,cur,a[i],cur,1);
	}	
	
	REP(i,q){
		int ind = x[i];
		int val = v[i];
		if(a[ind] != val){
			int upd = (a[ind] > val)?1:-1;
			add(1,1,cur,min(a[ind],val),max(a[ind],val)-1,upd);
			//cout << "AINT NOTHING " << seg[5] << endl;
			RE(i,cur){
			//	cout << i << " " << wow(1,1,cur,i) << endl;
			}
		//	print(1,1,cur);
			best[a[ind]].erase(-(ind+1));
			best[val].insert(-(ind+1));
			update(1,1,cur,a[ind],0);
			update(1,1,cur,val,0);
		//	print(1,1,cur);
			a[ind] = val;
		}
		//pushdown(1,1,cur);
		answer.push_back(seg[1]);
	}
	return answer;
}

Compilation message (stderr)

bubblesort2.cpp: In function 'void compress()':
bubblesort2.cpp:8:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,n) for(int i = 0;i < n;i++)
bubblesort2.cpp:92:6:
  REP(i,comp.size()){
      ~~~~~~~~~~~~~                
bubblesort2.cpp:92:2: note: in expansion of macro 'REP'
  REP(i,comp.size()){
  ^~~

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