Double Queue POJ - 3481
2017-08-17 10:21
399 查看
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 bya positive integer K and, upon arriving to the bank for some services, he or she receives a positive integer priority P. One of the inventions of the young managers of the bank shocked the software engineer of the serving system. They proposedto break the tradition by sometimes calling the serving desk with the lowest priority instead of that with the highest priority. Thus, the system will receive the following types of request:
Your task is to help the software engineer of the bank by writing a program to implement the requested serving policy.InputEach 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 sameclient or with the same priority. An identifier K is always less than 106, and a priority P is less than 107. The client may arrive for being served multiple times, and each time may obtain a different priority.OutputFor 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
0 | The system needs to stop serving |
1 KP | Add client K to the waiting list with priority P |
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 |
2 1 20 14 1 30 3 2 1 10 99 3 2 2 0Sample Output
0 20 30 10 0
treap模板题 。。但是感觉自己写的不是很好
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>using namespace std;const int maxn=200005;struct node{int l,r,val,w,size,mark;int rnd;}tree[maxn];int size,root;void update(int k){tree[k].size=tree[tree[k].l].size+tree[tree[k].r].size+tree[k].w;}void lturn(int &k){int tmp=tree[k].r;tree[k].r=tree[tmp].l;tree[tmp].l=k;tree[tmp].size=tree[k].size;update(k);k=tmp;}void rturn(int &k){int tmp=tree[k].l;tree[k].l=tree[tmp].r;tree[tmp].r=k;tree[tmp].size=tree[k].size;update(k);k=tmp;}void insert(int &k,int x,int mm){//cout<<"insert "<<k<<endl;if(k==0){size++; //记录已经使用的结构体数目k=size;tree[k].val=x;tree[k].mark=mm;tree[k].size=1;tree[k].w=1;tree[k].rnd=rand();return ;}tree[k].size++;if(tree[k].val==x)tree[k].w++;else if(x>tree[k].val){insert(tree[k].r,x,mm);if(tree[tree[k].r].rnd<tree[k].rnd) //右子树优先级小于根子树lturn(k);}else{insert(tree[k].l,x,mm);4000if(tree[tree[k].l].rnd<tree[k].rnd)rturn(k);}}void del(int &k,int x){if(k==0)return ;//cout<<"del"<<endl;if(tree[k].val==x){if(tree[k].w>1){tree[k].w--;tree[k].size--;return ;}if(tree[k].l*tree[k].r==0)k=tree[k].l+tree[k].r; //如果没有左右子树或只有一个else if(tree[tree[k].l].rnd<tree[tree[k].r].rnd)rturn(k),del(k,x);else lturn(k),del(k,x);}else if(tree[k].val<x)tree[k].size--,del(tree[k].r,x);else tree[k].size--,del(tree[k].l,x);}int query_num1(int k,int x){if(k==0)return 0;//cout<<"rank "<<k<<endl;if(x<=tree[tree[k].r].size){return query_num1(tree[k].r,x);}else if(x>tree[tree[k].r].size+tree[k].w){return query_num1(tree[k].l,x-tree[tree[k].r].size-tree[k].w);}else{return k;}}int query_num2(int k,int x){if(k==0)return 0;if(x<=tree[tree[k].l].size)return query_num2(tree[k].l,x);else if(x>tree[tree[k].l].size+tree[k].w)return query_num2(tree[k].r,x-tree[tree[k].l].size-tree[k].w);else return k;}int main(){int op;root=0,size=0;while(scanf("%d",&op)!=-1){if(op==0)break;if(op==2)printf("%d\n",tree[query_num1(root,1)].mark),del(root,tree[query_num1(root,1)].val);if(op==1){int a,b;scanf("%d%d",&a,&b);insert(root,b,a);}if(op==3)printf("%d\n",tree[query_num2(root,1)].mark),del(root,tree[query_num2(root,1)].val);}return 0;}
相关文章推荐
- poj 3481 Double Queue STL中map的运用
- POJ 3481 Double Queue splay
- POJ 3481 Double Queue Treap
- POJ-3481 Double Queue STL练手
- poj 3481 Double Queue splay
- Double Queue - POJ 3481 - 树堆Treap的数组实现
- poj 3481 Double Queue(Size Balance Tree)
- Double Queue POJ 3481
- POJ 3481 Double Queue
- 栈与队列- STL double_queue
- POJ 3481 & HDU 1908 Double Queue (map运用)
- POJ 3481 Double Queue
- 【POJ】3481 Double Queue
- POJ--3481 Double Queue
- POJ 1862 Stripies priority_queue 单调队列
- POJ 3268 Dijkstra+priority_queue或SPFA
- POJ 2109 少见多怪,利用double log pow 解决高精度
- 【数据结构】poj 1338 (pair,priority_queue)
- POJ_2312_BFS:priority_queue -- Battle City
- poj 2109 Power of Cryptography(pow() 和 double 的妙用)