stl
smiling~
努力会被看得到的
展开
-
ccf 201912-3 化学方程式(模拟)
思路: 具体来说没啥坑点,就是嵌套括号的情况需要用一个栈把系数存起来,整体的计算也是用栈把元素分开然后计算,这种题就得把思路捋清楚最好多封装点函数,不然容易乱。对了,必须要吐槽一下,2019年这几个题的样例都是图片没办法复制,这么长的样例我手敲的,吐血!样例我放在代码最后的注释了,需要可以自取~代码:#include <cstdio>#include<iostream>#include<algorithm>#include<cstring>原创 2021-01-21 21:52:30 · 169 阅读 · 0 评论 -
ccf 201912-2 回收站选址(离散化)
思路: 坐标最大到1e9,但是坐标个数很小,离散化以后按题意模拟即可。但在我judge函数里面我判断这个坐标是否存在的时候直接用了if(mp[xx])以及if(!mp[xx]),然后发现迭代器遍历map的循环发生了死循环,这样判断会自动将xx添加进map里面,这个问题以前好像没发现,不知道是什么情况。如果有大佬看见可以帮我解答一下~代码:#include <cstdio>#include<iostream>#include<algorithm>#inclu原创 2021-01-20 16:08:59 · 103 阅读 · 0 评论 -
Criss-Cross Cables (贪心+优先队列)
As a participant in the BAPC (Bizarrely Awful Parties Competition) you are preparing for your next show. Now, you do not know anything about music, so you rip off someone else’s playlist and decide no...原创 2019-08-28 11:07:30 · 592 阅读 · 1 评论 -
HihoCoder - 1828 Saving Tang Monk II(bfs+优先队列)
《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng’en during the Ming Dynasty. In this novel, Monkey King Sun Wukong, pig ...原创 2019-09-03 10:33:13 · 181 阅读 · 0 评论