![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
STL-set
文章平均质量分 80
snowy_smile
终于在ICPC World Final里拿到了气球!
再努力一点吧,坚持下去吧,梦想是会实现的! 人生会有低谷,但我更相信,未来也会有更多梦想能够实现~
展开
-
【UKIEPC2015 C】【STL set map stringstream】Conversation Log 网络审查 被所有人都说过的话 map套set法+人哈希法
map套set法: #include #include #include #include #include #include #include #include using namespace std; const int N=1e4+5; const int L=2e6+10; setname;//记录所有人名 map >cnt;//记录说过每句话的所有人名 mapfreq;//记录每句话原创 2015-11-03 17:43:18 · 793 阅读 · 0 评论 -
【Intel Code Challenge Elimination Round (Div1 + Div2, combined) D】【贪心 暴力 SET】Generating Sets n个不同的x变
D. Generating Sets time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a set Y of n distinct posi原创 2016-10-03 08:46:51 · 604 阅读 · 0 评论 -
【Educational Codeforces Round 10C】【脑洞 SET】Foe Pairs 不含有敌对pair的区间数
C. Foe Pairs time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given a permutation p of length n. Al原创 2016-03-27 09:58:36 · 820 阅读 · 0 评论 -
【Codeforces Round 345 (Div 2) B】【贪心 STL-set】Beautiful Paintings 安排顺序使得a[i]大于a[i-1]的i尽可能多
Beautiful Paintings time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n pictures delivered for the n原创 2016-03-08 19:09:19 · 474 阅读 · 0 评论 -
【2015-2016 XVI Open CupH】【STL大融合】Hierarchy 公司人来人往 公寓入住进出 求公司老大与寝室长
H. Hierarchy time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The hierarchical structure of the new office o原创 2016-03-08 18:49:56 · 1978 阅读 · 0 评论 -
【CROC 2016 — QualificationC】【STL大联合】Hostname Aliases 输出拥有相同后缀集合的全体字符串
Hostname Aliases time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output There are some websites that are accessibl原创 2016-03-20 08:32:16 · 452 阅读 · 0 评论 -
【CROC 2016 - Elimination RoundD】【二分答案orSet】Robot Rapping Results Report 最早多条边出现可以完成唯一拓扑序
Robot Rapping Results Report time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output While Farmer John rebuilds his原创 2016-03-19 12:33:16 · 503 阅读 · 0 评论 -
【Educational Codeforces Round 6D】【暴力 SET二分】Professor GukiZ and Two Arrays
D. Professor GukiZ and Two Arrays time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Professor GukiZ has two arr原创 2016-03-01 18:20:28 · 697 阅读 · 0 评论 -
【ZOJ3916 2016年浙大2月月赛B】【贪心 STL-SET】Buy Cakes n蛋糕k张折扣券蛋糕双价最多能买蛋糕数
Buy Cakes Time Limit: 2 Seconds Memory Limit: 65536 KB Andy is always a hungry man. He never stopped eating something sweet, expecially cakes. Yesterday his mother gave him some pocket原创 2016-03-01 17:53:59 · 2175 阅读 · 0 评论 -
【Codeforces Round 274 (Div 2)D】【STL-SET 讨论】Long Jumps 刻度尺最多加几个刻度使得可以测量X与Y
D. Long Jumps time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Valery is a PE teacher at a school in Berland. S原创 2015-12-08 15:58:14 · 930 阅读 · 0 评论 -
【Codeforces Round 331 (Div 2)C】【脑洞 SET贪心写法】Wilbur and Points 锯齿图形差值编号,右上角的最大
Wilbur and Points time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Wilbur is playing with a set of n points原创 2015-12-04 09:32:56 · 772 阅读 · 0 评论 -
【杭电2015年12月校赛H】【模拟 STL-MAP STL-SET stringstream】Study Words 从article中提取中10个没有学过的频率最高单词
Study Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 226 Accepted Submission(s): 80 Problem Description Learning English is n原创 2015-12-28 17:00:47 · 939 阅读 · 0 评论 -
【UKIEPC2015 M】【暴力匹配+SET去重】Milestone Counter 匀速行驶 合法的里程碑起点
#include #include #include #include #include #include #include #include using namespace std; typedef long long LL; const int N=1e3+10; int n,m; LL t[N],a[N],d[N],b[N]; LL gcd(LL x,LL y) { return原创 2015-11-03 17:41:02 · 668 阅读 · 0 评论 -
【HDU5565 BestCoder Round 62 (div1)C】【STL or 二分答案 or 计数排序】Clarke and baton n个人减肥m次求最后异或值
【HDU5565 BestCoder Round 62 (div1)C】【优先队列做法】Clarke and baton n个人减肥m次求最后异或值 #include #include #include #include #include #include #include #include #include #include #include #include #include usi原创 2015-11-18 10:38:56 · 767 阅读 · 0 评论 -
【HDU5524 BC61 div1 B】【SET模拟】Subtrees 二叉树不同子节点树的子树个数
Subtrees Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 98 Accepted Submission(s): 55 Problem Description There is a complete bin原创 2015-11-01 10:14:03 · 703 阅读 · 0 评论 -
【HDU5522 BC61 div2 A】【暴力orSET】Numbers 是否存在x+y=z
Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/262144 K (Java/Others) Total Submission(s): 150 Accepted Submission(s): 111 Problem Description There are n numbers A1,原创 2015-11-01 10:10:44 · 1007 阅读 · 0 评论 -
【2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest J】【二分答案+multiset】Journey to the “The World’
#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define MS(x,y) memset(x,y,sizeof(x)) #define MC(x,y) memcpy(x原创 2015-11-15 22:08:52 · 1034 阅读 · 0 评论 -
【2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest G】【脑洞 拓扑排序 大根堆小根堆极限维护】Graph DAG加k边使得最小拓扑序最大
#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define MS(x,y) memset(x,y,sizeof(x)) #define MC(x,y) memcpy(原创 2015-11-15 20:48:48 · 1441 阅读 · 0 评论 -
【[Offer收割]编程练习赛23 D】【最小生成树+set的启发式合并】观光旅行
题目4 : 观光旅行 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 小Hi去H市旅游,H 市有 n 个旅游景点,有 m 条双向道路连接这些旅游景点,使得任意两个景点之间都至少有一条路径可以到达。每条道路都会有一个不同的正整数 w 描述这条道路的拥挤系数。小Hi非常讨厌拥挤的感觉,因此当小Hi尝试从景点 u 去到景点原创 2017-08-20 14:43:55 · 1032 阅读 · 2 评论