# SPOJ: CERC07S – Robotic Sort

0

Problem Link : http://www.spoj.com/problems/CERC07S/

Solution Idea:

```
#include &lt;bits/stdc++.h&gt;
#include &lt;ext/pb_ds/assoc_container.hpp&gt;
#include &lt;ext/pb_ds/tree_policy.hpp&gt;

#define pii              pair &lt;int,int&gt;
#define pll              pair &lt;long long,long long&gt;
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cerr&lt;&lt;#x &quot; = &quot;&lt;&lt;(x)&lt;&lt;endl
#define VI               vector &lt;int&gt;
#define DBG              pf(&quot;Hi\n&quot;)
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf(&quot;%d&quot;,&amp;a)
#define sfl(a)           scanf(&quot;%lld&quot;,&amp;a)
#define sff(a,b)         scanf(&quot;%d %d&quot;,&amp;a,&amp;b)
#define sffl(a,b)        scanf(&quot;%lld %lld&quot;,&amp;a,&amp;b)
#define sfff(a,b,c)      scanf(&quot;%d %d %d&quot;,&amp;a,&amp;b,&amp;c)
#define sfffl(a,b,c)     scanf(&quot;%lld %lld %lld&quot;,&amp;a,&amp;b,&amp;c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i&lt;n;i++)
#define loop1(i,n)       for(int i=1;i&lt;=n;i++)
#define REP(i,a,b)       for(int i=a;i&lt;b;i++)
#define RREP(i,a,b)      for(int i=a;i&gt;=b;i--)
#define TEST_CASE(t)     for(int z=1;z&lt;=t;z++)
#define PRINT_CASE       printf(&quot;Case %d: &quot;,z)
#define LINE_PRINT_CASE  printf(&quot;Case %d:\n&quot;,z)
#define CASE_PRINT       cout&lt;&lt;&quot;Case &quot;&lt;&lt;z&lt;&lt;&quot;: &quot;
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1&lt;&lt;28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;

//using namespace __gnu_pbds;
//typedef tree&lt;int, null_type, less&lt;int&gt;, rb_tree_tag, tree_order_statistics_node_update&gt; ordered_set;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

//int Set(int N,int pos){return N=N | (1&lt;&lt;pos);}
//int reset(int N,int pos){return N= N &amp; ~(1&lt;&lt;pos);}
//bool check(int N,int pos){return (bool)(N &amp; (1&lt;&lt;pos));}
/*------------------------------------------------*/

/*-------------------------Treap Start------------------------*/
struct node
{
int prior,size;
pii val;//value stored in the array
pii mini;//whatever info you want to maintain in segtree for each node
int lazy;//whatever lazy update you want to do
int id;
struct node *l,*r;
};

typedef node* pnode;

int sz(pnode t)
{
return t?t-&gt;size:0;
}

void upd_sz(pnode t)
{
if(t)t-&gt;size=sz(t-&gt;l)+1+sz(t-&gt;r);
}

void lazy(pnode t)
{
if(!t || !t-&gt;lazy)return;
//    t-&gt;val+=t-&gt;lazy;//operation of lazy
//    t-&gt;mini+=t-&gt;lazy*sz(t);
swap(t-&gt;l,t-&gt;r);
if(t-&gt;l)t-&gt;l-&gt;lazy^=t-&gt;lazy;//propagate lazy
if(t-&gt;r)t-&gt;r-&gt;lazy^=t-&gt;lazy;
t-&gt;lazy=0;
}

void reset(pnode t)
{
if(t)t-&gt;mini = t-&gt;val;//no need to reset lazy coz when we call this lazy would itself be propagated
}

void combine(pnode&amp; t,pnode l,pnode r) //combining two ranges of segtree
{
if(!l || !r)return void(t = l?l:r);
t-&gt;mini = min(l-&gt;mini, r-&gt;mini);
}

void operation(pnode t) //operation of segtree
{
if(!t)return;
reset(t);//reset the value of current node assuming it now represents a single element of the array
lazy(t-&gt;l);
lazy(t-&gt;r);//imp:propagate lazy before combining t-&gt;l,t-&gt;r;
combine(t,t-&gt;l,t);
combine(t,t,t-&gt;r);
}

void split(pnode t,pnode &amp;l,pnode &amp;r,int pos,int add=0)
{
if(!t)return void(l=r=NULL);
lazy(t);
int curr_pos = add + sz(t-&gt;l);
if(curr_pos&lt;=pos)//element at pos goes to left subtree(l)
split(t-&gt;r,t-&gt;r,r,pos,curr_pos+1),l=t;
else
upd_sz(t);
operation(t);
}

int find_min(pnode t, int add=0)
{
lazy(t);
if(t-&gt;r &amp;&amp; t-&gt;r-&gt;mini==t-&gt;mini) return find_min(t-&gt;r,cur_pos+1);
if(t-&gt;l &amp;&amp; t-&gt;l-&gt;mini==t-&gt;mini) return find_min(t-&gt;l,add);
return cur_pos;
}

void merge(pnode &amp;t,pnode l,pnode r)  //l-&gt;leftarray,r-&gt;rightarray,t-&gt;resulting array
{
lazy(l);
lazy(r);
if(!l || !r) t = l?l:r;
else if(l-&gt;prior&gt;r-&gt;prior)merge(l-&gt;r,l-&gt;r,r),t=l;
else    merge(r-&gt;l,l,r-&gt;l),t=r;
upd_sz(t);
operation(t);
}

pnode init(int val, int id)
{
pnode ret = (pnode)malloc(sizeof(node));
ret-&gt;prior=rand();
ret-&gt;size=1;
ret-&gt;val=pii(val,id);
ret-&gt;mini=pii(val,id);
ret-&gt;lazy=0;
ret-&gt;l=ret-&gt;r=NULL;
return ret;
}

//int range_query(pnode t,int l,int r) //[l,r]
//{
//    pnode L,mid,R;
//    split(t,L,mid,l-1);
//    split(mid,t,R,r-l);//note: r-l!!
//    int ans = t-&gt;mini;
//    merge(mid,L,t);
//    merge(t,mid,R);
//    return ans;
//}

//void range_update(pnode t,int l,int r,int val) //[l,r]
//{
//    pnode L,mid,R;
//    split(t,L,mid,l-1);
//    split(mid,t,R,r-l);//note: r-l!!
//    t-&gt;lazy+=val; //lazy_update
//    merge(mid,L,t);
//    merge(t,mid,R);
//}

//void split(pnode t,pnode &amp;l,pnode &amp;r,int key)
//{
//    if(!t) l=r=NULL;
//    else if(t-&gt;val&lt;=key) split(t-&gt;r,t-&gt;r,r,key),l=t; //elem=key comes in l
//    else split(t-&gt;l,l,t-&gt;l,key),r=t;
//    upd_sz(t);
//}
//
//void insert(pnode &amp;t,pnode it)
//{
//    if(!t) t=it;
//    else if(it-&gt;prior&gt;t-&gt;prior) split(t,it-&gt;l,it-&gt;r,it-&gt;val),t=it;
//    else insert(t-&gt;val&lt;=it-&gt;val?t-&gt;r:t-&gt;l,it);
//    upd_sz(t);
//}
//
//void erase(pnode &amp;t,int key)
//{
//    if(!t)return;
//    else if(t-&gt;val==key)
//    {
//        pnode temp=t;
//        merge(t,t-&gt;l,t-&gt;r);
//        free(temp);
//    }
//    else erase(t-&gt;val&lt;key?t-&gt;r:t-&gt;l,key);
//    upd_sz(t);
//}

void output(pnode t)
{
if(!t) return;
output(t-&gt;l);
printf(&quot;%d &quot;,t-&gt;val);
output(t-&gt;r);
}

void clear_tree(pnode t)
{
if(!t) return;
clear_tree(t-&gt;l);
clear_tree(t-&gt;r);
free(t);
}

/*-------------------------Treap End--------------------------*/

int main()
{

//    freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
//	  freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);

int n;
while(sf(n) &amp;&amp; n)
{
pnode root=NULL;
for(int i=0; i&lt;n; i++)
{
int a;
sf(a);
merge(root,root,init(a,i+1));
}
vector&lt;int&gt;ans;
while(n)
{
int k=find_min(root);
pnode l,r;
split(root,l,r,k-1);
split(r,root,r,0);
if(l)
l-&gt;lazy=1;
merge(root,l,r);
n--;
ans.pb(SZ(ans)+k+1);
}

for(int i=0; i&lt;SZ(ans); i++)
{
printf(&quot;%d&quot;,ans[i]);
if(i!=SZ(ans)-1)
printf(&quot; &quot;);
}
printf(&quot;\n&quot;);
//        clear_tree(root);

}

return 0;
}

```