|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||256 MB||87||23||6||12.766%|
You are working for Metagonia stock exchange. Recently traders in Metagonia had heard about Iceberg orders traded on London stock exchange and asked your employer to add such functionality as well. A stock exchange is an engine that receives orders and generates trades.
An iceberg order is a quintuple of integers (ID, T, P, V , TV). Each order has an identifier ID (unique among all orders), type T (which is equal to either BUY = 1 or SELL = 2), price P, total remaining volume V and tip volume TV. For each order, exchange additionally keeps track of its current volume CV and priority PR. There is also a global priority counter of the exchange GP. An order book of the exchange is a set of orders.
Trades that are generated by the exchange are quadruples of integers (BUY ID, SELL ID, P, V). Each trade has BUY ID and SELL ID — identifiers of matching BUY and SELL orders, trade price P, and trade volume V.
When an order is received by the exchange it is matched against orders currently on the order book. This is done as follows. Suppose an order a is received with Ta = SELL. Among all orders currently on the order book we look for an order b such that Tb = BUY and Pb ≥ Pa. We select such an order b with the largest price, and if there are several — one with the smallest priority. If there is such an order b, then a trade t is generated with BUY IDt = IDb and SELL IDt = IDa at trade price Pt = Pb with trade volume Vt = min(Va, CVb). Va, Vb, and CVb are all decreased by trade volume. If Vb = 0 after this, then the order b is removed from the order book. If CVb = 0 (but Vb > 0) then we set current volume of order b to CVb = min(Vb, TVb), set PRb = GP, and increment GP. We continue these operations of selecting b and generating trades until either Va = 0 or there are no more orders b on the order book which satisfy the condition. In the latter case, we add order a to the order book with CVa = min(Va, TVa) and PRa = GP, and then increment GP. When the process of matching the order a is finished with several trades between the same pair of orders a and b (and there can be lots of them!), they are all united into a single trade with the volume equal to the sum of individual trade volumes.
If Ta = BUY we are looking for an order b with Tb = SELL and Pb ≤ Pa and select such an order b with the smallest price and the smallest priority among those. The rest of the matching process is as described above, with trades having BUY IDt = IDa, SELL IDt = IDb, Pt = Pb, and Vt = min(Va, CVb).
Initially the order book is empty. You are presented with several orders that are received by the exchange one by one. You need to print generated trades and the order book state after all orders are processed.
Hint: The priority and GP are introduced in the problem statement only for the purpose of a formal description of the algorithm. The actual implementation does not have to keep track of priority. Typically, an exchange simply keeps a priority-ordered list of orders of each type at each price in its order book.
The first line of the input contains the number of orders n (1 ≤ n ≤ 50 000). Each of the following n lines represent an order. Each order is given by a space-separated quintuple ID T P V TV , where 1 ≤ ID ≤ 1 000 000, T = 1 for BUY and T = 2 for SELL, 1 ≤ P ≤ 100 000 and 1 ≤ TV ≤ V ≤ 1 000 000 000.
For each order print all trades generated by processing this order, in ascending order of pairs (BUY ID, SELL ID), each trade on its own line. Each trade shall be printed as a space-separated quadruple of integers BUY ID SELL ID P V. It is guaranteed that the total number of trades would not exceed 100 000. Print a blank line after all trades, followed by the order book. Each order that is still on the book shall be printed as a space-separated sextuple ID T P V TV CV, sorted first by P and then by PR.
7 42 1 100 200 20 239 1 100 50 50 1111 1 101 30 15 1234 1 100 300 15 4321 2 99 125 25 5678 1 101 30 30 8765 2 101 100 20
42 4321 100 30 239 4321 100 50 1111 4321 101 30 1234 4321 100 15 5678 8765 101 30 42 1 100 170 20 10 1234 1 100 285 15 15 8765 2 101 70 20 20
In the sample input the first four orders have T = BUY . Assuming that at the beginning GP at the exchange was equal to 1, after receiving these orders the order book looks in the following way when ordered according to the matching rules from the problem statement for Tb = BUY orders (first by the largest price, then by the smallest priority):
The fifth order (with IDa = 4321) has Ta = SELL, Pa = 99, and Va = 125 and is eligible for match with all of the above four orders given in the above table. First, it matches twice with the order 1111 with the highest price of 101 for a total trade volume of 30, removes it from the order book, bumps GP to 6 in the process, and decreases Va to 95. Then, there are three other orders at price 100. One matching pass through them produces three trades for a total volume of 85 (volume 20 with order 42, volume 50 with order 239, removes it from the book, volume 15 with order 1234), bumps GP to 8, and decreases Va to 10. The remaining orders in the book are shown below:
One last match with the order 42 produces a trade with a volume of 10 (for a total volume of 30 for matches with order 42) and the order 4321 is done (Va = 0). Four corresponding total trades for order 4321 are printed in the sample output. The remaining order book is:
The sixth BUY order (with ID = 5678) is added to the order book (GP becomes 9):
The last, seventh order (with ID = 8765), can be matched only with the order 5678 due to price condition, generates a trade with volume of 30, order 5678 is removed from the order book, while order 8765 is added. Now the order book has both BUY and SELL orders: