Submission #201469

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
201469	2020-02-10T16:31:22 Z	mahmoudbadawy	Bubble Sort 2 (JOI18_bubblesort2)	C++17	Compilation error	0 ms	0 KB

bubblesort2

#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* empty;
 
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(0),lazy(0){}
	node(int val,pair<int,int> cur,node* lf=empty,node *rt=empty,node *par=empty):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 == empty) return;
		lazy+=val;
		mx+=val;
		this->val+=val;
	}
	void pushd()
	{
		if(lazy)
		{
			ch[LF]->addtolazy(lazy);
			ch[RT]->addtolazy(lazy);
			lazy=0;
		}
	}
};
 
node *empty=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!=empty)
		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!=empty)
		link(gp,q,getdir(gp,p));
	else
		q->par=empty;
	p->update(); q->update();
}
 
void splay(node* &root, node* &cur)
{
	pushdtoroot(cur);
	while(cur->par != empty)
	{
		node* p=cur->par;
		dir dd=getdir(p,cur);
		if(p->par==empty)
		{
			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==empty) return empty;
	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==empty)
		return root;
	else
		return x;
}
 
void print(node* &root,int dep=0)
{
	if(root==empty) 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==empty)
	{
		ret=gr; return;
	}
	node * cur=ls;
	cur->pushd();
	while(cur->ch[RT]!=empty)
	{
		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==empty)
	{
		ls=empty; gr=root;
		return;
	}
	splay(root,tmp);
	gr=root->ch[RT];
	gr->par=empty;
	ls=root;
	root->ch[RT]=empty;
	root->update();
	/*ls=root->ch[LF];
	ls->par=empty;
	gr=root;
	root->ch[LF]=empty;
	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});
		//print(c);
		c->addtolazy(-1);
		b->addtolazy(c->sz);
		b->cur={nx,i};
		merge(a,c,root);
		merge(root,b,root);
		merge(root,d,root);
	}
	else
	{
		split(a,a,c,{nx,i});
		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=empty;
	for(int i=0;i<n;i++)
	{
	    node* cur=new node(v[i].second/2-i,v[i]);
		merge(root,cur,root);
	}
	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:21:42: error: reference to 'empty' is ambiguous
  node(int val,pair<int,int> cur,node* lf=empty,node *rt=empty,node *par=empty):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
                                          ^~~~~
bubblesort2.cpp:10:14: note: candidates are: node* empty
 extern node* empty;
              ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp:21:57: error: reference to 'empty' is ambiguous
  node(int val,pair<int,int> cur,node* lf=empty,node *rt=empty,node *par=empty):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
                                                         ^~~~~
bubblesort2.cpp:10:14: note: candidates are: node* empty
 extern node* empty;
              ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp:21:73: error: reference to 'empty' is ambiguous
  node(int val,pair<int,int> cur,node* lf=empty,node *rt=empty,node *par=empty):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
                                                                         ^~~~~
bubblesort2.cpp:10:14: note: candidates are: node* empty
 extern node* empty;
              ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
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(0),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(0),lazy(0){}
  ^~~~
bubblesort2.cpp:20:60: warning: list-initializer for non-class type must not be parenthesized
  node():par(this),val(0),sz(0),ch({this,this}),mx(0),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=empty,node *rt=empty,node *par=empty):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=empty,node *rt=empty,node *par=empty):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=empty,node *rt=empty,node *par=empty):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
  ^~~~
bubblesort2.cpp:21:153: warning: list-initializer for non-class type must not be parenthesized
  node(int val,pair<int,int> cur,node* lf=empty,node *rt=empty,node *par=empty):par(par),cur(cur),val(val),sz(1+lf->sz+rt->sz),ch({lf,rt}),mx(val),lazy(0){}
                                                                                                                                                         ^
bubblesort2.cpp: In member function 'void node::addtolazy(int)':
bubblesort2.cpp:30:14: error: reference to 'empty' is ambiguous
   if(this == empty) return;
              ^~~~~
bubblesort2.cpp:10:14: note: candidates are: node* empty
 extern node* empty;
              ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp: In function 'void pushdtoroot(node*)':
bubblesort2.cpp:61:15: error: reference to 'empty' is ambiguous
  if(cur->par!=empty)
               ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp: In function 'void rotate(node*&, dir)':
bubblesort2.cpp:71:9: error: reference to 'empty' is ambiguous
  if(gp!=empty)
         ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp:74:10: error: reference to 'empty' is ambiguous
   q->par=empty;
          ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp: In function 'void splay(node*&, node*&)':
bubblesort2.cpp:81:20: error: reference to 'empty' is ambiguous
  while(cur->par != empty)
                    ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp:85:14: error: reference to 'empty' is ambiguous
   if(p->par==empty)
              ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp: In function 'node* get_by_index(node*&, std::pair<int, int>)':
bubblesort2.cpp:106:11: error: reference to 'empty' is ambiguous
  if(root==empty) return empty;
           ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp:106:25: error: reference to 'empty' is ambiguous
  if(root==empty) return empty;
                         ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp:113:8: error: reference to 'empty' is ambiguous
  if(x==empty)
        ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp: In function 'void print(node*&, int)':
bubblesort2.cpp:121:11: error: reference to 'empty' is ambiguous
  if(root==empty) return;
           ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const _Container&)
     empty(const _Container& __cont) noexcept(noexcept(__cont.empty()))
     ^~~~~
bubblesort2.cpp: In function 'void merge(node*, node*, node*&)':
bubblesort2.cpp:132:9: error: reference to 'empty' is ambiguous
  if(ls==empty)
         ^~~~~
bubblesort2.cpp:46:7: note: candidates are: node* empty
 node *empty=new node();
       ^~~~~
In file included from /usr/include/c++/7/vector:66:0,
                 from bubblesort2.h:1,
                 from bubblesort2.cpp:1:
/usr/include/c++/7/bits/range_access.h:280:5: note:                 template<class _Tp> constexpr bool std::empty(std::initializer_list<_Tp>)
     empty(initializer_list<_Tp> __il) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:271:5: note:                 template<class _Tp, long unsigned int _Nm> constexpr bool std::empty(const _Tp (&)[_Nm])
     empty(const _Tp (&/*__array*/)[_Nm]) noexcept
     ^~~~~
/usr/include/c++/7/bits/range_access.h:261:5: note:                 template<class _Container> constexpr decltype (__cont.empty()) std::empty(const