oj.uz

Submission #58926

# Submission time Handle Problem Language Result Execution time Memory
58926 2018-07-19T20:26:55 Z khohko Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 9000 ms 289780 KB 
#include<bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
#define ll int
#define fr first
#define sc second
#define pb push_back
#define ARRS ((ll)(2e6+100))
#define MAX ((ll)(1e9+100))



ll wl,wr,wx,wi;
struct nodes{
	nodes *L,*R;
	int x;
	nodes(){
		L=R=NULL;
		x=0;
	}
	void updt(){
		x=0;
		if(L)x+=L->x;
		if(R)x+=R->x;
	}
};

void updt(ll l,ll r,nodes *& x){
	if(wi<l||r-1<wi)return;
	if(!x)x=new nodes();
	if(l==r-1){
		x->x+=wx;
		return;
	}
	updt(l,l+r>>1,x->L);
	updt(l+r>>1,r,x->R);
	x->updt();
}

ll quer(ll l,ll r,nodes *& x){
	if(wr<l||r-1<wl)return 0;
	if(!x)return 0;
	if(wl<=l&&r-1<=wr)return x->x;
	return quer(l,l+r>>1,x->L)
				+quer(l+r>>1,r,x->R);
}

struct node{
	node *L,*R;
	int x,s;
	node(){
		L=R=NULL;
		s=0;
		x=-MAX;
	}
	void updt(){
		x=-MAX;
		if(L)x=max(x,L->x);
		if(R)x=max(x,R->x);
	}
	void shep(ll y){
		s+=y;
		x+=y;
	}
	void shplit(){
		if(!L)L=new node();
		if(!R)R=new node();
		L->shep(s);
		R->shep(s);
		s=0;
	}
};

void updt(ll l,ll r,node *& x){
	if(wr<l||r-1<wl)return;
	if(!x)x=new node();
	if(wl<=l&&r-1<=wr){
		x->shep(wx);
		return;
	}
	x->shplit();
	updt(l,l+r>>1,x->L);
	updt(l+r>>1,r,x->R);
	x->updt();
}

void updt1(ll l,ll r,node *& x){
	if(wr<l||r-1<wl)return;
	if(!x)x=new node();
	if(wl<=l&&r-1<=wr){
		x->x=wx;
		x->s=0;
		return;
	}
	x->shplit();
	updt1(l,l+r>>1,x->L);
	updt1(l+r>>1,r,x->R);
	x->updt();
}

set<ll> mp[ARRS];

node *rt=NULL;
nodes *rts=NULL;

void up(ll x){
	if(mp[x].size()){
		wl=x+1; wr=MAX;

		wx=-(*mp[x].begin())+quer(-MAX,MAX,rts);
		wl=wr=x;
//		cout<<wl<<" "<<wx<<" "<<x<<" "<<(-*mp[x].begin())<<endl;
		updt1(-MAX,MAX,rt);
	}
	else {
		wl=wr=x;
		wx=-MAX;
		updt1(-MAX,MAX,rt);
	}
}

ll a[ARRS],n;
map<ll,ll> em;

void quer(ll i,ll x){

	mp[a[i]].erase(n-i-1);
	mp[x].insert(n-i-1);

	wi=a[i];
	wx=-1;
	updt(-MAX,MAX,rts);

	wi=x;
	wx=1;
	updt(-MAX,MAX,rts);

	up(x);
	up(a[i]);
	if(a[i]<=x){
		wl=a[i]+1;
		wr=x-1;
		wx=1;
	}
	else {
		wl=x+1;
		wr=a[i]-1;
		wx=-1;
	}
	updt(-MAX,MAX,rt);
	a[i]=x;
}


vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
	n=A.size();
	ll q=X.size();
	vector<int> PAS;
	vector<int> b;
	for(auto x:A)
		b.pb(x);
	for(auto x:V)
		b.pb(x);
	sort(b.begin(),b.end());
	ll C=1;
	for(int i=0; i<b.size(); i++){
		if(b[i]!=b[i-1]||!i)
			em[b[i]]=C++;
	}
	for(auto &x:A)
		x=em[x];
	for(auto &x:V)
		x=em[x];

	for(int i=0; i<n; i++){
		a[i]=A[i];
//		cout<<a[i]<<" ";
		wi=a[i];
		wx=1;
		updt(-MAX,MAX,rts);
	}
	for(int i=0; i<n; i++){
		mp[a[i]].insert(n-i-1);
		up(a[i]);
	}
	//cout<<" ----> "<<rt->x<<endl;

	for(int i=0; i<q; i++){
		ll k=X[i];
		ll p=V[i];
		quer(k,p);
		PAS.pb(rt->x);
	}

	return PAS;
}

Compilation message

bubblesort2.cpp: In function 'void updt(int, int, nodes*&)':
bubblesort2.cpp:35:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt(l,l+r>>1,x->L);
         ~^~
bubblesort2.cpp:36:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt(l+r>>1,r,x->R);
       ~^~
bubblesort2.cpp: In function 'int quer(int, int, nodes*&)':
bubblesort2.cpp:44:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  return quer(l,l+r>>1,x->L)
                ~^~
bubblesort2.cpp:45:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     +quer(l+r>>1,r,x->R);
           ~^~
bubblesort2.cpp: In function 'void updt(int, int, node*&)':
bubblesort2.cpp:82:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt(l,l+r>>1,x->L);
         ~^~
bubblesort2.cpp:83:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt(l+r>>1,r,x->R);
       ~^~
bubblesort2.cpp: In function 'void updt1(int, int, node*&)':
bubblesort2.cpp:96:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt1(l,l+r>>1,x->L);
          ~^~
bubblesort2.cpp:97:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt1(l+r>>1,r,x->R);
        ~^~
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:166:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<b.size(); i++){
               ~^~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 94456 KB Output is correct
2 Correct 84 ms 94696 KB Output is correct
3 Correct 92 ms 95160 KB Output is correct
4 Correct 110 ms 95388 KB Output is correct
5 Correct 113 ms 95388 KB Output is correct
6 Correct 122 ms 95388 KB Output is correct
7 Correct 108 ms 95388 KB Output is correct
8 Correct 106 ms 95388 KB Output is correct
9 Correct 120 ms 95388 KB Output is correct
10 Correct 128 ms 95388 KB Output is correct
11 Correct 123 ms 95396 KB Output is correct
12 Correct 126 ms 95396 KB Output is correct
13 Correct 114 ms 95396 KB Output is correct
14 Correct 123 ms 95416 KB Output is correct
15 Correct 130 ms 95416 KB Output is correct
16 Correct 133 ms 95416 KB Output is correct
17 Correct 128 ms 95416 KB Output is correct
18 Correct 127 ms 95416 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 94456 KB Output is correct
2 Correct 84 ms 94696 KB Output is correct
3 Correct 92 ms 95160 KB Output is correct
4 Correct 110 ms 95388 KB Output is correct
5 Correct 113 ms 95388 KB Output is correct
6 Correct 122 ms 95388 KB Output is correct
7 Correct 108 ms 95388 KB Output is correct
8 Correct 106 ms 95388 KB Output is correct
9 Correct 120 ms 95388 KB Output is correct
10 Correct 128 ms 95388 KB Output is correct
11 Correct 123 ms 95396 KB Output is correct
12 Correct 126 ms 95396 KB Output is correct
13 Correct 114 ms 95396 KB Output is correct
14 Correct 123 ms 95416 KB Output is correct
15 Correct 130 ms 95416 KB Output is correct
16 Correct 133 ms 95416 KB Output is correct
17 Correct 128 ms 95416 KB Output is correct
18 Correct 127 ms 95416 KB Output is correct
19 Correct 191 ms 97708 KB Output is correct
20 Correct 176 ms 98112 KB Output is correct
21 Correct 173 ms 98112 KB Output is correct
22 Correct 203 ms 98112 KB Output is correct
23 Correct 174 ms 98112 KB Output is correct
24 Correct 161 ms 98112 KB Output is correct
25 Correct 154 ms 98112 KB Output is correct
26 Correct 159 ms 98112 KB Output is correct
27 Correct 163 ms 98112 KB Output is correct
28 Correct 171 ms 98112 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 98112 KB Output is correct
2 Correct 354 ms 98112 KB Output is correct
3 Correct 509 ms 99424 KB Output is correct
4 Correct 502 ms 99424 KB Output is correct
5 Correct 474 ms 99424 KB Output is correct
6 Correct 463 ms 99424 KB Output is correct
7 Correct 489 ms 99424 KB Output is correct
8 Correct 488 ms 99424 KB Output is correct
9 Correct 460 ms 99424 KB Output is correct
10 Correct 694 ms 99424 KB Output is correct
11 Correct 397 ms 99424 KB Output is correct
12 Correct 335 ms 99424 KB Output is correct
13 Correct 355 ms 99424 KB Output is correct
14 Correct 345 ms 99424 KB Output is correct
15 Correct 361 ms 99424 KB Output is correct
16 Correct 341 ms 99424 KB Output is correct
17 Correct 329 ms 99424 KB Output is correct
18 Correct 332 ms 99424 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 94456 KB Output is correct
2 Correct 84 ms 94696 KB Output is correct
3 Correct 92 ms 95160 KB Output is correct
4 Correct 110 ms 95388 KB Output is correct
5 Correct 113 ms 95388 KB Output is correct
6 Correct 122 ms 95388 KB Output is correct
7 Correct 108 ms 95388 KB Output is correct
8 Correct 106 ms 95388 KB Output is correct
9 Correct 120 ms 95388 KB Output is correct
10 Correct 128 ms 95388 KB Output is correct
11 Correct 123 ms 95396 KB Output is correct
12 Correct 126 ms 95396 KB Output is correct
13 Correct 114 ms 95396 KB Output is correct
14 Correct 123 ms 95416 KB Output is correct
15 Correct 130 ms 95416 KB Output is correct
16 Correct 133 ms 95416 KB Output is correct
17 Correct 128 ms 95416 KB Output is correct
18 Correct 127 ms 95416 KB Output is correct
19 Correct 191 ms 97708 KB Output is correct
20 Correct 176 ms 98112 KB Output is correct
21 Correct 173 ms 98112 KB Output is correct
22 Correct 203 ms 98112 KB Output is correct
23 Correct 174 ms 98112 KB Output is correct
24 Correct 161 ms 98112 KB Output is correct
25 Correct 154 ms 98112 KB Output is correct
26 Correct 159 ms 98112 KB Output is correct
27 Correct 163 ms 98112 KB Output is correct
28 Correct 171 ms 98112 KB Output is correct
29 Correct 186 ms 98112 KB Output is correct
30 Correct 354 ms 98112 KB Output is correct
31 Correct 509 ms 99424 KB Output is correct
32 Correct 502 ms 99424 KB Output is correct
33 Correct 474 ms 99424 KB Output is correct
34 Correct 463 ms 99424 KB Output is correct
35 Correct 489 ms 99424 KB Output is correct
36 Correct 488 ms 99424 KB Output is correct
37 Correct 460 ms 99424 KB Output is correct
38 Correct 694 ms 99424 KB Output is correct
39 Correct 397 ms 99424 KB Output is correct
40 Correct 335 ms 99424 KB Output is correct
41 Correct 355 ms 99424 KB Output is correct
42 Correct 345 ms 99424 KB Output is correct
43 Correct 361 ms 99424 KB Output is correct
44 Correct 341 ms 99424 KB Output is correct
45 Correct 329 ms 99424 KB Output is correct
46 Correct 332 ms 99424 KB Output is correct
47 Correct 2525 ms 159284 KB Output is correct
48 Execution timed out 9065 ms 289780 KB Time limit exceeded
49 Halted 0 ms 0 KB -