Poj3481 Double Queue

Poj3481 Double Queue

 

Double Queue

Time Limit:1000 MS		Memory Limit:65536 K
Total Submissions:12681		Accepted:5720

 

Description

The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern information technologies. as usual, each client of the bank is identified by a positive integerKAnd, upon arriving to the bank for some services, he or she has es a positive integer priorityP. One of the limitations of the young manager of the bank shocked the software engineer of the serving system. They proposed to break the tradition by sometimes calling the serving desk withLowestPriority instead of that with the highest priority. Thus, the system will receive the following types of request:

0	The system needs to stop serving
1K P	Add clientKTo the waiting list with priorityP
2	Serve the client with the highest priority and drop him or her from the waiting list
3	Serve the client with the lowest priority and drop him or her from the waiting list

Your task is to help the software engineer of the bank by writing a program to implement the requested serving policy.

Input

Each line of the input contains one of the possible requests; only the last line contains the stop-request (code 0 ). you may assume that when there is a request to include a new client in the list (code 1), there is no other request in the list of the same client or with the same priority. an identifierKIs always less than 106, and a priorityPIs less than 107. The client may arrive for being served multiple times, and each time may obtain a different priority.

Output

For each request with code 2 or 3, the program has to print, in a separate line of the standard output, the identifier of the served client. if the request arrives when the waiting list is empty, then the program prints zero (0) to the output.

Sample Input

21 20 141 30 321 10 993220

Sample Output

02030100

Source

Southeastern Europe 2007

 

 

 

Balance Tree template question

 

 

 

#include
 
  #include
  
   #include
   
    #include
    
     #include
     
      #include#define F(i,j,n) for(int i=j;i<=n;i++)#define D(i,j,n) for(int i=j;i>=n;i--)#define LL long long#define pa pair
      
       #define MAXN 100005using namespace std;int x,y,z,rt=0,tot=0;int l[MAXN],r[MAXN],s[MAXN],v[MAXN],u[MAXN],rnd[MAXN];inline int read(){int ret=0,flag=1;char ch=getchar();while (ch<'0'||ch>'9'){if (ch=='-') flag=-1;ch=getchar();}while (ch>='0'&&ch<='9'){ret=ret*10+ch-'0';ch=getchar();}return ret*flag;}inline void rturn(int &k){int tmp=l[k];l[k]=r[tmp];r[tmp]=k;s[tmp]=s[k];s[k]=s[l[k]]+s[r[k]]+1;k=tmp;}inline void lturn(int &k){int tmp=r[k];r[k]=l[tmp];l[tmp]=k;s[tmp]=s[k];s[k]=s[l[k]]+s[r[k]]+1;k=tmp;}inline void ins(int &k,int y,int z){if (!k) {k=++tot;v[k]=z;u[k]=y;s[k]=1;l[k]=r[k]=0;rnd[k]=rand();return;}s[k]++;if (v[k]>z){ins(l[k],y,z);if (rnd[l[k]]