Here you will find solutions of many problems on spoj. If you want solution of some problem which is not listed in blog or have doubt regarding any spoj problem (which i have solved) or any programming concept (data structure) you can mail me @ raj.nishant360@gmail.com
And my humble request to you all that don't copy the code only try to understand the logic and algorithm behind the code. I have started this because if you tried as hard as you can and still can't find any solution to the problem then you can refer to this.
You can read my answer how to start competitive programming CLICK HERE

Tuesday, March 25, 2014

IITWPC4D-Arrangement Validity

below given code is for iitwpc4d spoj or arrangement validity spoj.
this code is implementation of slower version of code this will get TLE .
but below given code will get accepted..
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cfloat>
#include <map>
#include <fstream>
#include <sstream>
#include <bits/stdc++.h>
#include <climits>
using namespace std;
#define gc getchar_unlocked
inline void scanint(int &x)
{
    register int c = gc();
    x = 0;
    int neg = 0;
    for(;((c<48 || c>57) && c != '-');c = gc());
    if(c=='-') {neg=1;c=gc();}
    for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
    if(neg) x=-x;
}
class node
{
public:
 node * P;
 node * LCHILD;
 node * RCHILD;
 int value;
 int count;
}store[100009];
node *root= NULL;
int cnt=0;
int out[100009];
int loc=0;
node * create(node *parent,int val,bool check)
{
 if(root == NULL && parent == NULL)
 {
  root = &store[loc++];
  root->P = NULL;
  root->value = val;
  root->LCHILD= NULL;
  root->RCHILD= NULL;
  root->count= 1;
  return root;
 }
 node *temp=&store[loc++];
 if(check)
  parent->LCHILD = temp;
 else
  parent->RCHILD = temp;
 temp->P = parent;
 temp->value = val;
 temp->count = 1;
 temp->RCHILD = NULL;
 temp->LCHILD = NULL;
 while(temp->P != NULL)
 {
  temp->P->count++;
  temp= temp->P;
 }
 return temp;
}
void insert(int val,int pos)
{
 if(root == NULL ){
  root = create(NULL,val,false);
  return ;
 }
 bool check = true;
 node * temp =root;
 node *parent = NULL;
 while( temp != NULL)
 {
  parent = temp;
  if(temp->RCHILD != NULL)
  {
   if( pos  > (temp->RCHILD->count + 1))
   {
    pos-=(temp->RCHILD->count + 1);
    temp = temp->LCHILD;
    check = true;
   }
   else if(pos < (temp->RCHILD->count + 1))
   {
    temp = temp->RCHILD;
    check = false;
   }
  }
  else
  {
   if(pos >= 1)
   {
    pos-=1;
    temp = temp->LCHILD;
    check = true;
   }
   else if(pos < 1)
   {
    temp = temp->RCHILD;
    check = false;
   }
  }
 }
 create(parent , val, check);
}
void output(node *temp)
{
 if(temp->LCHILD != NULL)
  output(temp->LCHILD);
 out[temp->value] = cnt++;
 if(temp->RCHILD != NULL)
  output(temp->RCHILD);
}
int main()
{
 int t;
 scanint(t);
 for(int j=1;j<=t ; j++)
 {
  int a[100009];
  int n;
  scanint(n);
  bool flag=false;
  for(int i=0;i<n;i++){
   scanint(a[i]);
   if(a[i] > i)
    flag = true;
   insert(i,a[i]);}
  if(flag)
  {
   printf("Test : %d\n",j);
   printf("-1\n");
   continue;
  }
  output(root);
  root = NULL;
  cnt = 0;
  printf("Test : %d\n",j);
  for(int i=0;i<n;i++)
   printf("%d ",out[i] + 1);
  printf("\n");
 }
}



#include <stdio.h>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cfloat>
#include <map>
#include <fstream>
#include <sstream>
#include <bits/stdc++.h>
#include <climits>
using namespace std;
#define gc getchar_unlocked
inline void scanint(int &x)
{
    register int c = gc();
    x = 0;
    int neg = 0;
    for(;((c<48 || c>57) && c != '-');c = gc());
    if(c=='-') {neg=1;c=gc();}
    for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
    if(neg) x=-x;
}
int T[1000000],A[300000],N,t,i,j,k,ans[300000];
void build(int node,int a,int b){
    int mid=(a+b)>>1;
    if(a==b) T[node]=1;
    else{
        build(node<<1,a,mid);
        build((node<<1)+1,mid+1,b);
        T[node]=b-a+1;
    }
}
int query(int node,int pos,int a,int b){
    if(a==b){
        --T[node];
        return a;
    }
    int mid=(a+b)>>1;
    --T[node];
    if(pos<=T[node<<1])   return query(node<<1,pos,a,mid);
    else return query((node<<1)+1,pos-T[node<<1],mid+1,b);
}
int main(){
    scanf("%d",&t);
    for(int j=1;j<=t ; j++){
        scanint(N);
        int flag = 1;
        for(i=0;i<N;i++){ 
            scanint(A[i]);
            if(A[i]>i)
                flag=0;}
        if(!flag)
        {
            printf("Test : %d\n",j);
            printf("-1\n");
            continue;
        }
        build(1,1,N);
        for(i=N-1;i>=0;i--) ans[i]=query(1,i-A[i]+1,1,N);
        printf("Test : %d\n",j);
        for(int i=0;i<N;i++)
            printf("%d ",ans[i]);
        printf("\n");
    }
    return 0;
}