codeforce681c Heap Operations
来源:互联网 发布:删除手机预装软件 编辑:程序博客网 时间:2024/06/07 07:17
Petya has recently learned data structure named "Binary heap".
The heap he is now operating with allows the following operations:
- put the given number into the heap;
- get the value of the minimum element in the heap;
- extract the minimum element from the heap;
Thus, at any moment of time the heap contains several integers (possibly none), some of them might be equal.
In order to better learn this data structure Petya took an empty heap and applied some operations above to it. Also, he carefully wrote down all the operations and their results to his event log, following the format:
- insert x — put the element with value x in the heap;
- getMin x — the value of the minimum element contained in the heap was equal to x;
- removeMin — the minimum element was extracted from the heap (only one instance, if there were many).
All the operations were correct, i.e. there was at least one element in the heap each time getMin or removeMin operations were applied.
While Petya was away for a lunch, his little brother Vova came to the room, took away some of the pages from Petya's log and used them to make paper boats.
Now Vova is worried, if he made Petya's sequence of operations inconsistent. For example, if one apply operations one-by-one in the order they are written in the event log, results of getMin operations might differ from the results recorded by Petya, and some of getMin or removeMin operations may be incorrect, as the heap is empty at the moment they are applied.
Now Vova wants to add some new operation records to the event log in order to make the resulting sequence of operations correct. That is, the result of each getMin operation is equal to the result in the record, and the heap is non-empty when getMin ad removeMin are applied. Vova wants to complete this as fast as possible, as the Petya may get back at any moment. He asks you to add the least possible number of operation records to the current log. Note that arbitrary number of operations may be added at the beginning, between any two other operations, or at the end of the log.
The first line of the input contains the only integer n (1 ≤ n ≤ 100 000) — the number of the records left in Petya's journal.
Each of the following n lines describe the records in the current log in the order they are applied. Format described in the statement is used. All numbers in the input are integers not exceeding 109 by their absolute value.
The first line of the output should contain a single integer m — the minimum possible number of records in the modified sequence of operations.
Next m lines should contain the corrected sequence of records following the format of the input (described in the statement), one per line and in the order they are applied. All the numbers in the output should be integers not exceeding 109 by their absolute value.
Note that the input sequence of operations must be the subsequence of the output sequence.
It's guaranteed that there exists the correct answer consisting of no more than 1 000 000 operations.
2insert 3getMin 4
4insert 3removeMininsert 4getMin 4
4insert 1insert 1removeMingetMin 2
6insert 1insert 1removeMinremoveMininsert 2getMin 2
In the first sample, after number 3 is inserted into the heap, the minimum number is 3. To make the result of the first getMin equal to 4one should firstly remove number 3 from the heap and then add number 4 into the heap.
In the second sample case number 1 is inserted two times, so should be similarly removed twice.
如果是insert就直接操作,如果是getMin x,先判断是否是空堆,然后把比x小的removeMin,一个结构体数组记录操作命令
#include<queue>#include<cstdio>#include<cstring>#include<vector>using namespace std;char cmd[3][15] = {"insert", "getMin", "removeMin"};priority_queue<int, vector<int>, greater<int> >que;const int M = 1e6 + 5;int tail = 0;struct Node{ int num; int argu;}a[M];void removeMin();void insert(int x){ que.push(x); a[tail].num = 0; a[tail++].argu = x;}void getMin(int x){ if(que.empty()) { insert(x); } else { if(que.top()<x) while(!que.empty()&&que.top()<x) removeMin(); if(que.empty()||que.top()!=x) insert(x); } a[tail].num = 1; a[tail++].argu = x;}void removeMin(){ if(que.empty()) { insert(0); } que.pop(); a[tail++].num = 2;}int main(){ int n,cmd_num,agr; char tmp[15]; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%s", tmp); for(int j=0;j<3;j++) if(strcmp(tmp, cmd[j])==0) { cmd_num = j; break; } if(cmd_num==0) { scanf("%d", &agr); insert(agr); } else if(cmd_num==1) { scanf("%d", &agr); getMin(agr); } else if(cmd_num==2) removeMin(); } printf("%d\n", tail); for(int i=0;i<tail;i++) { printf("%s", cmd[a[i].num]); if(a[i].num<=1) printf(" %d", a[i].argu); printf("\n"); } return 0;}
- codeforce681c Heap Operations
- Heap Operations
- Heap Operations
- Codeforces681C Heap Operations
- CodeForces 681C Heap Operations
- codeforces 681C Heap Operations
- CodeForces 681C Heap Operations
- CodeForces 681C Heap Operations
- Codeforces-Round-#357-(Div.-2)-Heap-Operations
- C. Heap Operations(cf#357)
- CodeForces 681C 模拟-Heap Operations
- Heap Operations(模拟优先队列)
- Codeforces Round #357 (Div. 2) C. Heap Operations
- Codeforces Round #357 (Div. 2)C. Heap Operations
- Codeforces Round #357 (Div. 2)-C. Heap Operations
- Codeforces Round #357 (Div. 2) C. Heap Operations
- 关于优先队列(681C - Heap Operations)
- Codeforces Round #357 (Div. 2)-C. Heap Operations(优先队列)
- 工作中的3点建议
- UISearchController与UITableView相互使用的小坑
- Ubuntu 的日常 ( 日常不间断/无规律更新 )
- 并发性与并行性 并发性与并行性
- Android常用工具类之Http网络请求的工具类
- codeforce681c Heap Operations
- 打印金字塔
- 欢迎使用CSDN-markdown编辑器
- 八岁男童坠楼身亡!暑假意外高发期,这些情况不得不防······
- leetcode 633. Sum of Square Numbers
- Centos7-64位系统安装Docker
- mysql常用命令
- 数据结构-链表(list)
- 海康摄像头视频实时监控