oj.uz

Submission #201476

# Submission time Handle Problem Language Result Execution time Memory
201476 2020-02-10T16:53:07 Z mahmoudbadawy Bubble Sort 2 (JOI18_bubblesort2) C++17
100 / 100
 3398 ms 71408 KB 
#include "bubblesort2.h"
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace std;
     
struct node;
extern node* emptyNode;
 
enum dir{LF,RT};
 
struct node{
	int val,mx,lazy;
	pair<int,int> cur;
	int sz;
	node *par;
	node *ch[2];
	node():par(this),val(0),sz(0),ch({this,this}),mx(-(1<<30)),lazy(0){}
	node(int val,pair<int,int> cur,node* lf=emptyNode,node *rt=emptyNode,node *par=emptyNode):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
	void update()
	{
		pushd();
		sz=1+ch[0]->sz+ch[1]->sz;
		mx=max(ch[LF]->mx,max(val,ch[RT]->mx));
	}
	void addtolazy(int val)
	{
		if(this == emptyNode) return;
		lazy+=val;
		mx+=val;
		this->val+=val;
	}
	void pushd()
	{
		if(lazy)
		{
			ch[LF]->addtolazy(lazy);
			ch[RT]->addtolazy(lazy);
			lazy=0;
		}
	}
};
 
node *emptyNode=new node();
 
inline void link(node* &par,node* &child,dir d)
{
	par->ch[d]=child;
	child->par=par;
}
 
inline dir getdir(node* &root,node* &ch)
{
	return (root->ch[LF]==ch?LF:RT);
}
 
void pushdtoroot(node* cur)
{
	if(cur->par!=emptyNode)
		pushdtoroot(cur->par);
	cur->pushd();
}
 
void rotate(node* &p,dir d)
{
	node* q=p->ch[d],*gp=p->par;
	link(p,q->ch[!d],d);
	link(q,p,(dir)!d);
	if(gp!=emptyNode)
		link(gp,q,getdir(gp,p));
	else
		q->par=emptyNode;
	p->update(); q->update();
}
 
void splay(node* &root, node* &cur)
{
	pushdtoroot(cur);
	while(cur->par != emptyNode)
	{
		node* p=cur->par;
		dir dd=getdir(p,cur);
		if(p->par==emptyNode)
		{
			rotate(p,dd);
			continue;
		}
		node* gp=p->par;
		dir d=getdir(gp,p);
		if(d==dd)
		{
			rotate(gp,d); rotate(p,d);
		}
		else
		{
			rotate(p,dd); rotate(gp,d);
		}
	}
	root = cur;	
}
 
node *get_by_index(node* &root,pair<int,int> ind)
{
	if(root==emptyNode) return emptyNode;
	root->pushd();
	if(ind == root->cur)
		return root;
	if(ind < root->cur)
		return get_by_index(root->ch[LF],ind);
	node* x=get_by_index(root->ch[RT],ind);
	if(x==emptyNode)
		return root;
	else
		return x;
}
 
void print(node* &root,int dep=0)
{
	if(root==emptyNode) return;
	//cout << string(dep,'\t') << (root->val) << endl << "L";
	root->pushd();
	print(root->ch[LF],dep+1);
	//cout << "R";
	cout << string(dep,'\t') << (root->val) << "," << (root->cur.first) << endl;
	print(root->ch[RT],dep+1); 
}
 
void merge(node *ls,node *gr,node* &ret)
{
	if(ls==emptyNode)
	{
		ret=gr; return;
	}
	node * cur=ls;
	cur->pushd();
	while(cur->ch[RT]!=emptyNode)
	{
		cur=cur->ch[RT];
		cur->pushd();
	}
	splay(ls,cur);
	link(ls,gr,RT);
	ls->update();
	ret=ls;
}
 
void split(node *root,node* &ls,node* &gr,pair<int,int> lsz)
{
	node *tmp=get_by_index(root,lsz);
	//cout << lsz.first << " "  << lsz.second  <<" " << (tmp->cur.first) << endl;
	if(tmp==emptyNode)
	{
		ls=emptyNode; gr=root;
		return;
	}
	splay(root,tmp);
	gr=root->ch[RT];
	gr->par=emptyNode;
	ls=root;
	root->ch[RT]=emptyNode;
	root->update();
	/*ls=root->ch[LF];
	ls->par=emptyNode;
	gr=root;
	root->ch[LF]=emptyNode;
	root->update();*/
}


const int N=1e5+5;

node* root;
int n,q;

void modify(int ox,int nx,int i)
{
	node *a,*b,*c,*d;
	split(root,a,d,{ox,i});
	split(a,a,b,{ox,i-1});
	//print(a); cout << "----------" << endl; print(b); cout << "----------" << endl; print(d); cout << "-------" << endl;
	if(ox<nx)
	{

		split(d,c,d,{nx,i});
		//cout << "A" << endl; print(a); cout << "B" << endl; print(b); cout << "C" << endl; print(c); cout << "D" << endl; print(d);
		//print(c);
		c->addtolazy(1);
		b->addtolazy(-(c->sz));
		b->cur={nx,i};
		//cout << (c->mx) <<" " << (b->mx) << "MX\n";
		merge(a,c,root);
		merge(root,b,root);
		merge(root,d,root);
	}
	else
	{
		split(a,a,c,{nx,i});
		//cout << "AA" << endl; print(a); cout << "B" << endl; print(b); cout << "C" << endl; print(c); cout << "D" << endl; print(d);
		c->addtolazy(-1);
		b->addtolazy((c->sz));
		b->cur={nx,i};
		merge(a,b,root);
		merge(root,c,root);
		merge(root,d,root);
	}
}


std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
	n=A.size(),q=X.size();	
	vector<pair<int,int> > v;
	for(int i=0;i<A.size();i++)
		v.push_back({A[i],2*i});
	sort(v.begin(),v.end());
	root=emptyNode;
	for(int i=0;i<n;i++)
	{
	    node* cur=new node(v[i].second/2-i,v[i]);
		merge(root,cur,root);
	}
	//cout << (root->mx) << endl;
	vector<int> ans;
	for(int i=0;i<q;i++)
	{
	    if(A[X[i]]!=V[i])
		    modify(A[X[i]],V[i],2*X[i]);
		A[X[i]]=V[i];
		ans.push_back(root->mx);
	}
	return ans;
}

Compilation message

bubblesort2.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
bubblesort2.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
bubblesort2.cpp: In constructor 'node::node()':
bubblesort2.cpp:18:8: warning: 'node::par' will be initialized after [-Wreorder]
  node *par;
        ^~~
bubblesort2.cpp:15:6: warning:   'int node::val' [-Wreorder]
  int val,mx,lazy;
      ^~~
bubblesort2.cpp:20:2: warning:   when initialized here [-Wreorder]
  node():par(this),val(0),sz(0),ch({this,this}),mx(-(1<<30)),lazy(0){}
  ^~~~
bubblesort2.cpp:19:12: warning: 'node::ch' will be initialized after [-Wreorder]
  node *ch[2];
            ^
bubblesort2.cpp:15:10: warning:   'int node::mx' [-Wreorder]
  int val,mx,lazy;
          ^~
bubblesort2.cpp:20:2: warning:   when initialized here [-Wreorder]
  node():par(this),val(0),sz(0),ch({this,this}),mx(-(1<<30)),lazy(0){}
  ^~~~
bubblesort2.cpp:20:67: warning: list-initializer for non-class type must not be parenthesized
  node():par(this),val(0),sz(0),ch({this,this}),mx(-(1<<30)),lazy(0){}
                                                                   ^
bubblesort2.cpp: In constructor 'node::node(int, std::pair<int, int>, node*, node*, node*)':
bubblesort2.cpp:18:8: warning: 'node::par' will be initialized after [-Wreorder]
  node *par;
        ^~~
bubblesort2.cpp:16:16: warning:   'std::pair<int, int> node::cur' [-Wreorder]
  pair<int,int> cur;
                ^~~
bubblesort2.cpp:21:2: warning:   when initialized here [-Wreorder]
  node(int val,pair<int,int> cur,node* lf=emptyNode,node *rt=emptyNode,node *par=emptyNode):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
  ^~~~
bubblesort2.cpp:16:16: warning: 'node::cur' will be initialized after [-Wreorder]
  pair<int,int> cur;
                ^~~
bubblesort2.cpp:15:6: warning:   'int node::val' [-Wreorder]
  int val,mx,lazy;
      ^~~
bubblesort2.cpp:21:2: warning:   when initialized here [-Wreorder]
  node(int val,pair<int,int> cur,node* lf=emptyNode,node *rt=emptyNode,node *par=emptyNode):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
  ^~~~
bubblesort2.cpp:19:12: warning: 'node::ch' will be initialized after [-Wreorder]
  node *ch[2];
            ^
bubblesort2.cpp:15:10: warning:   'int node::mx' [-Wreorder]
  int val,mx,lazy;
          ^~
bubblesort2.cpp:21:2: warning:   when initialized here [-Wreorder]
  node(int val,pair<int,int> cur,node* lf=emptyNode,node *rt=emptyNode,node *par=emptyNode):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
  ^~~~
bubblesort2.cpp:21:165: warning: list-initializer for non-class type must not be parenthesized
  node(int val,pair<int,int> cur,node* lf=emptyNode,node *rt=emptyNode,node *par=emptyNode):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
                                                                                                                                                                     ^
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:214:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<A.size();i++)
              ~^~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 10 ms 632 KB Output is correct
4 Correct 11 ms 632 KB Output is correct
5 Correct 11 ms 632 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 10 ms 632 KB Output is correct
8 Correct 10 ms 632 KB Output is correct
9 Correct 10 ms 632 KB Output is correct
10 Correct 9 ms 632 KB Output is correct
11 Correct 9 ms 632 KB Output is correct
12 Correct 12 ms 632 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 9 ms 632 KB Output is correct
15 Correct 9 ms 632 KB Output is correct
16 Correct 8 ms 636 KB Output is correct
17 Correct 8 ms 628 KB Output is correct
18 Correct 9 ms 632 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 10 ms 632 KB Output is correct
4 Correct 11 ms 632 KB Output is correct
5 Correct 11 ms 632 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 10 ms 632 KB Output is correct
8 Correct 10 ms 632 KB Output is correct
9 Correct 10 ms 632 KB Output is correct
10 Correct 9 ms 632 KB Output is correct
11 Correct 9 ms 632 KB Output is correct
12 Correct 12 ms 632 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 9 ms 632 KB Output is correct
15 Correct 9 ms 632 KB Output is correct
16 Correct 8 ms 636 KB Output is correct
17 Correct 8 ms 628 KB Output is correct
18 Correct 9 ms 632 KB Output is correct
19 Correct 25 ms 1400 KB Output is correct
20 Correct 29 ms 1528 KB Output is correct
21 Correct 28 ms 1400 KB Output is correct
22 Correct 31 ms 1400 KB Output is correct
23 Correct 25 ms 1400 KB Output is correct
24 Correct 24 ms 1400 KB Output is correct
25 Correct 25 ms 1400 KB Output is correct
26 Correct 23 ms 1400 KB Output is correct
27 Correct 21 ms 1528 KB Output is correct
28 Correct 20 ms 1400 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2932 KB Output is correct
2 Correct 101 ms 4976 KB Output is correct
3 Correct 191 ms 6768 KB Output is correct
4 Correct 187 ms 6512 KB Output is correct
5 Correct 188 ms 6768 KB Output is correct
6 Correct 187 ms 6768 KB Output is correct
7 Correct 179 ms 6516 KB Output is correct
8 Correct 189 ms 6768 KB Output is correct
9 Correct 186 ms 6416 KB Output is correct
10 Correct 65 ms 6896 KB Output is correct
11 Correct 72 ms 6896 KB Output is correct
12 Correct 75 ms 6896 KB Output is correct
13 Correct 77 ms 6896 KB Output is correct
14 Correct 78 ms 6896 KB Output is correct
15 Correct 92 ms 6896 KB Output is correct
16 Correct 79 ms 6896 KB Output is correct
17 Correct 88 ms 6896 KB Output is correct
18 Correct 102 ms 6896 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 10 ms 632 KB Output is correct
4 Correct 11 ms 632 KB Output is correct
5 Correct 11 ms 632 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 10 ms 632 KB Output is correct
8 Correct 10 ms 632 KB Output is correct
9 Correct 10 ms 632 KB Output is correct
10 Correct 9 ms 632 KB Output is correct
11 Correct 9 ms 632 KB Output is correct
12 Correct 12 ms 632 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 9 ms 632 KB Output is correct
15 Correct 9 ms 632 KB Output is correct
16 Correct 8 ms 636 KB Output is correct
17 Correct 8 ms 628 KB Output is correct
18 Correct 9 ms 632 KB Output is correct
19 Correct 25 ms 1400 KB Output is correct
20 Correct 29 ms 1528 KB Output is correct
21 Correct 28 ms 1400 KB Output is correct
22 Correct 31 ms 1400 KB Output is correct
23 Correct 25 ms 1400 KB Output is correct
24 Correct 24 ms 1400 KB Output is correct
25 Correct 25 ms 1400 KB Output is correct
26 Correct 23 ms 1400 KB Output is correct
27 Correct 21 ms 1528 KB Output is correct
28 Correct 20 ms 1400 KB Output is correct
29 Correct 21 ms 2932 KB Output is correct
30 Correct 101 ms 4976 KB Output is correct
31 Correct 191 ms 6768 KB Output is correct
32 Correct 187 ms 6512 KB Output is correct
33 Correct 188 ms 6768 KB Output is correct
34 Correct 187 ms 6768 KB Output is correct
35 Correct 179 ms 6516 KB Output is correct
36 Correct 189 ms 6768 KB Output is correct
37 Correct 186 ms 6416 KB Output is correct
38 Correct 65 ms 6896 KB Output is correct
39 Correct 72 ms 6896 KB Output is correct
40 Correct 75 ms 6896 KB Output is correct
41 Correct 77 ms 6896 KB Output is correct
42 Correct 78 ms 6896 KB Output is correct
43 Correct 92 ms 6896 KB Output is correct
44 Correct 79 ms 6896 KB Output is correct
45 Correct 88 ms 6896 KB Output is correct
46 Correct 102 ms 6896 KB Output is correct
47 Correct 745 ms 22376 KB Output is correct
48 Correct 3078 ms 60464 KB Output is correct
49 Correct 3398 ms 67504 KB Output is correct
50 Correct 3320 ms 71408 KB Output is correct
51 Correct 3311 ms 69728 KB Output is correct
52 Correct 3282 ms 69800 KB Output is correct
53 Correct 3282 ms 68292 KB Output is correct
54 Correct 3134 ms 68600 KB Output is correct
55 Correct 3288 ms 71264 KB Output is correct
56 Correct 3150 ms 67684 KB Output is correct
57 Correct 3295 ms 68352 KB Output is correct
58 Correct 3163 ms 67168 KB Output is correct
59 Correct 2576 ms 71012 KB Output is correct
60 Correct 2645 ms 68960 KB Output is correct
61 Correct 2646 ms 67184 KB Output is correct
62 Correct 2325 ms 69904 KB Output is correct
63 Correct 2304 ms 68184 KB Output is correct
64 Correct 2290 ms 65548 KB Output is correct
65 Correct 1900 ms 70164 KB Output is correct
66 Correct 1927 ms 68320 KB Output is correct
67 Correct 1952 ms 68624 KB Output is correct